./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix038_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix038_rmo.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f852d15d7d2ea9e29c85a3a318a3b9cf4a94835 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 20:54:55,082 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 20:54:55,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 20:54:55,100 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 20:54:55,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 20:54:55,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 20:54:55,107 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 20:54:55,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 20:54:55,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 20:54:55,115 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 20:54:55,118 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 20:54:55,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 20:54:55,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 20:54:55,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 20:54:55,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 20:54:55,128 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 20:54:55,129 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 20:54:55,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 20:54:55,139 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 20:54:55,144 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 20:54:55,146 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 20:54:55,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 20:54:55,153 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 20:54:55,156 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 20:54:55,156 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 20:54:55,157 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 20:54:55,161 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 20:54:55,162 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 20:54:55,163 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 20:54:55,166 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 20:54:55,167 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 20:54:55,168 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 20:54:55,168 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 20:54:55,168 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 20:54:55,171 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 20:54:55,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 20:54:55,175 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 20:54:55,199 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 20:54:55,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 20:54:55,200 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 20:54:55,201 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 20:54:55,201 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 20:54:55,201 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 20:54:55,201 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 20:54:55,201 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 20:54:55,202 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 20:54:55,202 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 20:54:55,203 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 20:54:55,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 20:54:55,203 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 20:54:55,203 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 20:54:55,203 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 20:54:55,203 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 20:54:55,204 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 20:54:55,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 20:54:55,204 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 20:54:55,204 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 20:54:55,204 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 20:54:55,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 20:54:55,206 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 20:54:55,206 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 20:54:55,207 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 20:54:55,207 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 20:54:55,207 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 20:54:55,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 20:54:55,208 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 -> 1f852d15d7d2ea9e29c85a3a318a3b9cf4a94835 [2018-12-31 20:54:55,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 20:54:55,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 20:54:55,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 20:54:55,267 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 20:54:55,272 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 20:54:55,273 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix038_rmo.opt_false-unreach-call.i [2018-12-31 20:54:55,343 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240a7093b/71b8b0c0f92c4d899958de4b68a04515/FLAG59bc03c8c [2018-12-31 20:54:55,983 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 20:54:55,984 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix038_rmo.opt_false-unreach-call.i [2018-12-31 20:54:56,000 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240a7093b/71b8b0c0f92c4d899958de4b68a04515/FLAG59bc03c8c [2018-12-31 20:54:56,234 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240a7093b/71b8b0c0f92c4d899958de4b68a04515 [2018-12-31 20:54:56,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 20:54:56,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 20:54:56,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 20:54:56,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 20:54:56,247 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 20:54:56,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:54:56" (1/1) ... [2018-12-31 20:54:56,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785cf55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:56, skipping insertion in model container [2018-12-31 20:54:56,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:54:56" (1/1) ... [2018-12-31 20:54:56,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 20:54:56,342 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 20:54:56,859 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:54:56,874 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 20:54:57,061 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:54:57,144 INFO L195 MainTranslator]: Completed translation [2018-12-31 20:54:57,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:57 WrapperNode [2018-12-31 20:54:57,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 20:54:57,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 20:54:57,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 20:54:57,147 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 20:54:57,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:57" (1/1) ... [2018-12-31 20:54:57,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:57" (1/1) ... [2018-12-31 20:54:57,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 20:54:57,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 20:54:57,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 20:54:57,237 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 20:54:57,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:57" (1/1) ... [2018-12-31 20:54:57,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:57" (1/1) ... [2018-12-31 20:54:57,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:57" (1/1) ... [2018-12-31 20:54:57,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:57" (1/1) ... [2018-12-31 20:54:57,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:57" (1/1) ... [2018-12-31 20:54:57,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:57" (1/1) ... [2018-12-31 20:54:57,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:57" (1/1) ... [2018-12-31 20:54:57,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 20:54:57,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 20:54:57,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 20:54:57,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 20:54:57,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:57" (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-12-31 20:54:57,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 20:54:57,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 20:54:57,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 20:54:57,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 20:54:57,367 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 20:54:57,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 20:54:57,367 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 20:54:57,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 20:54:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-31 20:54:57,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-31 20:54:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 20:54:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 20:54:57,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 20:54:57,370 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 20:54:58,490 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 20:54:58,493 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 20:54:58,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:54:58 BoogieIcfgContainer [2018-12-31 20:54:58,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 20:54:58,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 20:54:58,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 20:54:58,499 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 20:54:58,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 08:54:56" (1/3) ... [2018-12-31 20:54:58,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b49235d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:54:58, skipping insertion in model container [2018-12-31 20:54:58,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:54:57" (2/3) ... [2018-12-31 20:54:58,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b49235d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:54:58, skipping insertion in model container [2018-12-31 20:54:58,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:54:58" (3/3) ... [2018-12-31 20:54:58,502 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_rmo.opt_false-unreach-call.i [2018-12-31 20:54:58,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,551 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,551 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,554 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,555 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,576 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,576 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,576 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,576 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,577 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,577 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,577 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,577 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,578 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,578 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,578 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,578 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,578 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,579 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,579 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,579 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,579 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,580 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,580 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,580 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,580 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,580 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,581 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,581 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,581 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,581 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,582 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,582 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,582 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,582 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,582 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,583 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,583 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,583 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,583 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,583 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,584 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,584 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:54:58,617 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 20:54:58,618 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 20:54:58,626 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 20:54:58,645 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 20:54:58,671 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 20:54:58,672 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 20:54:58,672 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 20:54:58,672 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 20:54:58,672 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 20:54:58,672 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 20:54:58,672 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 20:54:58,672 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 20:54:58,673 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 20:54:58,688 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 177 transitions [2018-12-31 20:55:32,802 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149045 states. [2018-12-31 20:55:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 149045 states. [2018-12-31 20:55:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 20:55:32,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:55:32,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:55:32,825 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:55:32,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:55:32,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1389776375, now seen corresponding path program 1 times [2018-12-31 20:55:32,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:55:32,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:55:32,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:55:32,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:55:32,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:55:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:55:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:55:33,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:55:33,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:55:33,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:55:33,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:55:33,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:55:33,346 INFO L87 Difference]: Start difference. First operand 149045 states. Second operand 4 states. [2018-12-31 20:55:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:55:35,721 INFO L93 Difference]: Finished difference Result 257065 states and 1188604 transitions. [2018-12-31 20:55:35,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:55:35,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-31 20:55:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:55:43,925 INFO L225 Difference]: With dead ends: 257065 [2018-12-31 20:55:43,925 INFO L226 Difference]: Without dead ends: 174815 [2018-12-31 20:55:43,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:55:45,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174815 states. [2018-12-31 20:55:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174815 to 110555. [2018-12-31 20:55:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110555 states. [2018-12-31 20:55:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110555 states to 110555 states and 511486 transitions. [2018-12-31 20:55:51,266 INFO L78 Accepts]: Start accepts. Automaton has 110555 states and 511486 transitions. Word has length 46 [2018-12-31 20:55:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:55:51,268 INFO L480 AbstractCegarLoop]: Abstraction has 110555 states and 511486 transitions. [2018-12-31 20:55:51,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:55:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 110555 states and 511486 transitions. [2018-12-31 20:55:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 20:55:51,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:55:51,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:55:51,293 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:55:51,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:55:51,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1733656626, now seen corresponding path program 1 times [2018-12-31 20:55:51,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:55:51,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:55:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:55:51,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:55:51,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:55:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:55:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:55:51,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:55:51,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:55:51,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:55:51,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:55:51,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:55:51,483 INFO L87 Difference]: Start difference. First operand 110555 states and 511486 transitions. Second operand 4 states. [2018-12-31 20:55:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:55:52,458 INFO L93 Difference]: Finished difference Result 99453 states and 448690 transitions. [2018-12-31 20:55:52,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:55:52,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-31 20:55:52,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:55:52,797 INFO L225 Difference]: With dead ends: 99453 [2018-12-31 20:55:52,797 INFO L226 Difference]: Without dead ends: 95223 [2018-12-31 20:55:52,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:55:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95223 states. [2018-12-31 20:55:55,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95223 to 95223. [2018-12-31 20:55:55,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95223 states. [2018-12-31 20:55:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95223 states to 95223 states and 433074 transitions. [2018-12-31 20:55:55,781 INFO L78 Accepts]: Start accepts. Automaton has 95223 states and 433074 transitions. Word has length 54 [2018-12-31 20:55:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:55:55,782 INFO L480 AbstractCegarLoop]: Abstraction has 95223 states and 433074 transitions. [2018-12-31 20:55:55,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:55:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 95223 states and 433074 transitions. [2018-12-31 20:55:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 20:55:55,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:55:55,798 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:55:55,798 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:55:55,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:55:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1834718252, now seen corresponding path program 1 times [2018-12-31 20:55:55,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:55:55,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:55:55,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:55:55,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:55:55,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:55:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:55:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:55:55,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:55:55,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:55:55,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:55:55,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:55:55,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:55:55,967 INFO L87 Difference]: Start difference. First operand 95223 states and 433074 transitions. Second operand 5 states. [2018-12-31 20:55:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:55:57,671 INFO L93 Difference]: Finished difference Result 30967 states and 124170 transitions. [2018-12-31 20:55:57,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:55:57,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-31 20:55:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:55:57,816 INFO L225 Difference]: With dead ends: 30967 [2018-12-31 20:55:57,817 INFO L226 Difference]: Without dead ends: 27339 [2018-12-31 20:55:57,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:55:57,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2018-12-31 20:55:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 26879. [2018-12-31 20:55:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26879 states. [2018-12-31 20:55:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26879 states to 26879 states and 107652 transitions. [2018-12-31 20:55:58,387 INFO L78 Accepts]: Start accepts. Automaton has 26879 states and 107652 transitions. Word has length 55 [2018-12-31 20:55:58,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:55:58,388 INFO L480 AbstractCegarLoop]: Abstraction has 26879 states and 107652 transitions. [2018-12-31 20:55:58,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:55:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 26879 states and 107652 transitions. [2018-12-31 20:55:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 20:55:58,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:55:58,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:55:58,394 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:55:58,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:55:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash 665822922, now seen corresponding path program 1 times [2018-12-31 20:55:58,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:55:58,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:55:58,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:55:58,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:55:58,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:55:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:55:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:55:58,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:55:58,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:55:58,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:55:58,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:55:58,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:55:58,682 INFO L87 Difference]: Start difference. First operand 26879 states and 107652 transitions. Second operand 6 states. [2018-12-31 20:55:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:55:59,674 INFO L93 Difference]: Finished difference Result 37431 states and 146189 transitions. [2018-12-31 20:55:59,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:55:59,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-31 20:55:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:55:59,813 INFO L225 Difference]: With dead ends: 37431 [2018-12-31 20:55:59,814 INFO L226 Difference]: Without dead ends: 37056 [2018-12-31 20:55:59,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:55:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37056 states. [2018-12-31 20:56:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37056 to 35272. [2018-12-31 20:56:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35272 states. [2018-12-31 20:56:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35272 states to 35272 states and 138747 transitions. [2018-12-31 20:56:00,646 INFO L78 Accepts]: Start accepts. Automaton has 35272 states and 138747 transitions. Word has length 55 [2018-12-31 20:56:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:00,646 INFO L480 AbstractCegarLoop]: Abstraction has 35272 states and 138747 transitions. [2018-12-31 20:56:00,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:56:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 35272 states and 138747 transitions. [2018-12-31 20:56:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 20:56:00,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:56:00,654 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:00,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:00,654 INFO L82 PathProgramCache]: Analyzing trace with hash 801075760, now seen corresponding path program 1 times [2018-12-31 20:56:00,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:00,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:00,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:00,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:00,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:56:00,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:56:00,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:56:00,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:56:00,721 INFO L87 Difference]: Start difference. First operand 35272 states and 138747 transitions. Second operand 3 states. [2018-12-31 20:56:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:01,039 INFO L93 Difference]: Finished difference Result 46812 states and 182039 transitions. [2018-12-31 20:56:01,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:56:01,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-31 20:56:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:01,210 INFO L225 Difference]: With dead ends: 46812 [2018-12-31 20:56:01,210 INFO L226 Difference]: Without dead ends: 46792 [2018-12-31 20:56:01,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:56:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46792 states. [2018-12-31 20:56:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46792 to 36254. [2018-12-31 20:56:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36254 states. [2018-12-31 20:56:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36254 states to 36254 states and 141454 transitions. [2018-12-31 20:56:02,048 INFO L78 Accepts]: Start accepts. Automaton has 36254 states and 141454 transitions. Word has length 57 [2018-12-31 20:56:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:02,048 INFO L480 AbstractCegarLoop]: Abstraction has 36254 states and 141454 transitions. [2018-12-31 20:56:02,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:56:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 36254 states and 141454 transitions. [2018-12-31 20:56:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 20:56:02,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:02,057 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] [2018-12-31 20:56:02,057 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:02,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:02,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1048459579, now seen corresponding path program 1 times [2018-12-31 20:56:02,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:02,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:02,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:02,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:02,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:02,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:02,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:56:02,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:56:02,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:56:02,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:56:02,313 INFO L87 Difference]: Start difference. First operand 36254 states and 141454 transitions. Second operand 6 states. [2018-12-31 20:56:03,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:03,410 INFO L93 Difference]: Finished difference Result 50346 states and 193876 transitions. [2018-12-31 20:56:03,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:56:03,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-31 20:56:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:03,594 INFO L225 Difference]: With dead ends: 50346 [2018-12-31 20:56:03,595 INFO L226 Difference]: Without dead ends: 49861 [2018-12-31 20:56:03,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 20:56:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49861 states. [2018-12-31 20:56:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49861 to 39288. [2018-12-31 20:56:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39288 states. [2018-12-31 20:56:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39288 states to 39288 states and 153275 transitions. [2018-12-31 20:56:04,449 INFO L78 Accepts]: Start accepts. Automaton has 39288 states and 153275 transitions. Word has length 61 [2018-12-31 20:56:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:04,449 INFO L480 AbstractCegarLoop]: Abstraction has 39288 states and 153275 transitions. [2018-12-31 20:56:04,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:56:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 39288 states and 153275 transitions. [2018-12-31 20:56:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 20:56:04,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:04,475 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-12-31 20:56:04,475 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:04,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:04,476 INFO L82 PathProgramCache]: Analyzing trace with hash -735521465, now seen corresponding path program 1 times [2018-12-31 20:56:04,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:04,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:04,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:04,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:04,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:56:04,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:56:04,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:56:04,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:56:04,590 INFO L87 Difference]: Start difference. First operand 39288 states and 153275 transitions. Second operand 4 states. [2018-12-31 20:56:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:04,985 INFO L93 Difference]: Finished difference Result 46151 states and 179278 transitions. [2018-12-31 20:56:04,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:56:04,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-31 20:56:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:05,119 INFO L225 Difference]: With dead ends: 46151 [2018-12-31 20:56:05,119 INFO L226 Difference]: Without dead ends: 46151 [2018-12-31 20:56:05,120 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-12-31 20:56:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46151 states. [2018-12-31 20:56:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46151 to 42183. [2018-12-31 20:56:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42183 states. [2018-12-31 20:56:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42183 states to 42183 states and 164110 transitions. [2018-12-31 20:56:06,505 INFO L78 Accepts]: Start accepts. Automaton has 42183 states and 164110 transitions. Word has length 72 [2018-12-31 20:56:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:06,506 INFO L480 AbstractCegarLoop]: Abstraction has 42183 states and 164110 transitions. [2018-12-31 20:56:06,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:56:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 42183 states and 164110 transitions. [2018-12-31 20:56:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 20:56:06,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:06,536 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-12-31 20:56:06,536 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1007288870, now seen corresponding path program 1 times [2018-12-31 20:56:06,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:06,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:06,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:06,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:06,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:56:06,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:56:06,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:56:06,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:56:06,829 INFO L87 Difference]: Start difference. First operand 42183 states and 164110 transitions. Second operand 6 states. [2018-12-31 20:56:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:06,959 INFO L93 Difference]: Finished difference Result 13863 states and 46334 transitions. [2018-12-31 20:56:06,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:56:06,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-31 20:56:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:06,993 INFO L225 Difference]: With dead ends: 13863 [2018-12-31 20:56:06,993 INFO L226 Difference]: Without dead ends: 11607 [2018-12-31 20:56:06,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:56:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11607 states. [2018-12-31 20:56:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11607 to 11017. [2018-12-31 20:56:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11017 states. [2018-12-31 20:56:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11017 states to 11017 states and 36286 transitions. [2018-12-31 20:56:07,238 INFO L78 Accepts]: Start accepts. Automaton has 11017 states and 36286 transitions. Word has length 72 [2018-12-31 20:56:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:07,239 INFO L480 AbstractCegarLoop]: Abstraction has 11017 states and 36286 transitions. [2018-12-31 20:56:07,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:56:07,239 INFO L276 IsEmpty]: Start isEmpty. Operand 11017 states and 36286 transitions. [2018-12-31 20:56:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:56:07,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:07,265 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] [2018-12-31 20:56:07,266 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:07,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1549026701, now seen corresponding path program 1 times [2018-12-31 20:56:07,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:07,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:07,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:07,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:07,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:07,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:07,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:56:07,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:56:07,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:56:07,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:56:07,470 INFO L87 Difference]: Start difference. First operand 11017 states and 36286 transitions. Second operand 4 states. [2018-12-31 20:56:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:08,113 INFO L93 Difference]: Finished difference Result 12233 states and 40430 transitions. [2018-12-31 20:56:08,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:56:08,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-31 20:56:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:08,139 INFO L225 Difference]: With dead ends: 12233 [2018-12-31 20:56:08,139 INFO L226 Difference]: Without dead ends: 12233 [2018-12-31 20:56:08,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:56:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2018-12-31 20:56:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 11401. [2018-12-31 20:56:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11401 states. [2018-12-31 20:56:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11401 states to 11401 states and 37662 transitions. [2018-12-31 20:56:08,321 INFO L78 Accepts]: Start accepts. Automaton has 11401 states and 37662 transitions. Word has length 91 [2018-12-31 20:56:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:08,322 INFO L480 AbstractCegarLoop]: Abstraction has 11401 states and 37662 transitions. [2018-12-31 20:56:08,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:56:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 11401 states and 37662 transitions. [2018-12-31 20:56:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:56:08,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:08,343 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] [2018-12-31 20:56:08,343 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:08,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:08,343 INFO L82 PathProgramCache]: Analyzing trace with hash 938486132, now seen corresponding path program 1 times [2018-12-31 20:56:08,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:08,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:08,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:08,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:08,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:08,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:08,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:56:08,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:56:08,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:56:08,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:56:08,512 INFO L87 Difference]: Start difference. First operand 11401 states and 37662 transitions. Second operand 4 states. [2018-12-31 20:56:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:08,826 INFO L93 Difference]: Finished difference Result 15846 states and 51308 transitions. [2018-12-31 20:56:08,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:56:08,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-31 20:56:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:08,856 INFO L225 Difference]: With dead ends: 15846 [2018-12-31 20:56:08,857 INFO L226 Difference]: Without dead ends: 15846 [2018-12-31 20:56:08,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:56:08,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15846 states. [2018-12-31 20:56:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15846 to 13863. [2018-12-31 20:56:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13863 states. [2018-12-31 20:56:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13863 states to 13863 states and 45161 transitions. [2018-12-31 20:56:09,103 INFO L78 Accepts]: Start accepts. Automaton has 13863 states and 45161 transitions. Word has length 91 [2018-12-31 20:56:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:09,104 INFO L480 AbstractCegarLoop]: Abstraction has 13863 states and 45161 transitions. [2018-12-31 20:56:09,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:56:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 13863 states and 45161 transitions. [2018-12-31 20:56:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:56:09,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:09,128 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] [2018-12-31 20:56:09,128 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:09,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:09,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1289286069, now seen corresponding path program 1 times [2018-12-31 20:56:09,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:09,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:09,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:09,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:09,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:09,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:09,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:56:09,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:56:09,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:56:09,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:56:09,260 INFO L87 Difference]: Start difference. First operand 13863 states and 45161 transitions. Second operand 3 states. [2018-12-31 20:56:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:09,628 INFO L93 Difference]: Finished difference Result 14973 states and 48614 transitions. [2018-12-31 20:56:09,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:56:09,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-31 20:56:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:09,657 INFO L225 Difference]: With dead ends: 14973 [2018-12-31 20:56:09,657 INFO L226 Difference]: Without dead ends: 14973 [2018-12-31 20:56:09,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:56:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14973 states. [2018-12-31 20:56:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14973 to 14473. [2018-12-31 20:56:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14473 states. [2018-12-31 20:56:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14473 states to 14473 states and 47069 transitions. [2018-12-31 20:56:09,905 INFO L78 Accepts]: Start accepts. Automaton has 14473 states and 47069 transitions. Word has length 91 [2018-12-31 20:56:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:09,905 INFO L480 AbstractCegarLoop]: Abstraction has 14473 states and 47069 transitions. [2018-12-31 20:56:09,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:56:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 14473 states and 47069 transitions. [2018-12-31 20:56:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:56:09,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:09,928 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] [2018-12-31 20:56:09,928 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:09,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:09,928 INFO L82 PathProgramCache]: Analyzing trace with hash -113408041, now seen corresponding path program 2 times [2018-12-31 20:56:09,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:09,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:09,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:09,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:09,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:10,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:10,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 20:56:10,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 20:56:10,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 20:56:10,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:56:10,179 INFO L87 Difference]: Start difference. First operand 14473 states and 47069 transitions. Second operand 9 states. [2018-12-31 20:56:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:10,774 INFO L93 Difference]: Finished difference Result 17330 states and 55834 transitions. [2018-12-31 20:56:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 20:56:10,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-12-31 20:56:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:10,809 INFO L225 Difference]: With dead ends: 17330 [2018-12-31 20:56:10,809 INFO L226 Difference]: Without dead ends: 17330 [2018-12-31 20:56:10,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-31 20:56:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17330 states. [2018-12-31 20:56:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17330 to 14538. [2018-12-31 20:56:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14538 states. [2018-12-31 20:56:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14538 states to 14538 states and 47236 transitions. [2018-12-31 20:56:11,050 INFO L78 Accepts]: Start accepts. Automaton has 14538 states and 47236 transitions. Word has length 91 [2018-12-31 20:56:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:11,050 INFO L480 AbstractCegarLoop]: Abstraction has 14538 states and 47236 transitions. [2018-12-31 20:56:11,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 20:56:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 14538 states and 47236 transitions. [2018-12-31 20:56:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:56:11,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:11,075 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] [2018-12-31 20:56:11,076 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:11,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:11,076 INFO L82 PathProgramCache]: Analyzing trace with hash -865610695, now seen corresponding path program 3 times [2018-12-31 20:56:11,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:11,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:11,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:56:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:11,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:11,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:56:11,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:56:11,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:56:11,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:56:11,446 INFO L87 Difference]: Start difference. First operand 14538 states and 47236 transitions. Second operand 5 states. [2018-12-31 20:56:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:12,261 INFO L93 Difference]: Finished difference Result 18290 states and 58747 transitions. [2018-12-31 20:56:12,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:56:12,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-31 20:56:12,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:12,296 INFO L225 Difference]: With dead ends: 18290 [2018-12-31 20:56:12,297 INFO L226 Difference]: Without dead ends: 18290 [2018-12-31 20:56:12,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:56:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18290 states. [2018-12-31 20:56:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18290 to 15023. [2018-12-31 20:56:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2018-12-31 20:56:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 48649 transitions. [2018-12-31 20:56:12,564 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 48649 transitions. Word has length 91 [2018-12-31 20:56:12,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:12,564 INFO L480 AbstractCegarLoop]: Abstraction has 15023 states and 48649 transitions. [2018-12-31 20:56:12,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:56:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 48649 transitions. [2018-12-31 20:56:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:56:12,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:12,594 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] [2018-12-31 20:56:12,595 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:12,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:12,595 INFO L82 PathProgramCache]: Analyzing trace with hash 466894554, now seen corresponding path program 2 times [2018-12-31 20:56:12,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:12,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:12,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:12,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:56:12,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:13,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:13,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:56:13,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:56:13,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:56:13,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:56:13,068 INFO L87 Difference]: Start difference. First operand 15023 states and 48649 transitions. Second operand 7 states. [2018-12-31 20:56:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:13,808 INFO L93 Difference]: Finished difference Result 28979 states and 94305 transitions. [2018-12-31 20:56:13,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 20:56:13,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-31 20:56:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:13,863 INFO L225 Difference]: With dead ends: 28979 [2018-12-31 20:56:13,863 INFO L226 Difference]: Without dead ends: 28979 [2018-12-31 20:56:13,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-31 20:56:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28979 states. [2018-12-31 20:56:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28979 to 17566. [2018-12-31 20:56:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17566 states. [2018-12-31 20:56:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17566 states to 17566 states and 57306 transitions. [2018-12-31 20:56:14,213 INFO L78 Accepts]: Start accepts. Automaton has 17566 states and 57306 transitions. Word has length 91 [2018-12-31 20:56:14,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:14,213 INFO L480 AbstractCegarLoop]: Abstraction has 17566 states and 57306 transitions. [2018-12-31 20:56:14,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:56:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 17566 states and 57306 transitions. [2018-12-31 20:56:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:56:14,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:14,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:56:14,251 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:14,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:14,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1354398235, now seen corresponding path program 1 times [2018-12-31 20:56:14,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:14,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:14,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:14,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:56:14,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:14,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-12-31 20:56:14,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:14,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:56:14,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:56:14,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:56:14,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:56:14,603 INFO L87 Difference]: Start difference. First operand 17566 states and 57306 transitions. Second operand 6 states. [2018-12-31 20:56:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:14,818 INFO L93 Difference]: Finished difference Result 21641 states and 69576 transitions. [2018-12-31 20:56:14,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:56:14,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-31 20:56:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:14,856 INFO L225 Difference]: With dead ends: 21641 [2018-12-31 20:56:14,856 INFO L226 Difference]: Without dead ends: 21641 [2018-12-31 20:56:14,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:56:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21641 states. [2018-12-31 20:56:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21641 to 16339. [2018-12-31 20:56:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16339 states. [2018-12-31 20:56:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16339 states to 16339 states and 52441 transitions. [2018-12-31 20:56:15,131 INFO L78 Accepts]: Start accepts. Automaton has 16339 states and 52441 transitions. Word has length 91 [2018-12-31 20:56:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:15,131 INFO L480 AbstractCegarLoop]: Abstraction has 16339 states and 52441 transitions. [2018-12-31 20:56:15,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:56:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 16339 states and 52441 transitions. [2018-12-31 20:56:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:56:15,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:15,153 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] [2018-12-31 20:56:15,153 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:15,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:15,153 INFO L82 PathProgramCache]: Analyzing trace with hash -377577317, now seen corresponding path program 1 times [2018-12-31 20:56:15,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:15,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:15,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:15,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:15,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:15,473 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 20:56:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:15,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:15,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:56:15,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:56:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:56:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:56:15,519 INFO L87 Difference]: Start difference. First operand 16339 states and 52441 transitions. Second operand 6 states. [2018-12-31 20:56:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:15,771 INFO L93 Difference]: Finished difference Result 15443 states and 48825 transitions. [2018-12-31 20:56:15,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:56:15,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-31 20:56:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:15,804 INFO L225 Difference]: With dead ends: 15443 [2018-12-31 20:56:15,805 INFO L226 Difference]: Without dead ends: 15443 [2018-12-31 20:56:15,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:56:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15443 states. [2018-12-31 20:56:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15443 to 12741. [2018-12-31 20:56:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12741 states. [2018-12-31 20:56:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12741 states to 12741 states and 40618 transitions. [2018-12-31 20:56:16,039 INFO L78 Accepts]: Start accepts. Automaton has 12741 states and 40618 transitions. Word has length 91 [2018-12-31 20:56:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:16,039 INFO L480 AbstractCegarLoop]: Abstraction has 12741 states and 40618 transitions. [2018-12-31 20:56:16,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:56:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 12741 states and 40618 transitions. [2018-12-31 20:56:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:56:16,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:56:16,060 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:16,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash -886914850, now seen corresponding path program 1 times [2018-12-31 20:56:16,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:16,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:16,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:16,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:16,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:16,223 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 20:56:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:16,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:16,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:56:16,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:56:16,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:56:16,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:56:16,532 INFO L87 Difference]: Start difference. First operand 12741 states and 40618 transitions. Second operand 6 states. [2018-12-31 20:56:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:17,399 INFO L93 Difference]: Finished difference Result 16641 states and 52728 transitions. [2018-12-31 20:56:17,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:56:17,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-31 20:56:17,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:17,432 INFO L225 Difference]: With dead ends: 16641 [2018-12-31 20:56:17,432 INFO L226 Difference]: Without dead ends: 16266 [2018-12-31 20:56:17,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:56:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16266 states. [2018-12-31 20:56:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16266 to 15261. [2018-12-31 20:56:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15261 states. [2018-12-31 20:56:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15261 states to 15261 states and 48579 transitions. [2018-12-31 20:56:17,812 INFO L78 Accepts]: Start accepts. Automaton has 15261 states and 48579 transitions. Word has length 93 [2018-12-31 20:56:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:17,813 INFO L480 AbstractCegarLoop]: Abstraction has 15261 states and 48579 transitions. [2018-12-31 20:56:17,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:56:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 15261 states and 48579 transitions. [2018-12-31 20:56:17,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:56:17,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:17,838 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] [2018-12-31 20:56:17,839 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:17,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:17,839 INFO L82 PathProgramCache]: Analyzing trace with hash -536114913, now seen corresponding path program 1 times [2018-12-31 20:56:17,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:17,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:17,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:17,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:17,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:18,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:18,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:56:18,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:56:18,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:56:18,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:56:18,123 INFO L87 Difference]: Start difference. First operand 15261 states and 48579 transitions. Second operand 6 states. [2018-12-31 20:56:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:18,530 INFO L93 Difference]: Finished difference Result 18581 states and 57280 transitions. [2018-12-31 20:56:18,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:56:18,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-31 20:56:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:18,562 INFO L225 Difference]: With dead ends: 18581 [2018-12-31 20:56:18,562 INFO L226 Difference]: Without dead ends: 18581 [2018-12-31 20:56:18,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:56:18,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18581 states. [2018-12-31 20:56:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18581 to 15531. [2018-12-31 20:56:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15531 states. [2018-12-31 20:56:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15531 states to 15531 states and 48385 transitions. [2018-12-31 20:56:18,828 INFO L78 Accepts]: Start accepts. Automaton has 15531 states and 48385 transitions. Word has length 93 [2018-12-31 20:56:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:18,828 INFO L480 AbstractCegarLoop]: Abstraction has 15531 states and 48385 transitions. [2018-12-31 20:56:18,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:56:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 15531 states and 48385 transitions. [2018-12-31 20:56:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:56:18,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:18,850 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] [2018-12-31 20:56:18,851 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:18,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash -324764000, now seen corresponding path program 1 times [2018-12-31 20:56:18,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:18,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:18,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:18,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:18,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:19,746 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-12-31 20:56:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:19,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:20,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:56:20,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:56:20,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:56:20,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:56:20,002 INFO L87 Difference]: Start difference. First operand 15531 states and 48385 transitions. Second operand 7 states. [2018-12-31 20:56:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:20,582 INFO L93 Difference]: Finished difference Result 18048 states and 55966 transitions. [2018-12-31 20:56:20,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:56:20,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-31 20:56:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:20,617 INFO L225 Difference]: With dead ends: 18048 [2018-12-31 20:56:20,617 INFO L226 Difference]: Without dead ends: 18048 [2018-12-31 20:56:20,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:56:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18048 states. [2018-12-31 20:56:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18048 to 17579. [2018-12-31 20:56:20,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17579 states. [2018-12-31 20:56:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17579 states to 17579 states and 54674 transitions. [2018-12-31 20:56:20,912 INFO L78 Accepts]: Start accepts. Automaton has 17579 states and 54674 transitions. Word has length 93 [2018-12-31 20:56:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:20,912 INFO L480 AbstractCegarLoop]: Abstraction has 17579 states and 54674 transitions. [2018-12-31 20:56:20,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:56:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 17579 states and 54674 transitions. [2018-12-31 20:56:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:56:20,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:20,934 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] [2018-12-31 20:56:20,935 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:20,935 INFO L82 PathProgramCache]: Analyzing trace with hash 562739681, now seen corresponding path program 1 times [2018-12-31 20:56:20,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:20,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:20,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:20,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:20,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:21,204 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 20:56:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:21,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:21,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 20:56:21,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 20:56:21,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 20:56:21,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:56:21,394 INFO L87 Difference]: Start difference. First operand 17579 states and 54674 transitions. Second operand 10 states. [2018-12-31 20:56:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:23,176 INFO L93 Difference]: Finished difference Result 30485 states and 94595 transitions. [2018-12-31 20:56:23,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:56:23,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-31 20:56:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:23,216 INFO L225 Difference]: With dead ends: 30485 [2018-12-31 20:56:23,217 INFO L226 Difference]: Without dead ends: 20724 [2018-12-31 20:56:23,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-31 20:56:23,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20724 states. [2018-12-31 20:56:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20724 to 17779. [2018-12-31 20:56:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17779 states. [2018-12-31 20:56:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17779 states to 17779 states and 54879 transitions. [2018-12-31 20:56:23,523 INFO L78 Accepts]: Start accepts. Automaton has 17779 states and 54879 transitions. Word has length 93 [2018-12-31 20:56:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:23,523 INFO L480 AbstractCegarLoop]: Abstraction has 17779 states and 54879 transitions. [2018-12-31 20:56:23,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 20:56:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 17779 states and 54879 transitions. [2018-12-31 20:56:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:56:23,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:23,549 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] [2018-12-31 20:56:23,549 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:23,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:23,549 INFO L82 PathProgramCache]: Analyzing trace with hash -212858757, now seen corresponding path program 2 times [2018-12-31 20:56:23,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:23,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:23,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:23,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:23,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:23,901 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 20:56:24,081 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 20:56:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:24,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:24,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 20:56:24,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 20:56:24,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 20:56:24,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:56:24,289 INFO L87 Difference]: Start difference. First operand 17779 states and 54879 transitions. Second operand 10 states. [2018-12-31 20:56:25,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:25,329 INFO L93 Difference]: Finished difference Result 32943 states and 101272 transitions. [2018-12-31 20:56:25,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:56:25,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-31 20:56:25,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:25,360 INFO L225 Difference]: With dead ends: 32943 [2018-12-31 20:56:25,361 INFO L226 Difference]: Without dead ends: 15791 [2018-12-31 20:56:25,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-31 20:56:25,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15791 states. [2018-12-31 20:56:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15791 to 15791. [2018-12-31 20:56:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15791 states. [2018-12-31 20:56:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15791 states to 15791 states and 48507 transitions. [2018-12-31 20:56:25,606 INFO L78 Accepts]: Start accepts. Automaton has 15791 states and 48507 transitions. Word has length 93 [2018-12-31 20:56:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:25,606 INFO L480 AbstractCegarLoop]: Abstraction has 15791 states and 48507 transitions. [2018-12-31 20:56:25,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 20:56:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 15791 states and 48507 transitions. [2018-12-31 20:56:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:56:25,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:25,628 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] [2018-12-31 20:56:25,629 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:25,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:25,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1764786221, now seen corresponding path program 3 times [2018-12-31 20:56:25,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:25,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:25,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:25,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:56:25,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:25,879 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 20:56:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:25,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:25,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:56:25,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:56:25,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:56:25,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:56:25,940 INFO L87 Difference]: Start difference. First operand 15791 states and 48507 transitions. Second operand 7 states. [2018-12-31 20:56:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:26,635 INFO L93 Difference]: Finished difference Result 27352 states and 84017 transitions. [2018-12-31 20:56:26,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:56:26,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-31 20:56:26,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:26,657 INFO L225 Difference]: With dead ends: 27352 [2018-12-31 20:56:26,657 INFO L226 Difference]: Without dead ends: 11170 [2018-12-31 20:56:26,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:56:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11170 states. [2018-12-31 20:56:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11170 to 11170. [2018-12-31 20:56:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11170 states. [2018-12-31 20:56:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11170 states to 11170 states and 34299 transitions. [2018-12-31 20:56:26,833 INFO L78 Accepts]: Start accepts. Automaton has 11170 states and 34299 transitions. Word has length 93 [2018-12-31 20:56:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:26,834 INFO L480 AbstractCegarLoop]: Abstraction has 11170 states and 34299 transitions. [2018-12-31 20:56:26,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:56:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 11170 states and 34299 transitions. [2018-12-31 20:56:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:56:26,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:26,850 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] [2018-12-31 20:56:26,850 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:26,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:26,850 INFO L82 PathProgramCache]: Analyzing trace with hash -176237099, now seen corresponding path program 1 times [2018-12-31 20:56:26,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:26,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:26,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:26,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:56:26,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:27,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:27,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:56:27,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:56:27,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:56:27,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:56:27,546 INFO L87 Difference]: Start difference. First operand 11170 states and 34299 transitions. Second operand 7 states. [2018-12-31 20:56:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:29,453 INFO L93 Difference]: Finished difference Result 12916 states and 39742 transitions. [2018-12-31 20:56:29,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:56:29,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-31 20:56:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:29,478 INFO L225 Difference]: With dead ends: 12916 [2018-12-31 20:56:29,478 INFO L226 Difference]: Without dead ends: 12916 [2018-12-31 20:56:29,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:56:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12916 states. [2018-12-31 20:56:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12916 to 11488. [2018-12-31 20:56:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11488 states. [2018-12-31 20:56:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 35435 transitions. [2018-12-31 20:56:29,673 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 35435 transitions. Word has length 93 [2018-12-31 20:56:29,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:29,674 INFO L480 AbstractCegarLoop]: Abstraction has 11488 states and 35435 transitions. [2018-12-31 20:56:29,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:56:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 35435 transitions. [2018-12-31 20:56:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:56:29,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:29,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] [2018-12-31 20:56:29,692 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:29,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:29,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1867643991, now seen corresponding path program 2 times [2018-12-31 20:56:29,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:29,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:29,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:29,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:29,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:29,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:29,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:56:29,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:56:29,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:56:29,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:56:29,859 INFO L87 Difference]: Start difference. First operand 11488 states and 35435 transitions. Second operand 7 states. [2018-12-31 20:56:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:30,175 INFO L93 Difference]: Finished difference Result 11952 states and 36555 transitions. [2018-12-31 20:56:30,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:56:30,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-31 20:56:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:30,197 INFO L225 Difference]: With dead ends: 11952 [2018-12-31 20:56:30,198 INFO L226 Difference]: Without dead ends: 11952 [2018-12-31 20:56:30,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:56:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11952 states. [2018-12-31 20:56:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11952 to 10840. [2018-12-31 20:56:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10840 states. [2018-12-31 20:56:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10840 states to 10840 states and 33189 transitions. [2018-12-31 20:56:30,364 INFO L78 Accepts]: Start accepts. Automaton has 10840 states and 33189 transitions. Word has length 93 [2018-12-31 20:56:30,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:30,364 INFO L480 AbstractCegarLoop]: Abstraction has 10840 states and 33189 transitions. [2018-12-31 20:56:30,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:56:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 10840 states and 33189 transitions. [2018-12-31 20:56:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:56:30,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:30,379 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] [2018-12-31 20:56:30,379 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:30,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2078994904, now seen corresponding path program 2 times [2018-12-31 20:56:30,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:30,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:30,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:30,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:56:30,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:31,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:31,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 20:56:31,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 20:56:31,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 20:56:31,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:56:31,144 INFO L87 Difference]: Start difference. First operand 10840 states and 33189 transitions. Second operand 8 states. [2018-12-31 20:56:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:31,497 INFO L93 Difference]: Finished difference Result 12376 states and 37809 transitions. [2018-12-31 20:56:31,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 20:56:31,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-31 20:56:31,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:31,523 INFO L225 Difference]: With dead ends: 12376 [2018-12-31 20:56:31,524 INFO L226 Difference]: Without dead ends: 12376 [2018-12-31 20:56:31,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-31 20:56:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12376 states. [2018-12-31 20:56:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12376 to 10932. [2018-12-31 20:56:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10932 states. [2018-12-31 20:56:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10932 states to 10932 states and 33422 transitions. [2018-12-31 20:56:31,730 INFO L78 Accepts]: Start accepts. Automaton has 10932 states and 33422 transitions. Word has length 93 [2018-12-31 20:56:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:31,731 INFO L480 AbstractCegarLoop]: Abstraction has 10932 states and 33422 transitions. [2018-12-31 20:56:31,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 20:56:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 10932 states and 33422 transitions. [2018-12-31 20:56:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:56:31,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:31,749 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] [2018-12-31 20:56:31,749 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:31,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:31,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1328468711, now seen corresponding path program 4 times [2018-12-31 20:56:31,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:31,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:31,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:31,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:56:31,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:31,991 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 20:56:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:32,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:32,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 20:56:32,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 20:56:32,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 20:56:32,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:56:32,085 INFO L87 Difference]: Start difference. First operand 10932 states and 33422 transitions. Second operand 11 states. [2018-12-31 20:56:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:33,272 INFO L93 Difference]: Finished difference Result 18980 states and 58202 transitions. [2018-12-31 20:56:33,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:56:33,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2018-12-31 20:56:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:56:33,297 INFO L225 Difference]: With dead ends: 18980 [2018-12-31 20:56:33,297 INFO L226 Difference]: Without dead ends: 12154 [2018-12-31 20:56:33,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-31 20:56:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12154 states. [2018-12-31 20:56:33,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12154 to 10842. [2018-12-31 20:56:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10842 states. [2018-12-31 20:56:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10842 states to 10842 states and 33174 transitions. [2018-12-31 20:56:33,477 INFO L78 Accepts]: Start accepts. Automaton has 10842 states and 33174 transitions. Word has length 93 [2018-12-31 20:56:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:56:33,477 INFO L480 AbstractCegarLoop]: Abstraction has 10842 states and 33174 transitions. [2018-12-31 20:56:33,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 20:56:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 10842 states and 33174 transitions. [2018-12-31 20:56:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:56:33,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:33,492 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] [2018-12-31 20:56:33,493 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:33,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:33,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1146950903, now seen corresponding path program 5 times [2018-12-31 20:56:33,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:33,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:33,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:33,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:56:33,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:56:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:56:33,605 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 20:56:33,823 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 20:56:33,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 08:56:33 BasicIcfg [2018-12-31 20:56:33,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 20:56:33,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 20:56:33,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 20:56:33,828 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 20:56:33,828 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:54:58" (3/4) ... [2018-12-31 20:56:33,832 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 20:56:34,047 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 20:56:34,048 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 20:56:34,049 INFO L168 Benchmark]: Toolchain (without parser) took 97809.78 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 948.7 MB in the beginning and 1.6 GB in the end (delta: -626.5 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-12-31 20:56:34,050 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:56:34,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 904.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-12-31 20:56:34,051 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 20:56:34,052 INFO L168 Benchmark]: Boogie Preprocessor took 45.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:56:34,054 INFO L168 Benchmark]: RCFGBuilder took 1210.93 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: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2018-12-31 20:56:34,054 INFO L168 Benchmark]: TraceAbstraction took 95330.34 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -575.5 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-12-31 20:56:34,054 INFO L168 Benchmark]: Witness Printer took 220.92 ms. Allocated memory is still 5.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. [2018-12-31 20:56:34,059 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.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 904.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.48 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 1210.93 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: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 95330.34 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -575.5 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 220.92 ms. Allocated memory is still 5.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] -1 pthread_t t1018; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] FCALL, FORK -1 pthread_create(&t1018, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] -1 pthread_t t1019; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] FCALL, FORK -1 pthread_create(&t1019, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] -1 pthread_t t1020; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] FCALL, FORK -1 pthread_create(&t1020, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 [L768] 0 __unbuffered_p2_EAX = z [L771] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 x = 1 [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 2 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 2 !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 [!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)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [!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)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0: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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [!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)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0: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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 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) [L776] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L777] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=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))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 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)) [L734] EXPR 2 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 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)) [L735] EXPR 2 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 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)) [L736] EXPR 2 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 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)) [L737] EXPR 2 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 2 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)) [L738] EXPR 2 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 2 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)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L778] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L781] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] -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) [L808] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -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 [L810] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -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 [L814] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 219 locations, 3 error locations. UNSAFE Result, 95.1s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 31.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6698 SDtfs, 8417 SDslu, 18647 SDs, 0 SdLazy, 6431 SolverSat, 255 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 69 SyntacticMatches, 20 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149045occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 19.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 133729 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 2223 NumberOfCodeBlocks, 2223 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2104 ConstructedInterpolants, 0 QuantifiedInterpolants, 467828 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...