./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 0ed9222f 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-0ed9222-m [2019-01-13 01:49:46,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 01:49:46,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 01:49:46,136 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 01:49:46,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 01:49:46,137 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 01:49:46,139 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 01:49:46,141 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 01:49:46,147 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 01:49:46,148 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 01:49:46,149 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 01:49:46,149 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 01:49:46,150 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 01:49:46,151 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 01:49:46,155 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 01:49:46,156 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 01:49:46,157 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 01:49:46,163 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 01:49:46,168 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 01:49:46,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 01:49:46,176 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 01:49:46,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 01:49:46,183 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 01:49:46,186 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 01:49:46,186 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 01:49:46,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 01:49:46,190 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 01:49:46,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 01:49:46,192 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 01:49:46,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 01:49:46,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 01:49:46,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 01:49:46,198 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 01:49:46,198 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 01:49:46,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 01:49:46,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 01:49:46,206 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 01:49:46,238 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 01:49:46,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 01:49:46,239 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 01:49:46,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 01:49:46,241 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 01:49:46,241 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 01:49:46,241 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 01:49:46,242 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 01:49:46,242 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 01:49:46,242 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 01:49:46,242 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 01:49:46,242 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 01:49:46,242 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 01:49:46,244 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 01:49:46,244 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 01:49:46,244 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 01:49:46,244 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 01:49:46,244 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 01:49:46,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 01:49:46,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 01:49:46,245 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 01:49:46,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 01:49:46,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 01:49:46,246 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 01:49:46,247 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 01:49:46,247 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 01:49:46,248 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 01:49:46,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 01:49:46,248 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 [2019-01-13 01:49:46,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 01:49:46,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 01:49:46,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 01:49:46,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 01:49:46,328 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 01:49:46,329 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix038_rmo.opt_false-unreach-call.i [2019-01-13 01:49:46,388 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a2efa04/a9cf6aaebf864ac7a9bcb3ff4779d141/FLAG826fa73ce [2019-01-13 01:49:46,955 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 01:49:46,956 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix038_rmo.opt_false-unreach-call.i [2019-01-13 01:49:46,975 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a2efa04/a9cf6aaebf864ac7a9bcb3ff4779d141/FLAG826fa73ce [2019-01-13 01:49:47,218 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a2efa04/a9cf6aaebf864ac7a9bcb3ff4779d141 [2019-01-13 01:49:47,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 01:49:47,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 01:49:47,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 01:49:47,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 01:49:47,230 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 01:49:47,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 01:49:47" (1/1) ... [2019-01-13 01:49:47,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd106d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47, skipping insertion in model container [2019-01-13 01:49:47,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 01:49:47" (1/1) ... [2019-01-13 01:49:47,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 01:49:47,308 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 01:49:47,689 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 01:49:47,704 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 01:49:47,876 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 01:49:47,959 INFO L195 MainTranslator]: Completed translation [2019-01-13 01:49:47,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47 WrapperNode [2019-01-13 01:49:47,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 01:49:47,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 01:49:47,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 01:49:47,961 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 01:49:47,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47" (1/1) ... [2019-01-13 01:49:47,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47" (1/1) ... [2019-01-13 01:49:48,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 01:49:48,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 01:49:48,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 01:49:48,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 01:49:48,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47" (1/1) ... [2019-01-13 01:49:48,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47" (1/1) ... [2019-01-13 01:49:48,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47" (1/1) ... [2019-01-13 01:49:48,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47" (1/1) ... [2019-01-13 01:49:48,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47" (1/1) ... [2019-01-13 01:49:48,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47" (1/1) ... [2019-01-13 01:49:48,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47" (1/1) ... [2019-01-13 01:49:48,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 01:49:48,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 01:49:48,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 01:49:48,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 01:49:48,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47" (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 [2019-01-13 01:49:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 01:49:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 01:49:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 01:49:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 01:49:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 01:49:48,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 01:49:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 01:49:48,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 01:49:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-13 01:49:48,185 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-13 01:49:48,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 01:49:48,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 01:49:48,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 01:49:48,187 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 01:49:49,256 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 01:49:49,257 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 01:49:49,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:49:49 BoogieIcfgContainer [2019-01-13 01:49:49,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 01:49:49,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 01:49:49,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 01:49:49,264 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 01:49:49,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 01:49:47" (1/3) ... [2019-01-13 01:49:49,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78cf0713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 01:49:49, skipping insertion in model container [2019-01-13 01:49:49,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:49:47" (2/3) ... [2019-01-13 01:49:49,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78cf0713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 01:49:49, skipping insertion in model container [2019-01-13 01:49:49,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:49:49" (3/3) ... [2019-01-13 01:49:49,269 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_rmo.opt_false-unreach-call.i [2019-01-13 01:49:49,322 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,323 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,323 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,323 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,330 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,330 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,353 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,355 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,355 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,355 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,355 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,356 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,356 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,356 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,356 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,358 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,362 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,364 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,364 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,364 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,364 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,364 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,365 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,367 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,368 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,368 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,368 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,368 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,368 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,373 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,374 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,377 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,377 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,377 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,378 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,382 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,382 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,383 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,383 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,383 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,383 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:49:49,432 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 01:49:49,433 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 01:49:49,446 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 01:49:49,465 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 01:49:49,494 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 01:49:49,495 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 01:49:49,495 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 01:49:49,495 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 01:49:49,496 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 01:49:49,496 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 01:49:49,496 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 01:49:49,496 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 01:49:49,496 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 01:49:49,510 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 177 transitions [2019-01-13 01:50:20,633 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149045 states. [2019-01-13 01:50:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 149045 states. [2019-01-13 01:50:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 01:50:20,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:50:20,652 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] [2019-01-13 01:50:20,654 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:50:20,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:50:20,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1389776375, now seen corresponding path program 1 times [2019-01-13 01:50:20,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:50:20,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:50:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:20,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:50:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:50:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:50:21,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:50:21,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:50:21,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:50:21,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:50:21,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:50:21,149 INFO L87 Difference]: Start difference. First operand 149045 states. Second operand 4 states. [2019-01-13 01:50:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:50:27,846 INFO L93 Difference]: Finished difference Result 257065 states and 1188604 transitions. [2019-01-13 01:50:27,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:50:27,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-01-13 01:50:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:50:29,427 INFO L225 Difference]: With dead ends: 257065 [2019-01-13 01:50:29,428 INFO L226 Difference]: Without dead ends: 174815 [2019-01-13 01:50:29,430 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 [2019-01-13 01:50:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174815 states. [2019-01-13 01:50:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174815 to 110555. [2019-01-13 01:50:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110555 states. [2019-01-13 01:50:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110555 states to 110555 states and 511486 transitions. [2019-01-13 01:50:35,665 INFO L78 Accepts]: Start accepts. Automaton has 110555 states and 511486 transitions. Word has length 46 [2019-01-13 01:50:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:50:35,667 INFO L480 AbstractCegarLoop]: Abstraction has 110555 states and 511486 transitions. [2019-01-13 01:50:35,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:50:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 110555 states and 511486 transitions. [2019-01-13 01:50:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 01:50:35,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:50:35,689 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] [2019-01-13 01:50:35,690 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:50:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:50:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1733656626, now seen corresponding path program 1 times [2019-01-13 01:50:35,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:50:35,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:50:35,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:35,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:50:35,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:50:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:50:35,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:50:35,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:50:35,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:50:35,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:50:35,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:50:35,857 INFO L87 Difference]: Start difference. First operand 110555 states and 511486 transitions. Second operand 4 states. [2019-01-13 01:50:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:50:36,936 INFO L93 Difference]: Finished difference Result 99453 states and 448690 transitions. [2019-01-13 01:50:36,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:50:36,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-13 01:50:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:50:37,315 INFO L225 Difference]: With dead ends: 99453 [2019-01-13 01:50:37,315 INFO L226 Difference]: Without dead ends: 95223 [2019-01-13 01:50:37,316 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 [2019-01-13 01:50:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95223 states. [2019-01-13 01:50:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95223 to 95223. [2019-01-13 01:50:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95223 states. [2019-01-13 01:50:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95223 states to 95223 states and 433074 transitions. [2019-01-13 01:50:41,911 INFO L78 Accepts]: Start accepts. Automaton has 95223 states and 433074 transitions. Word has length 54 [2019-01-13 01:50:41,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:50:41,911 INFO L480 AbstractCegarLoop]: Abstraction has 95223 states and 433074 transitions. [2019-01-13 01:50:41,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:50:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 95223 states and 433074 transitions. [2019-01-13 01:50:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-13 01:50:41,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:50:41,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] [2019-01-13 01:50:41,929 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:50:41,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:50:41,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1834718252, now seen corresponding path program 1 times [2019-01-13 01:50:41,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:50:41,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:50:41,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:41,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:50:41,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:50:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:50:42,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:50:42,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:50:42,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:50:42,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:50:42,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:50:42,123 INFO L87 Difference]: Start difference. First operand 95223 states and 433074 transitions. Second operand 5 states. [2019-01-13 01:50:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:50:42,520 INFO L93 Difference]: Finished difference Result 30967 states and 124170 transitions. [2019-01-13 01:50:42,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 01:50:42,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-01-13 01:50:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:50:42,631 INFO L225 Difference]: With dead ends: 30967 [2019-01-13 01:50:42,632 INFO L226 Difference]: Without dead ends: 27339 [2019-01-13 01:50:42,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:50:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2019-01-13 01:50:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 26879. [2019-01-13 01:50:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26879 states. [2019-01-13 01:50:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26879 states to 26879 states and 107652 transitions. [2019-01-13 01:50:43,296 INFO L78 Accepts]: Start accepts. Automaton has 26879 states and 107652 transitions. Word has length 55 [2019-01-13 01:50:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:50:43,297 INFO L480 AbstractCegarLoop]: Abstraction has 26879 states and 107652 transitions. [2019-01-13 01:50:43,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:50:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 26879 states and 107652 transitions. [2019-01-13 01:50:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-13 01:50:43,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:50:43,302 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] [2019-01-13 01:50:43,302 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:50:43,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:50:43,304 INFO L82 PathProgramCache]: Analyzing trace with hash 665822922, now seen corresponding path program 1 times [2019-01-13 01:50:43,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:50:43,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:50:43,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:43,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:50:43,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:50:43,608 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-13 01:50:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:50:43,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:50:43,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:50:43,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:50:43,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:50:43,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:50:43,755 INFO L87 Difference]: Start difference. First operand 26879 states and 107652 transitions. Second operand 6 states. [2019-01-13 01:50:43,962 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-13 01:50:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:50:45,384 INFO L93 Difference]: Finished difference Result 37431 states and 146189 transitions. [2019-01-13 01:50:45,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:50:45,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-01-13 01:50:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:50:45,500 INFO L225 Difference]: With dead ends: 37431 [2019-01-13 01:50:45,500 INFO L226 Difference]: Without dead ends: 37056 [2019-01-13 01:50:45,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-13 01:50:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37056 states. [2019-01-13 01:50:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37056 to 35272. [2019-01-13 01:50:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35272 states. [2019-01-13 01:50:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35272 states to 35272 states and 138747 transitions. [2019-01-13 01:50:46,589 INFO L78 Accepts]: Start accepts. Automaton has 35272 states and 138747 transitions. Word has length 55 [2019-01-13 01:50:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:50:46,589 INFO L480 AbstractCegarLoop]: Abstraction has 35272 states and 138747 transitions. [2019-01-13 01:50:46,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:50:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 35272 states and 138747 transitions. [2019-01-13 01:50:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 01:50:46,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:50:46,600 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] [2019-01-13 01:50:46,601 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:50:46,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:50:46,601 INFO L82 PathProgramCache]: Analyzing trace with hash 801075760, now seen corresponding path program 1 times [2019-01-13 01:50:46,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:50:46,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:50:46,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:46,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:50:46,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:50:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:50:46,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:50:46,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:50:46,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:50:46,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:50:46,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:50:46,711 INFO L87 Difference]: Start difference. First operand 35272 states and 138747 transitions. Second operand 3 states. [2019-01-13 01:50:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:50:47,070 INFO L93 Difference]: Finished difference Result 46812 states and 182039 transitions. [2019-01-13 01:50:47,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:50:47,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-13 01:50:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:50:47,198 INFO L225 Difference]: With dead ends: 46812 [2019-01-13 01:50:47,198 INFO L226 Difference]: Without dead ends: 46792 [2019-01-13 01:50:47,198 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 [2019-01-13 01:50:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46792 states. [2019-01-13 01:50:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46792 to 36254. [2019-01-13 01:50:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36254 states. [2019-01-13 01:50:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36254 states to 36254 states and 141454 transitions. [2019-01-13 01:50:51,110 INFO L78 Accepts]: Start accepts. Automaton has 36254 states and 141454 transitions. Word has length 57 [2019-01-13 01:50:51,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:50:51,111 INFO L480 AbstractCegarLoop]: Abstraction has 36254 states and 141454 transitions. [2019-01-13 01:50:51,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:50:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 36254 states and 141454 transitions. [2019-01-13 01:50:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-13 01:50:51,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:50:51,120 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] [2019-01-13 01:50:51,120 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:50:51,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:50:51,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1048459579, now seen corresponding path program 1 times [2019-01-13 01:50:51,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:50:51,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:50:51,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:51,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:50:51,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:50:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:50:51,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:50:51,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:50:51,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:50:51,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:50:51,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:50:51,257 INFO L87 Difference]: Start difference. First operand 36254 states and 141454 transitions. Second operand 6 states. [2019-01-13 01:50:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:50:52,349 INFO L93 Difference]: Finished difference Result 50346 states and 193876 transitions. [2019-01-13 01:50:52,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 01:50:52,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-01-13 01:50:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:50:52,508 INFO L225 Difference]: With dead ends: 50346 [2019-01-13 01:50:52,509 INFO L226 Difference]: Without dead ends: 49861 [2019-01-13 01:50:52,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-13 01:50:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49861 states. [2019-01-13 01:50:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49861 to 39288. [2019-01-13 01:50:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39288 states. [2019-01-13 01:50:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39288 states to 39288 states and 153275 transitions. [2019-01-13 01:50:53,374 INFO L78 Accepts]: Start accepts. Automaton has 39288 states and 153275 transitions. Word has length 61 [2019-01-13 01:50:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:50:53,375 INFO L480 AbstractCegarLoop]: Abstraction has 39288 states and 153275 transitions. [2019-01-13 01:50:53,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:50:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 39288 states and 153275 transitions. [2019-01-13 01:50:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 01:50:53,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:50:53,400 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] [2019-01-13 01:50:53,400 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:50:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:50:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -735521465, now seen corresponding path program 1 times [2019-01-13 01:50:53,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:50:53,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:50:53,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:53,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:50:53,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:50:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:50:53,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:50:53,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:50:53,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:50:53,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:50:53,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:50:53,504 INFO L87 Difference]: Start difference. First operand 39288 states and 153275 transitions. Second operand 4 states. [2019-01-13 01:50:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:50:54,061 INFO L93 Difference]: Finished difference Result 46151 states and 179278 transitions. [2019-01-13 01:50:54,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:50:54,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-01-13 01:50:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:50:54,227 INFO L225 Difference]: With dead ends: 46151 [2019-01-13 01:50:54,228 INFO L226 Difference]: Without dead ends: 46151 [2019-01-13 01:50:54,228 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 [2019-01-13 01:50:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46151 states. [2019-01-13 01:50:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46151 to 42183. [2019-01-13 01:50:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42183 states. [2019-01-13 01:50:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42183 states to 42183 states and 164110 transitions. [2019-01-13 01:50:55,059 INFO L78 Accepts]: Start accepts. Automaton has 42183 states and 164110 transitions. Word has length 72 [2019-01-13 01:50:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:50:55,060 INFO L480 AbstractCegarLoop]: Abstraction has 42183 states and 164110 transitions. [2019-01-13 01:50:55,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:50:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 42183 states and 164110 transitions. [2019-01-13 01:50:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 01:50:55,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:50:55,088 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] [2019-01-13 01:50:55,088 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:50:55,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:50:55,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1007288870, now seen corresponding path program 1 times [2019-01-13 01:50:55,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:50:55,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:50:55,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:55,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:50:55,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:50:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:50:55,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:50:55,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:50:55,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:50:55,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:50:55,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:50:55,264 INFO L87 Difference]: Start difference. First operand 42183 states and 164110 transitions. Second operand 6 states. [2019-01-13 01:50:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:50:55,446 INFO L93 Difference]: Finished difference Result 13863 states and 46334 transitions. [2019-01-13 01:50:55,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:50:55,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-01-13 01:50:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:50:55,468 INFO L225 Difference]: With dead ends: 13863 [2019-01-13 01:50:55,469 INFO L226 Difference]: Without dead ends: 11607 [2019-01-13 01:50:55,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:50:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11607 states. [2019-01-13 01:50:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11607 to 11017. [2019-01-13 01:50:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11017 states. [2019-01-13 01:50:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11017 states to 11017 states and 36286 transitions. [2019-01-13 01:50:55,631 INFO L78 Accepts]: Start accepts. Automaton has 11017 states and 36286 transitions. Word has length 72 [2019-01-13 01:50:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:50:55,631 INFO L480 AbstractCegarLoop]: Abstraction has 11017 states and 36286 transitions. [2019-01-13 01:50:55,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:50:55,632 INFO L276 IsEmpty]: Start isEmpty. Operand 11017 states and 36286 transitions. [2019-01-13 01:50:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 01:50:55,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:50:55,650 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] [2019-01-13 01:50:55,650 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:50:55,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:50:55,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1549026701, now seen corresponding path program 1 times [2019-01-13 01:50:55,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:50:55,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:50:55,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:55,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:50:55,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:50:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:50:55,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:50:55,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:50:55,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:50:55,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:50:55,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:50:55,819 INFO L87 Difference]: Start difference. First operand 11017 states and 36286 transitions. Second operand 4 states. [2019-01-13 01:50:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:50:56,001 INFO L93 Difference]: Finished difference Result 12233 states and 40430 transitions. [2019-01-13 01:50:56,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:50:56,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 01:50:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:50:56,024 INFO L225 Difference]: With dead ends: 12233 [2019-01-13 01:50:56,024 INFO L226 Difference]: Without dead ends: 12233 [2019-01-13 01:50:56,025 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 [2019-01-13 01:50:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2019-01-13 01:50:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 11401. [2019-01-13 01:50:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11401 states. [2019-01-13 01:50:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11401 states to 11401 states and 37662 transitions. [2019-01-13 01:50:56,206 INFO L78 Accepts]: Start accepts. Automaton has 11401 states and 37662 transitions. Word has length 91 [2019-01-13 01:50:56,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:50:56,206 INFO L480 AbstractCegarLoop]: Abstraction has 11401 states and 37662 transitions. [2019-01-13 01:50:56,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:50:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 11401 states and 37662 transitions. [2019-01-13 01:50:56,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 01:50:56,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:50:56,228 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] [2019-01-13 01:50:56,228 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:50:56,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:50:56,228 INFO L82 PathProgramCache]: Analyzing trace with hash 938486132, now seen corresponding path program 1 times [2019-01-13 01:50:56,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:50:56,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:50:56,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:56,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:50:56,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:50:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:50:56,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:50:56,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:50:56,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:50:56,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:50:56,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:50:56,468 INFO L87 Difference]: Start difference. First operand 11401 states and 37662 transitions. Second operand 4 states. [2019-01-13 01:50:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:50:56,755 INFO L93 Difference]: Finished difference Result 15846 states and 51308 transitions. [2019-01-13 01:50:56,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:50:56,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 01:50:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:50:56,785 INFO L225 Difference]: With dead ends: 15846 [2019-01-13 01:50:56,785 INFO L226 Difference]: Without dead ends: 15846 [2019-01-13 01:50:56,786 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 [2019-01-13 01:50:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15846 states. [2019-01-13 01:50:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15846 to 13863. [2019-01-13 01:50:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13863 states. [2019-01-13 01:50:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13863 states to 13863 states and 45161 transitions. [2019-01-13 01:50:57,006 INFO L78 Accepts]: Start accepts. Automaton has 13863 states and 45161 transitions. Word has length 91 [2019-01-13 01:50:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:50:57,006 INFO L480 AbstractCegarLoop]: Abstraction has 13863 states and 45161 transitions. [2019-01-13 01:50:57,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:50:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 13863 states and 45161 transitions. [2019-01-13 01:50:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 01:50:57,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:50:57,029 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] [2019-01-13 01:50:57,029 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:50:57,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:50:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1289286069, now seen corresponding path program 1 times [2019-01-13 01:50:57,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:50:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:50:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:57,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:50:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:50:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:50:57,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:50:57,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:50:57,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:50:57,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:50:57,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:50:57,134 INFO L87 Difference]: Start difference. First operand 13863 states and 45161 transitions. Second operand 3 states. [2019-01-13 01:50:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:50:58,213 INFO L93 Difference]: Finished difference Result 14973 states and 48614 transitions. [2019-01-13 01:50:58,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:50:58,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-01-13 01:50:58,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:50:58,240 INFO L225 Difference]: With dead ends: 14973 [2019-01-13 01:50:58,241 INFO L226 Difference]: Without dead ends: 14973 [2019-01-13 01:50:58,241 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 [2019-01-13 01:50:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14973 states. [2019-01-13 01:50:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14973 to 14473. [2019-01-13 01:50:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14473 states. [2019-01-13 01:50:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14473 states to 14473 states and 47069 transitions. [2019-01-13 01:50:58,746 INFO L78 Accepts]: Start accepts. Automaton has 14473 states and 47069 transitions. Word has length 91 [2019-01-13 01:50:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:50:58,746 INFO L480 AbstractCegarLoop]: Abstraction has 14473 states and 47069 transitions. [2019-01-13 01:50:58,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:50:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 14473 states and 47069 transitions. [2019-01-13 01:50:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 01:50:58,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:50:58,766 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] [2019-01-13 01:50:58,767 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:50:58,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:50:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash -113408041, now seen corresponding path program 2 times [2019-01-13 01:50:58,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:50:58,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:50:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:58,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:50:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:50:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:50:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:50:59,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:50:59,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 01:50:59,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 01:50:59,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 01:50:59,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:50:59,215 INFO L87 Difference]: Start difference. First operand 14473 states and 47069 transitions. Second operand 9 states. [2019-01-13 01:50:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:50:59,802 INFO L93 Difference]: Finished difference Result 17330 states and 55834 transitions. [2019-01-13 01:50:59,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 01:50:59,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-01-13 01:50:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:50:59,833 INFO L225 Difference]: With dead ends: 17330 [2019-01-13 01:50:59,833 INFO L226 Difference]: Without dead ends: 17330 [2019-01-13 01:50:59,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-13 01:50:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17330 states. [2019-01-13 01:51:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17330 to 14538. [2019-01-13 01:51:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14538 states. [2019-01-13 01:51:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14538 states to 14538 states and 47236 transitions. [2019-01-13 01:51:00,075 INFO L78 Accepts]: Start accepts. Automaton has 14538 states and 47236 transitions. Word has length 91 [2019-01-13 01:51:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:00,075 INFO L480 AbstractCegarLoop]: Abstraction has 14538 states and 47236 transitions. [2019-01-13 01:51:00,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 01:51:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 14538 states and 47236 transitions. [2019-01-13 01:51:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 01:51:00,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:00,096 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] [2019-01-13 01:51:00,097 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:00,097 INFO L82 PathProgramCache]: Analyzing trace with hash -865610695, now seen corresponding path program 3 times [2019-01-13 01:51:00,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:00,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:00,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:51:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:00,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:00,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:51:00,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:51:00,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:51:00,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:51:00,486 INFO L87 Difference]: Start difference. First operand 14538 states and 47236 transitions. Second operand 5 states. [2019-01-13 01:51:01,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:01,241 INFO L93 Difference]: Finished difference Result 18290 states and 58747 transitions. [2019-01-13 01:51:01,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:51:01,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-01-13 01:51:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:01,274 INFO L225 Difference]: With dead ends: 18290 [2019-01-13 01:51:01,274 INFO L226 Difference]: Without dead ends: 18290 [2019-01-13 01:51:01,275 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 [2019-01-13 01:51:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18290 states. [2019-01-13 01:51:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18290 to 15023. [2019-01-13 01:51:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-01-13 01:51:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 48649 transitions. [2019-01-13 01:51:01,548 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 48649 transitions. Word has length 91 [2019-01-13 01:51:01,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:01,548 INFO L480 AbstractCegarLoop]: Abstraction has 15023 states and 48649 transitions. [2019-01-13 01:51:01,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:51:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 48649 transitions. [2019-01-13 01:51:01,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 01:51:01,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:01,578 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] [2019-01-13 01:51:01,578 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:01,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:01,578 INFO L82 PathProgramCache]: Analyzing trace with hash 466894554, now seen corresponding path program 2 times [2019-01-13 01:51:01,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:01,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:01,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:01,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:51:01,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:02,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:02,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:51:02,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:51:02,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:51:02,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:51:02,141 INFO L87 Difference]: Start difference. First operand 15023 states and 48649 transitions. Second operand 7 states. [2019-01-13 01:51:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:02,980 INFO L93 Difference]: Finished difference Result 28979 states and 94305 transitions. [2019-01-13 01:51:02,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 01:51:02,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-13 01:51:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:03,034 INFO L225 Difference]: With dead ends: 28979 [2019-01-13 01:51:03,034 INFO L226 Difference]: Without dead ends: 28979 [2019-01-13 01:51:03,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-13 01:51:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28979 states. [2019-01-13 01:51:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28979 to 17566. [2019-01-13 01:51:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17566 states. [2019-01-13 01:51:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17566 states to 17566 states and 57306 transitions. [2019-01-13 01:51:03,402 INFO L78 Accepts]: Start accepts. Automaton has 17566 states and 57306 transitions. Word has length 91 [2019-01-13 01:51:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:03,402 INFO L480 AbstractCegarLoop]: Abstraction has 17566 states and 57306 transitions. [2019-01-13 01:51:03,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:51:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 17566 states and 57306 transitions. [2019-01-13 01:51:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 01:51:03,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:03,436 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] [2019-01-13 01:51:03,437 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1354398235, now seen corresponding path program 1 times [2019-01-13 01:51:03,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:03,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:03,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:03,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:51:03,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:03,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:03,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:51:03,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:51:03,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:51:03,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:51:03,630 INFO L87 Difference]: Start difference. First operand 17566 states and 57306 transitions. Second operand 6 states. [2019-01-13 01:51:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:03,758 INFO L93 Difference]: Finished difference Result 21641 states and 69576 transitions. [2019-01-13 01:51:03,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 01:51:03,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 01:51:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:03,795 INFO L225 Difference]: With dead ends: 21641 [2019-01-13 01:51:03,795 INFO L226 Difference]: Without dead ends: 21641 [2019-01-13 01:51:03,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:51:03,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21641 states. [2019-01-13 01:51:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21641 to 16339. [2019-01-13 01:51:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16339 states. [2019-01-13 01:51:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16339 states to 16339 states and 52441 transitions. [2019-01-13 01:51:04,064 INFO L78 Accepts]: Start accepts. Automaton has 16339 states and 52441 transitions. Word has length 91 [2019-01-13 01:51:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:04,064 INFO L480 AbstractCegarLoop]: Abstraction has 16339 states and 52441 transitions. [2019-01-13 01:51:04,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:51:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 16339 states and 52441 transitions. [2019-01-13 01:51:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 01:51:04,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:04,085 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] [2019-01-13 01:51:04,086 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:04,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:04,086 INFO L82 PathProgramCache]: Analyzing trace with hash -377577317, now seen corresponding path program 1 times [2019-01-13 01:51:04,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:04,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:04,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:04,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:51:04,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:04,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:04,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:51:04,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:51:04,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:51:04,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:51:04,337 INFO L87 Difference]: Start difference. First operand 16339 states and 52441 transitions. Second operand 6 states. [2019-01-13 01:51:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:04,676 INFO L93 Difference]: Finished difference Result 15443 states and 48825 transitions. [2019-01-13 01:51:04,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:51:04,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 01:51:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:04,705 INFO L225 Difference]: With dead ends: 15443 [2019-01-13 01:51:04,705 INFO L226 Difference]: Without dead ends: 15443 [2019-01-13 01:51:04,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:51:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15443 states. [2019-01-13 01:51:04,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15443 to 12741. [2019-01-13 01:51:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12741 states. [2019-01-13 01:51:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12741 states to 12741 states and 40618 transitions. [2019-01-13 01:51:04,918 INFO L78 Accepts]: Start accepts. Automaton has 12741 states and 40618 transitions. Word has length 91 [2019-01-13 01:51:04,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:04,918 INFO L480 AbstractCegarLoop]: Abstraction has 12741 states and 40618 transitions. [2019-01-13 01:51:04,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:51:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 12741 states and 40618 transitions. [2019-01-13 01:51:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 01:51:04,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:04,936 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] [2019-01-13 01:51:04,936 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:04,936 INFO L82 PathProgramCache]: Analyzing trace with hash -886914850, now seen corresponding path program 1 times [2019-01-13 01:51:04,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:04,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:04,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:04,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:51:04,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:05,099 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 01:51:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:05,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:05,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:51:05,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:51:05,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:51:05,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:51:05,298 INFO L87 Difference]: Start difference. First operand 12741 states and 40618 transitions. Second operand 6 states. [2019-01-13 01:51:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:06,257 INFO L93 Difference]: Finished difference Result 16641 states and 52728 transitions. [2019-01-13 01:51:06,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:51:06,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 01:51:06,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:06,286 INFO L225 Difference]: With dead ends: 16641 [2019-01-13 01:51:06,287 INFO L226 Difference]: Without dead ends: 16266 [2019-01-13 01:51:06,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:51:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16266 states. [2019-01-13 01:51:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16266 to 15261. [2019-01-13 01:51:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15261 states. [2019-01-13 01:51:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15261 states to 15261 states and 48579 transitions. [2019-01-13 01:51:06,520 INFO L78 Accepts]: Start accepts. Automaton has 15261 states and 48579 transitions. Word has length 93 [2019-01-13 01:51:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:06,520 INFO L480 AbstractCegarLoop]: Abstraction has 15261 states and 48579 transitions. [2019-01-13 01:51:06,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:51:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15261 states and 48579 transitions. [2019-01-13 01:51:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 01:51:06,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:06,541 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] [2019-01-13 01:51:06,542 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:06,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:06,542 INFO L82 PathProgramCache]: Analyzing trace with hash -536114913, now seen corresponding path program 1 times [2019-01-13 01:51:06,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:06,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:06,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:06,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:51:06,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:06,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:06,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:51:06,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:51:06,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:51:06,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:51:06,765 INFO L87 Difference]: Start difference. First operand 15261 states and 48579 transitions. Second operand 6 states. [2019-01-13 01:51:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:07,211 INFO L93 Difference]: Finished difference Result 18581 states and 57280 transitions. [2019-01-13 01:51:07,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:51:07,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 01:51:07,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:07,243 INFO L225 Difference]: With dead ends: 18581 [2019-01-13 01:51:07,243 INFO L226 Difference]: Without dead ends: 18581 [2019-01-13 01:51:07,243 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 [2019-01-13 01:51:07,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18581 states. [2019-01-13 01:51:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18581 to 15531. [2019-01-13 01:51:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15531 states. [2019-01-13 01:51:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15531 states to 15531 states and 48385 transitions. [2019-01-13 01:51:07,491 INFO L78 Accepts]: Start accepts. Automaton has 15531 states and 48385 transitions. Word has length 93 [2019-01-13 01:51:07,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:07,491 INFO L480 AbstractCegarLoop]: Abstraction has 15531 states and 48385 transitions. [2019-01-13 01:51:07,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:51:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 15531 states and 48385 transitions. [2019-01-13 01:51:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 01:51:07,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:07,512 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] [2019-01-13 01:51:07,512 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:07,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:07,513 INFO L82 PathProgramCache]: Analyzing trace with hash -324764000, now seen corresponding path program 1 times [2019-01-13 01:51:07,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:07,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:07,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:07,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:51:07,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:07,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:07,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:51:07,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:51:07,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:51:07,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:51:07,864 INFO L87 Difference]: Start difference. First operand 15531 states and 48385 transitions. Second operand 7 states. [2019-01-13 01:51:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:08,626 INFO L93 Difference]: Finished difference Result 18048 states and 55966 transitions. [2019-01-13 01:51:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:51:08,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 01:51:08,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:08,662 INFO L225 Difference]: With dead ends: 18048 [2019-01-13 01:51:08,663 INFO L226 Difference]: Without dead ends: 18048 [2019-01-13 01:51:08,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-13 01:51:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18048 states. [2019-01-13 01:51:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18048 to 17579. [2019-01-13 01:51:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17579 states. [2019-01-13 01:51:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17579 states to 17579 states and 54674 transitions. [2019-01-13 01:51:08,941 INFO L78 Accepts]: Start accepts. Automaton has 17579 states and 54674 transitions. Word has length 93 [2019-01-13 01:51:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:08,942 INFO L480 AbstractCegarLoop]: Abstraction has 17579 states and 54674 transitions. [2019-01-13 01:51:08,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:51:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 17579 states and 54674 transitions. [2019-01-13 01:51:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 01:51:08,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:08,963 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] [2019-01-13 01:51:08,963 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:08,964 INFO L82 PathProgramCache]: Analyzing trace with hash 562739681, now seen corresponding path program 1 times [2019-01-13 01:51:08,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:08,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:08,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:08,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:51:08,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:09,247 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 01:51:09,424 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 01:51:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:10,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:10,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 01:51:10,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 01:51:10,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 01:51:10,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-13 01:51:10,414 INFO L87 Difference]: Start difference. First operand 17579 states and 54674 transitions. Second operand 10 states. [2019-01-13 01:51:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:12,254 INFO L93 Difference]: Finished difference Result 30485 states and 94595 transitions. [2019-01-13 01:51:12,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 01:51:12,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-01-13 01:51:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:12,295 INFO L225 Difference]: With dead ends: 30485 [2019-01-13 01:51:12,295 INFO L226 Difference]: Without dead ends: 20724 [2019-01-13 01:51:12,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-01-13 01:51:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20724 states. [2019-01-13 01:51:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20724 to 17779. [2019-01-13 01:51:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17779 states. [2019-01-13 01:51:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17779 states to 17779 states and 54879 transitions. [2019-01-13 01:51:12,862 INFO L78 Accepts]: Start accepts. Automaton has 17779 states and 54879 transitions. Word has length 93 [2019-01-13 01:51:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:12,862 INFO L480 AbstractCegarLoop]: Abstraction has 17779 states and 54879 transitions. [2019-01-13 01:51:12,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 01:51:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 17779 states and 54879 transitions. [2019-01-13 01:51:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 01:51:12,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:12,884 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] [2019-01-13 01:51:12,884 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:12,884 INFO L82 PathProgramCache]: Analyzing trace with hash -212858757, now seen corresponding path program 2 times [2019-01-13 01:51:12,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:12,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:12,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:51:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:13,264 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 01:51:13,444 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 01:51:13,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:13,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:13,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 01:51:13,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 01:51:13,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 01:51:13,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 01:51:13,916 INFO L87 Difference]: Start difference. First operand 17779 states and 54879 transitions. Second operand 10 states. [2019-01-13 01:51:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:14,974 INFO L93 Difference]: Finished difference Result 32943 states and 101272 transitions. [2019-01-13 01:51:14,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:51:14,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-01-13 01:51:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:15,002 INFO L225 Difference]: With dead ends: 32943 [2019-01-13 01:51:15,002 INFO L226 Difference]: Without dead ends: 15791 [2019-01-13 01:51:15,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-13 01:51:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15791 states. [2019-01-13 01:51:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15791 to 15791. [2019-01-13 01:51:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15791 states. [2019-01-13 01:51:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15791 states to 15791 states and 48507 transitions. [2019-01-13 01:51:15,226 INFO L78 Accepts]: Start accepts. Automaton has 15791 states and 48507 transitions. Word has length 93 [2019-01-13 01:51:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:15,226 INFO L480 AbstractCegarLoop]: Abstraction has 15791 states and 48507 transitions. [2019-01-13 01:51:15,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 01:51:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 15791 states and 48507 transitions. [2019-01-13 01:51:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 01:51:15,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:15,248 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] [2019-01-13 01:51:15,248 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:15,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:15,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1764786221, now seen corresponding path program 3 times [2019-01-13 01:51:15,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:15,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:15,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:15,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:51:15,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:15,462 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 01:51:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:15,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:15,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:51:15,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:51:15,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:51:15,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:51:15,619 INFO L87 Difference]: Start difference. First operand 15791 states and 48507 transitions. Second operand 7 states. [2019-01-13 01:51:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:16,369 INFO L93 Difference]: Finished difference Result 27352 states and 84017 transitions. [2019-01-13 01:51:16,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:51:16,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 01:51:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:16,389 INFO L225 Difference]: With dead ends: 27352 [2019-01-13 01:51:16,390 INFO L226 Difference]: Without dead ends: 11170 [2019-01-13 01:51:16,390 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 [2019-01-13 01:51:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11170 states. [2019-01-13 01:51:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11170 to 11170. [2019-01-13 01:51:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11170 states. [2019-01-13 01:51:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11170 states to 11170 states and 34299 transitions. [2019-01-13 01:51:16,550 INFO L78 Accepts]: Start accepts. Automaton has 11170 states and 34299 transitions. Word has length 93 [2019-01-13 01:51:16,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:16,550 INFO L480 AbstractCegarLoop]: Abstraction has 11170 states and 34299 transitions. [2019-01-13 01:51:16,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:51:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 11170 states and 34299 transitions. [2019-01-13 01:51:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 01:51:16,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:16,564 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] [2019-01-13 01:51:16,564 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:16,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:16,565 INFO L82 PathProgramCache]: Analyzing trace with hash -176237099, now seen corresponding path program 1 times [2019-01-13 01:51:16,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:16,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:16,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:16,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:51:16,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:16,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:16,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:51:16,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:51:16,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:51:16,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:51:16,940 INFO L87 Difference]: Start difference. First operand 11170 states and 34299 transitions. Second operand 7 states. [2019-01-13 01:51:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:19,183 INFO L93 Difference]: Finished difference Result 12916 states and 39742 transitions. [2019-01-13 01:51:19,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:51:19,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 01:51:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:19,205 INFO L225 Difference]: With dead ends: 12916 [2019-01-13 01:51:19,205 INFO L226 Difference]: Without dead ends: 12916 [2019-01-13 01:51:19,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:51:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12916 states. [2019-01-13 01:51:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12916 to 11488. [2019-01-13 01:51:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11488 states. [2019-01-13 01:51:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 35435 transitions. [2019-01-13 01:51:19,381 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 35435 transitions. Word has length 93 [2019-01-13 01:51:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:19,382 INFO L480 AbstractCegarLoop]: Abstraction has 11488 states and 35435 transitions. [2019-01-13 01:51:19,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:51:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 35435 transitions. [2019-01-13 01:51:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 01:51:19,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:19,397 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] [2019-01-13 01:51:19,397 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:19,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1285342900, now seen corresponding path program 2 times [2019-01-13 01:51:19,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:19,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:19,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:19,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:51:19,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:19,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:19,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 01:51:19,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 01:51:19,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 01:51:19,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:51:19,657 INFO L87 Difference]: Start difference. First operand 11488 states and 35435 transitions. Second operand 8 states. [2019-01-13 01:51:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:20,028 INFO L93 Difference]: Finished difference Result 13120 states and 40367 transitions. [2019-01-13 01:51:20,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 01:51:20,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-01-13 01:51:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:20,051 INFO L225 Difference]: With dead ends: 13120 [2019-01-13 01:51:20,051 INFO L226 Difference]: Without dead ends: 13120 [2019-01-13 01:51:20,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-13 01:51:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13120 states. [2019-01-13 01:51:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13120 to 11676. [2019-01-13 01:51:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11676 states. [2019-01-13 01:51:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11676 states to 11676 states and 35940 transitions. [2019-01-13 01:51:20,225 INFO L78 Accepts]: Start accepts. Automaton has 11676 states and 35940 transitions. Word has length 93 [2019-01-13 01:51:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:20,226 INFO L480 AbstractCegarLoop]: Abstraction has 11676 states and 35940 transitions. [2019-01-13 01:51:20,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 01:51:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 11676 states and 35940 transitions. [2019-01-13 01:51:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 01:51:20,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:20,240 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] [2019-01-13 01:51:20,240 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:20,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:20,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2122120715, now seen corresponding path program 4 times [2019-01-13 01:51:20,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:20,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:20,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:20,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:51:20,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:51:20,524 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 01:51:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:51:20,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:51:20,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 01:51:20,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 01:51:20,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 01:51:20,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 01:51:20,698 INFO L87 Difference]: Start difference. First operand 11676 states and 35940 transitions. Second operand 11 states. [2019-01-13 01:51:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:51:21,841 INFO L93 Difference]: Finished difference Result 19820 states and 61140 transitions. [2019-01-13 01:51:21,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 01:51:21,842 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2019-01-13 01:51:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:51:21,864 INFO L225 Difference]: With dead ends: 19820 [2019-01-13 01:51:21,864 INFO L226 Difference]: Without dead ends: 12898 [2019-01-13 01:51:21,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-01-13 01:51:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12898 states. [2019-01-13 01:51:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12898 to 11586. [2019-01-13 01:51:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-01-13 01:51:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 35692 transitions. [2019-01-13 01:51:22,043 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 35692 transitions. Word has length 93 [2019-01-13 01:51:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:51:22,044 INFO L480 AbstractCegarLoop]: Abstraction has 11586 states and 35692 transitions. [2019-01-13 01:51:22,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 01:51:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 35692 transitions. [2019-01-13 01:51:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 01:51:22,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:51:22,059 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] [2019-01-13 01:51:22,060 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:51:22,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:51:22,060 INFO L82 PathProgramCache]: Analyzing trace with hash 353298899, now seen corresponding path program 5 times [2019-01-13 01:51:22,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:51:22,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:51:22,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:22,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:51:22,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:51:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 01:51:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 01:51:22,158 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 01:51:22,353 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 01:51:22,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 01:51:22 BasicIcfg [2019-01-13 01:51:22,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 01:51:22,355 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 01:51:22,355 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 01:51:22,355 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 01:51:22,356 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:49:49" (3/4) ... [2019-01-13 01:51:22,358 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 01:51:22,585 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 01:51:22,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 01:51:22,586 INFO L168 Benchmark]: Toolchain (without parser) took 95363.15 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 951.3 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-01-13 01:51:22,587 INFO L168 Benchmark]: CDTParser took 0.16 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. [2019-01-13 01:51:22,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-01-13 01:51:22,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-13 01:51:22,590 INFO L168 Benchmark]: Boogie Preprocessor took 70.60 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. [2019-01-13 01:51:22,590 INFO L168 Benchmark]: RCFGBuilder took 1155.66 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: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2019-01-13 01:51:22,590 INFO L168 Benchmark]: TraceAbstraction took 93094.72 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-01-13 01:51:22,591 INFO L168 Benchmark]: Witness Printer took 230.08 ms. Allocated memory is still 5.8 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2019-01-13 01:51:22,602 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 735.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.60 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 1155.66 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: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 93094.72 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 230.08 ms. Allocated memory is still 5.8 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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 [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)) [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] [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, 92.8s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 28.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6431 SDtfs, 8156 SDslu, 17841 SDs, 0 SdLazy, 6229 SolverSat, 250 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 67 SyntacticMatches, 17 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 9.1s 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: 22.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 132617 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2130 NumberOfCodeBlocks, 2130 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2012 ConstructedInterpolants, 0 QuantifiedInterpolants, 440596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...