./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix031_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix031_tso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f84c2748f54bfa5d6fdcdc5d87ddd8d092a63d31 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 20:28:01,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 20:28:01,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 20:28:01,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 20:28:01,087 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 20:28:01,089 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 20:28:01,091 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 20:28:01,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 20:28:01,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 20:28:01,102 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 20:28:01,104 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 20:28:01,105 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 20:28:01,107 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 20:28:01,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 20:28:01,117 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 20:28:01,121 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 20:28:01,122 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 20:28:01,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 20:28:01,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 20:28:01,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 20:28:01,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 20:28:01,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 20:28:01,145 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 20:28:01,146 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 20:28:01,146 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 20:28:01,147 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 20:28:01,148 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 20:28:01,149 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 20:28:01,150 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 20:28:01,151 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 20:28:01,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 20:28:01,152 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 20:28:01,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 20:28:01,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 20:28:01,153 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 20:28:01,154 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 20:28:01,154 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 20:28:01,170 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 20:28:01,170 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 20:28:01,171 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 20:28:01,171 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 20:28:01,171 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 20:28:01,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 20:28:01,175 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 20:28:01,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 20:28:01,175 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 20:28:01,175 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 20:28:01,176 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 20:28:01,176 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 20:28:01,176 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 20:28:01,176 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 20:28:01,176 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 20:28:01,176 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 20:28:01,180 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 20:28:01,180 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 20:28:01,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 20:28:01,180 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 20:28:01,181 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 20:28:01,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 20:28:01,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 20:28:01,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 20:28:01,181 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 20:28:01,181 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 20:28:01,182 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 20:28:01,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 20:28:01,184 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 -> f84c2748f54bfa5d6fdcdc5d87ddd8d092a63d31 [2018-12-31 20:28:01,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 20:28:01,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 20:28:01,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 20:28:01,243 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 20:28:01,244 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 20:28:01,245 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix031_tso.opt_false-unreach-call.i [2018-12-31 20:28:01,321 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4dd420e/1c1b1b94f0d14b5d89307c71a4ced3d5/FLAGbed4bdaa2 [2018-12-31 20:28:01,974 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 20:28:01,974 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix031_tso.opt_false-unreach-call.i [2018-12-31 20:28:01,991 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4dd420e/1c1b1b94f0d14b5d89307c71a4ced3d5/FLAGbed4bdaa2 [2018-12-31 20:28:02,180 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4dd420e/1c1b1b94f0d14b5d89307c71a4ced3d5 [2018-12-31 20:28:02,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 20:28:02,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 20:28:02,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 20:28:02,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 20:28:02,193 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 20:28:02,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:28:02" (1/1) ... [2018-12-31 20:28:02,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7307a100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:02, skipping insertion in model container [2018-12-31 20:28:02,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:28:02" (1/1) ... [2018-12-31 20:28:02,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 20:28:02,281 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 20:28:02,808 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:28:02,823 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 20:28:02,993 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:28:03,076 INFO L195 MainTranslator]: Completed translation [2018-12-31 20:28:03,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:03 WrapperNode [2018-12-31 20:28:03,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 20:28:03,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 20:28:03,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 20:28:03,079 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 20:28:03,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:03" (1/1) ... [2018-12-31 20:28:03,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:03" (1/1) ... [2018-12-31 20:28:03,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 20:28:03,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 20:28:03,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 20:28:03,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 20:28:03,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:03" (1/1) ... [2018-12-31 20:28:03,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:03" (1/1) ... [2018-12-31 20:28:03,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:03" (1/1) ... [2018-12-31 20:28:03,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:03" (1/1) ... [2018-12-31 20:28:03,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:03" (1/1) ... [2018-12-31 20:28:03,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:03" (1/1) ... [2018-12-31 20:28:03,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:03" (1/1) ... [2018-12-31 20:28:03,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 20:28:03,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 20:28:03,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 20:28:03,212 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 20:28:03,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 20:28:03,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 20:28:03,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 20:28:03,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 20:28:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 20:28:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 20:28:03,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 20:28:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 20:28:03,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 20:28:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 20:28:03,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 20:28:03,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 20:28:03,289 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 20:28:04,363 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 20:28:04,364 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 20:28:04,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:28:04 BoogieIcfgContainer [2018-12-31 20:28:04,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 20:28:04,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 20:28:04,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 20:28:04,369 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 20:28:04,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 08:28:02" (1/3) ... [2018-12-31 20:28:04,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae1936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:28:04, skipping insertion in model container [2018-12-31 20:28:04,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:03" (2/3) ... [2018-12-31 20:28:04,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae1936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:28:04, skipping insertion in model container [2018-12-31 20:28:04,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:28:04" (3/3) ... [2018-12-31 20:28:04,373 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_tso.opt_false-unreach-call.i [2018-12-31 20:28:04,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,422 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,423 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,437 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,437 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,438 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,438 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,438 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,438 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,458 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,458 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,460 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,460 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,461 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,509 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 20:28:04,509 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 20:28:04,521 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 20:28:04,542 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 20:28:04,573 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 20:28:04,574 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 20:28:04,574 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 20:28:04,574 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 20:28:04,574 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 20:28:04,574 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 20:28:04,574 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 20:28:04,574 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 20:28:04,576 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 20:28:04,591 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134places, 166 transitions [2018-12-31 20:28:06,440 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27858 states. [2018-12-31 20:28:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 27858 states. [2018-12-31 20:28:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-31 20:28:06,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:06,454 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] [2018-12-31 20:28:06,457 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:06,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:06,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1858856236, now seen corresponding path program 1 times [2018-12-31 20:28:06,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:06,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:06,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:06,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:06,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:06,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:06,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:06,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:06,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:06,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:06,875 INFO L87 Difference]: Start difference. First operand 27858 states. Second operand 4 states. [2018-12-31 20:28:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:08,191 INFO L93 Difference]: Finished difference Result 47770 states and 183121 transitions. [2018-12-31 20:28:08,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:28:08,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-31 20:28:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:08,877 INFO L225 Difference]: With dead ends: 47770 [2018-12-31 20:28:08,877 INFO L226 Difference]: Without dead ends: 34610 [2018-12-31 20:28:08,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34610 states. [2018-12-31 20:28:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34610 to 21758. [2018-12-31 20:28:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21758 states. [2018-12-31 20:28:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21758 states to 21758 states and 83443 transitions. [2018-12-31 20:28:10,307 INFO L78 Accepts]: Start accepts. Automaton has 21758 states and 83443 transitions. Word has length 41 [2018-12-31 20:28:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:10,307 INFO L480 AbstractCegarLoop]: Abstraction has 21758 states and 83443 transitions. [2018-12-31 20:28:10,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 21758 states and 83443 transitions. [2018-12-31 20:28:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 20:28:10,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:10,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:10,318 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:10,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:10,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1910881222, now seen corresponding path program 1 times [2018-12-31 20:28:10,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:10,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:10,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:10,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:10,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:28:10,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:28:10,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:28:10,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:10,456 INFO L87 Difference]: Start difference. First operand 21758 states and 83443 transitions. Second operand 3 states. [2018-12-31 20:28:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:11,082 INFO L93 Difference]: Finished difference Result 21758 states and 83238 transitions. [2018-12-31 20:28:11,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:28:11,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 20:28:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:11,210 INFO L225 Difference]: With dead ends: 21758 [2018-12-31 20:28:11,211 INFO L226 Difference]: Without dead ends: 21758 [2018-12-31 20:28:11,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21758 states. [2018-12-31 20:28:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21758 to 21758. [2018-12-31 20:28:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21758 states. [2018-12-31 20:28:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21758 states to 21758 states and 83238 transitions. [2018-12-31 20:28:12,580 INFO L78 Accepts]: Start accepts. Automaton has 21758 states and 83238 transitions. Word has length 49 [2018-12-31 20:28:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:12,581 INFO L480 AbstractCegarLoop]: Abstraction has 21758 states and 83238 transitions. [2018-12-31 20:28:12,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:28:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 21758 states and 83238 transitions. [2018-12-31 20:28:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 20:28:12,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:12,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:12,588 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:12,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:12,588 INFO L82 PathProgramCache]: Analyzing trace with hash -168070887, now seen corresponding path program 1 times [2018-12-31 20:28:12,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:12,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:12,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:12,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:12,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:12,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:12,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:12,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:12,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:12,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:12,814 INFO L87 Difference]: Start difference. First operand 21758 states and 83238 transitions. Second operand 4 states. [2018-12-31 20:28:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:13,185 INFO L93 Difference]: Finished difference Result 7172 states and 23604 transitions. [2018-12-31 20:28:13,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:28:13,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-31 20:28:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:13,219 INFO L225 Difference]: With dead ends: 7172 [2018-12-31 20:28:13,220 INFO L226 Difference]: Without dead ends: 6326 [2018-12-31 20:28:13,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2018-12-31 20:28:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 6326. [2018-12-31 20:28:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6326 states. [2018-12-31 20:28:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 20676 transitions. [2018-12-31 20:28:13,404 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 20676 transitions. Word has length 49 [2018-12-31 20:28:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:13,405 INFO L480 AbstractCegarLoop]: Abstraction has 6326 states and 20676 transitions. [2018-12-31 20:28:13,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 20676 transitions. [2018-12-31 20:28:13,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 20:28:13,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:13,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:13,407 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1649618541, now seen corresponding path program 1 times [2018-12-31 20:28:13,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:13,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:13,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:13,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:13,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:13,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:13,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:13,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:13,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:13,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:13,697 INFO L87 Difference]: Start difference. First operand 6326 states and 20676 transitions. Second operand 5 states. [2018-12-31 20:28:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:15,408 INFO L93 Difference]: Finished difference Result 12022 states and 38742 transitions. [2018-12-31 20:28:15,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:15,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-31 20:28:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:15,456 INFO L225 Difference]: With dead ends: 12022 [2018-12-31 20:28:15,456 INFO L226 Difference]: Without dead ends: 11947 [2018-12-31 20:28:15,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11947 states. [2018-12-31 20:28:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11947 to 8291. [2018-12-31 20:28:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8291 states. [2018-12-31 20:28:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8291 states to 8291 states and 26517 transitions. [2018-12-31 20:28:15,704 INFO L78 Accepts]: Start accepts. Automaton has 8291 states and 26517 transitions. Word has length 50 [2018-12-31 20:28:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:15,706 INFO L480 AbstractCegarLoop]: Abstraction has 8291 states and 26517 transitions. [2018-12-31 20:28:15,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 8291 states and 26517 transitions. [2018-12-31 20:28:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 20:28:15,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:15,709 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] [2018-12-31 20:28:15,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:15,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1323058643, now seen corresponding path program 1 times [2018-12-31 20:28:15,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:15,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:15,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:15,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:15,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:15,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:15,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:28:15,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:28:15,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:28:15,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:15,843 INFO L87 Difference]: Start difference. First operand 8291 states and 26517 transitions. Second operand 3 states. [2018-12-31 20:28:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:16,098 INFO L93 Difference]: Finished difference Result 10987 states and 34648 transitions. [2018-12-31 20:28:16,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:28:16,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-31 20:28:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:16,127 INFO L225 Difference]: With dead ends: 10987 [2018-12-31 20:28:16,127 INFO L226 Difference]: Without dead ends: 10983 [2018-12-31 20:28:16,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10983 states. [2018-12-31 20:28:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10983 to 8509. [2018-12-31 20:28:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8509 states. [2018-12-31 20:28:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 26953 transitions. [2018-12-31 20:28:16,348 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 26953 transitions. Word has length 52 [2018-12-31 20:28:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:16,348 INFO L480 AbstractCegarLoop]: Abstraction has 8509 states and 26953 transitions. [2018-12-31 20:28:16,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:28:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 26953 transitions. [2018-12-31 20:28:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 20:28:16,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:16,351 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] [2018-12-31 20:28:16,352 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash -260685666, now seen corresponding path program 1 times [2018-12-31 20:28:16,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:16,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:16,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:16,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:16,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:16,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:16,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:16,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:16,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:16,533 INFO L87 Difference]: Start difference. First operand 8509 states and 26953 transitions. Second operand 6 states. [2018-12-31 20:28:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:17,275 INFO L93 Difference]: Finished difference Result 11925 states and 37164 transitions. [2018-12-31 20:28:17,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:28:17,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-31 20:28:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:17,305 INFO L225 Difference]: With dead ends: 11925 [2018-12-31 20:28:17,305 INFO L226 Difference]: Without dead ends: 11828 [2018-12-31 20:28:17,306 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 [2018-12-31 20:28:17,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2018-12-31 20:28:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 9283. [2018-12-31 20:28:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9283 states. [2018-12-31 20:28:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9283 states to 9283 states and 29413 transitions. [2018-12-31 20:28:17,565 INFO L78 Accepts]: Start accepts. Automaton has 9283 states and 29413 transitions. Word has length 56 [2018-12-31 20:28:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:17,566 INFO L480 AbstractCegarLoop]: Abstraction has 9283 states and 29413 transitions. [2018-12-31 20:28:17,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 9283 states and 29413 transitions. [2018-12-31 20:28:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 20:28:17,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:17,585 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] [2018-12-31 20:28:17,585 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:17,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1485098374, now seen corresponding path program 1 times [2018-12-31 20:28:17,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:17,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:17,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:17,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:17,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:17,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:17,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:17,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:17,970 INFO L87 Difference]: Start difference. First operand 9283 states and 29413 transitions. Second operand 6 states. [2018-12-31 20:28:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:19,020 INFO L93 Difference]: Finished difference Result 20424 states and 63615 transitions. [2018-12-31 20:28:19,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 20:28:19,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-31 20:28:19,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:19,063 INFO L225 Difference]: With dead ends: 20424 [2018-12-31 20:28:19,063 INFO L226 Difference]: Without dead ends: 20360 [2018-12-31 20:28:19,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 20:28:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2018-12-31 20:28:19,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 12460. [2018-12-31 20:28:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12460 states. [2018-12-31 20:28:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12460 states to 12460 states and 38834 transitions. [2018-12-31 20:28:19,490 INFO L78 Accepts]: Start accepts. Automaton has 12460 states and 38834 transitions. Word has length 66 [2018-12-31 20:28:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:19,491 INFO L480 AbstractCegarLoop]: Abstraction has 12460 states and 38834 transitions. [2018-12-31 20:28:19,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 12460 states and 38834 transitions. [2018-12-31 20:28:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:28:19,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:19,508 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] [2018-12-31 20:28:19,508 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash -52804182, now seen corresponding path program 1 times [2018-12-31 20:28:19,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:19,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:19,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:19,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:19,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:19,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:19,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:19,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:19,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:19,703 INFO L87 Difference]: Start difference. First operand 12460 states and 38834 transitions. Second operand 4 states. [2018-12-31 20:28:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:20,249 INFO L93 Difference]: Finished difference Result 15662 states and 48150 transitions. [2018-12-31 20:28:20,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:28:20,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-31 20:28:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:20,281 INFO L225 Difference]: With dead ends: 15662 [2018-12-31 20:28:20,282 INFO L226 Difference]: Without dead ends: 15662 [2018-12-31 20:28:20,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:20,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15662 states. [2018-12-31 20:28:20,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15662 to 14086. [2018-12-31 20:28:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14086 states. [2018-12-31 20:28:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14086 states to 14086 states and 43473 transitions. [2018-12-31 20:28:20,878 INFO L78 Accepts]: Start accepts. Automaton has 14086 states and 43473 transitions. Word has length 68 [2018-12-31 20:28:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:20,878 INFO L480 AbstractCegarLoop]: Abstraction has 14086 states and 43473 transitions. [2018-12-31 20:28:20,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 14086 states and 43473 transitions. [2018-12-31 20:28:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:28:20,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:20,894 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] [2018-12-31 20:28:20,894 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:20,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash -2130013525, now seen corresponding path program 1 times [2018-12-31 20:28:20,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:20,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:20,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:20,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:20,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:21,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:21,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:28:21,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:28:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:28:21,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:21,037 INFO L87 Difference]: Start difference. First operand 14086 states and 43473 transitions. Second operand 3 states. [2018-12-31 20:28:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:21,558 INFO L93 Difference]: Finished difference Result 14615 states and 44936 transitions. [2018-12-31 20:28:21,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:28:21,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-31 20:28:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:21,588 INFO L225 Difference]: With dead ends: 14615 [2018-12-31 20:28:21,589 INFO L226 Difference]: Without dead ends: 14615 [2018-12-31 20:28:21,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14615 states. [2018-12-31 20:28:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14615 to 14366. [2018-12-31 20:28:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14366 states. [2018-12-31 20:28:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14366 states to 14366 states and 44241 transitions. [2018-12-31 20:28:21,845 INFO L78 Accepts]: Start accepts. Automaton has 14366 states and 44241 transitions. Word has length 68 [2018-12-31 20:28:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:21,845 INFO L480 AbstractCegarLoop]: Abstraction has 14366 states and 44241 transitions. [2018-12-31 20:28:21,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:28:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 14366 states and 44241 transitions. [2018-12-31 20:28:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:21,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:21,864 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] [2018-12-31 20:28:21,865 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:21,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:21,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1509935379, now seen corresponding path program 1 times [2018-12-31 20:28:21,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:21,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:21,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:21,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:21,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:21,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:21,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:21,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:21,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:21,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:21,990 INFO L87 Difference]: Start difference. First operand 14366 states and 44241 transitions. Second operand 6 states. [2018-12-31 20:28:23,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:23,128 INFO L93 Difference]: Finished difference Result 17620 states and 53513 transitions. [2018-12-31 20:28:23,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:23,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-31 20:28:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:23,162 INFO L225 Difference]: With dead ends: 17620 [2018-12-31 20:28:23,162 INFO L226 Difference]: Without dead ends: 17620 [2018-12-31 20:28:23,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17620 states. [2018-12-31 20:28:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17620 to 16647. [2018-12-31 20:28:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16647 states. [2018-12-31 20:28:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16647 states to 16647 states and 50870 transitions. [2018-12-31 20:28:23,425 INFO L78 Accepts]: Start accepts. Automaton has 16647 states and 50870 transitions. Word has length 70 [2018-12-31 20:28:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:23,426 INFO L480 AbstractCegarLoop]: Abstraction has 16647 states and 50870 transitions. [2018-12-31 20:28:23,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 16647 states and 50870 transitions. [2018-12-31 20:28:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:23,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:23,441 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] [2018-12-31 20:28:23,441 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:23,442 INFO L82 PathProgramCache]: Analyzing trace with hash -567273964, now seen corresponding path program 1 times [2018-12-31 20:28:23,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:23,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:23,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:23,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:23,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:23,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:23,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:23,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:23,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:23,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:23,885 INFO L87 Difference]: Start difference. First operand 16647 states and 50870 transitions. Second operand 6 states. [2018-12-31 20:28:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:24,640 INFO L93 Difference]: Finished difference Result 19525 states and 57817 transitions. [2018-12-31 20:28:24,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:28:24,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-31 20:28:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:24,675 INFO L225 Difference]: With dead ends: 19525 [2018-12-31 20:28:24,675 INFO L226 Difference]: Without dead ends: 19525 [2018-12-31 20:28:24,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:28:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19525 states. [2018-12-31 20:28:25,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19525 to 16977. [2018-12-31 20:28:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16977 states. [2018-12-31 20:28:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16977 states to 16977 states and 50970 transitions. [2018-12-31 20:28:25,266 INFO L78 Accepts]: Start accepts. Automaton has 16977 states and 50970 transitions. Word has length 70 [2018-12-31 20:28:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:25,266 INFO L480 AbstractCegarLoop]: Abstraction has 16977 states and 50970 transitions. [2018-12-31 20:28:25,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 16977 states and 50970 transitions. [2018-12-31 20:28:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:25,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:25,282 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] [2018-12-31 20:28:25,282 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:25,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash -355923051, now seen corresponding path program 1 times [2018-12-31 20:28:25,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:25,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:25,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:25,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:25,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:25,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:25,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:25,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:25,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:25,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:25,464 INFO L87 Difference]: Start difference. First operand 16977 states and 50970 transitions. Second operand 5 states. [2018-12-31 20:28:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:25,872 INFO L93 Difference]: Finished difference Result 21653 states and 64526 transitions. [2018-12-31 20:28:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:25,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 20:28:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:25,913 INFO L225 Difference]: With dead ends: 21653 [2018-12-31 20:28:25,913 INFO L226 Difference]: Without dead ends: 21653 [2018-12-31 20:28:25,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21653 states. [2018-12-31 20:28:26,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21653 to 18865. [2018-12-31 20:28:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18865 states. [2018-12-31 20:28:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18865 states to 18865 states and 56039 transitions. [2018-12-31 20:28:26,241 INFO L78 Accepts]: Start accepts. Automaton has 18865 states and 56039 transitions. Word has length 70 [2018-12-31 20:28:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:26,242 INFO L480 AbstractCegarLoop]: Abstraction has 18865 states and 56039 transitions. [2018-12-31 20:28:26,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 18865 states and 56039 transitions. [2018-12-31 20:28:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:26,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:26,258 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] [2018-12-31 20:28:26,259 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:26,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:26,259 INFO L82 PathProgramCache]: Analyzing trace with hash -866457228, now seen corresponding path program 1 times [2018-12-31 20:28:26,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:26,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:26,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:26,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:26,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:26,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:26,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:26,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:26,671 INFO L87 Difference]: Start difference. First operand 18865 states and 56039 transitions. Second operand 5 states. [2018-12-31 20:28:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:27,581 INFO L93 Difference]: Finished difference Result 25932 states and 76586 transitions. [2018-12-31 20:28:27,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:28:27,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 20:28:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:27,627 INFO L225 Difference]: With dead ends: 25932 [2018-12-31 20:28:27,627 INFO L226 Difference]: Without dead ends: 25932 [2018-12-31 20:28:27,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25932 states. [2018-12-31 20:28:27,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25932 to 20050. [2018-12-31 20:28:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20050 states. [2018-12-31 20:28:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 59545 transitions. [2018-12-31 20:28:27,982 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 59545 transitions. Word has length 70 [2018-12-31 20:28:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:27,983 INFO L480 AbstractCegarLoop]: Abstraction has 20050 states and 59545 transitions. [2018-12-31 20:28:27,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 59545 transitions. [2018-12-31 20:28:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:28,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:28,001 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] [2018-12-31 20:28:28,002 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:28,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:28,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1621055605, now seen corresponding path program 1 times [2018-12-31 20:28:28,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:28,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:28,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:28,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:28,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:28,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:28,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:28,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:28,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:28,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:28,240 INFO L87 Difference]: Start difference. First operand 20050 states and 59545 transitions. Second operand 4 states. [2018-12-31 20:28:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:29,013 INFO L93 Difference]: Finished difference Result 27794 states and 82657 transitions. [2018-12-31 20:28:29,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:28:29,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-12-31 20:28:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:29,065 INFO L225 Difference]: With dead ends: 27794 [2018-12-31 20:28:29,065 INFO L226 Difference]: Without dead ends: 27374 [2018-12-31 20:28:29,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27374 states. [2018-12-31 20:28:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27374 to 25230. [2018-12-31 20:28:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25230 states. [2018-12-31 20:28:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25230 states to 25230 states and 75130 transitions. [2018-12-31 20:28:29,592 INFO L78 Accepts]: Start accepts. Automaton has 25230 states and 75130 transitions. Word has length 70 [2018-12-31 20:28:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:29,592 INFO L480 AbstractCegarLoop]: Abstraction has 25230 states and 75130 transitions. [2018-12-31 20:28:29,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 25230 states and 75130 transitions. [2018-12-31 20:28:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:29,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:29,614 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] [2018-12-31 20:28:29,614 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:29,615 INFO L82 PathProgramCache]: Analyzing trace with hash -175895754, now seen corresponding path program 1 times [2018-12-31 20:28:29,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:29,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:29,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:29,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:29,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:29,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:29,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:29,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:29,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:29,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:29,792 INFO L87 Difference]: Start difference. First operand 25230 states and 75130 transitions. Second operand 5 states. [2018-12-31 20:28:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:29,854 INFO L93 Difference]: Finished difference Result 6722 states and 16229 transitions. [2018-12-31 20:28:29,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:28:29,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 20:28:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:29,863 INFO L225 Difference]: With dead ends: 6722 [2018-12-31 20:28:29,863 INFO L226 Difference]: Without dead ends: 5317 [2018-12-31 20:28:29,864 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 [2018-12-31 20:28:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2018-12-31 20:28:29,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 4856. [2018-12-31 20:28:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4856 states. [2018-12-31 20:28:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4856 states to 4856 states and 11472 transitions. [2018-12-31 20:28:29,941 INFO L78 Accepts]: Start accepts. Automaton has 4856 states and 11472 transitions. Word has length 70 [2018-12-31 20:28:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:29,941 INFO L480 AbstractCegarLoop]: Abstraction has 4856 states and 11472 transitions. [2018-12-31 20:28:29,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 4856 states and 11472 transitions. [2018-12-31 20:28:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-31 20:28:29,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:29,948 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] [2018-12-31 20:28:29,948 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:29,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:29,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1498239147, now seen corresponding path program 1 times [2018-12-31 20:28:29,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:29,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:29,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:29,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:29,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:30,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:30,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:28:30,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:28:30,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:28:30,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:30,542 INFO L87 Difference]: Start difference. First operand 4856 states and 11472 transitions. Second operand 7 states. [2018-12-31 20:28:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:31,178 INFO L93 Difference]: Finished difference Result 6098 states and 14333 transitions. [2018-12-31 20:28:31,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:31,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-12-31 20:28:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:31,187 INFO L225 Difference]: With dead ends: 6098 [2018-12-31 20:28:31,187 INFO L226 Difference]: Without dead ends: 6098 [2018-12-31 20:28:31,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6098 states. [2018-12-31 20:28:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6098 to 5006. [2018-12-31 20:28:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5006 states. [2018-12-31 20:28:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5006 states to 5006 states and 11862 transitions. [2018-12-31 20:28:31,263 INFO L78 Accepts]: Start accepts. Automaton has 5006 states and 11862 transitions. Word has length 85 [2018-12-31 20:28:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:31,263 INFO L480 AbstractCegarLoop]: Abstraction has 5006 states and 11862 transitions. [2018-12-31 20:28:31,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:28:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 5006 states and 11862 transitions. [2018-12-31 20:28:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-31 20:28:31,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:31,270 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] [2018-12-31 20:28:31,271 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1167667118, now seen corresponding path program 1 times [2018-12-31 20:28:31,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:31,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:31,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:31,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:31,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:31,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:31,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:31,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:31,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:31,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:31,631 INFO L87 Difference]: Start difference. First operand 5006 states and 11862 transitions. Second operand 5 states. [2018-12-31 20:28:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:31,943 INFO L93 Difference]: Finished difference Result 5848 states and 13692 transitions. [2018-12-31 20:28:31,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:28:31,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-12-31 20:28:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:31,951 INFO L225 Difference]: With dead ends: 5848 [2018-12-31 20:28:31,951 INFO L226 Difference]: Without dead ends: 5814 [2018-12-31 20:28:31,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5814 states. [2018-12-31 20:28:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5814 to 5162. [2018-12-31 20:28:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5162 states. [2018-12-31 20:28:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5162 states to 5162 states and 12170 transitions. [2018-12-31 20:28:32,014 INFO L78 Accepts]: Start accepts. Automaton has 5162 states and 12170 transitions. Word has length 85 [2018-12-31 20:28:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:32,014 INFO L480 AbstractCegarLoop]: Abstraction has 5162 states and 12170 transitions. [2018-12-31 20:28:32,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5162 states and 12170 transitions. [2018-12-31 20:28:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-31 20:28:32,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:32,021 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] [2018-12-31 20:28:32,021 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:32,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash 364280224, now seen corresponding path program 2 times [2018-12-31 20:28:32,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:32,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:32,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:32,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:32,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:32,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:32,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:32,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:32,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:32,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:32,258 INFO L87 Difference]: Start difference. First operand 5162 states and 12170 transitions. Second operand 6 states. [2018-12-31 20:28:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:32,394 INFO L93 Difference]: Finished difference Result 4906 states and 11354 transitions. [2018-12-31 20:28:32,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:28:32,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-31 20:28:32,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:32,403 INFO L225 Difference]: With dead ends: 4906 [2018-12-31 20:28:32,403 INFO L226 Difference]: Without dead ends: 4906 [2018-12-31 20:28:32,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2018-12-31 20:28:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 3289. [2018-12-31 20:28:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3289 states. [2018-12-31 20:28:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 7670 transitions. [2018-12-31 20:28:32,455 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 7670 transitions. Word has length 85 [2018-12-31 20:28:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:32,455 INFO L480 AbstractCegarLoop]: Abstraction has 3289 states and 7670 transitions. [2018-12-31 20:28:32,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 7670 transitions. [2018-12-31 20:28:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-31 20:28:32,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:32,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:32,461 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:32,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:32,462 INFO L82 PathProgramCache]: Analyzing trace with hash 792045687, now seen corresponding path program 1 times [2018-12-31 20:28:32,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:32,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:32,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:32,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:28:32,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:32,682 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 20:28:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:32,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:32,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 20:28:32,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 20:28:32,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 20:28:32,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:28:32,784 INFO L87 Difference]: Start difference. First operand 3289 states and 7670 transitions. Second operand 11 states. [2018-12-31 20:28:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:34,668 INFO L93 Difference]: Finished difference Result 5442 states and 12665 transitions. [2018-12-31 20:28:34,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 20:28:34,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2018-12-31 20:28:34,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:34,676 INFO L225 Difference]: With dead ends: 5442 [2018-12-31 20:28:34,676 INFO L226 Difference]: Without dead ends: 3891 [2018-12-31 20:28:34,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-31 20:28:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2018-12-31 20:28:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3360. [2018-12-31 20:28:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3360 states. [2018-12-31 20:28:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3360 states to 3360 states and 7777 transitions. [2018-12-31 20:28:34,719 INFO L78 Accepts]: Start accepts. Automaton has 3360 states and 7777 transitions. Word has length 87 [2018-12-31 20:28:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:34,719 INFO L480 AbstractCegarLoop]: Abstraction has 3360 states and 7777 transitions. [2018-12-31 20:28:34,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 20:28:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3360 states and 7777 transitions. [2018-12-31 20:28:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-31 20:28:34,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:34,724 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] [2018-12-31 20:28:34,724 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:34,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:34,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1869156796, now seen corresponding path program 1 times [2018-12-31 20:28:34,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:34,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:34,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:34,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:34,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:35,183 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 20:28:35,389 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 20:28:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:35,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:35,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:35,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:35,401 INFO L87 Difference]: Start difference. First operand 3360 states and 7777 transitions. Second operand 6 states. [2018-12-31 20:28:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:35,615 INFO L93 Difference]: Finished difference Result 3854 states and 8813 transitions. [2018-12-31 20:28:35,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:35,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-31 20:28:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:35,621 INFO L225 Difference]: With dead ends: 3854 [2018-12-31 20:28:35,621 INFO L226 Difference]: Without dead ends: 3796 [2018-12-31 20:28:35,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2018-12-31 20:28:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 3125. [2018-12-31 20:28:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2018-12-31 20:28:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 7130 transitions. [2018-12-31 20:28:35,663 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 7130 transitions. Word has length 87 [2018-12-31 20:28:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:35,664 INFO L480 AbstractCegarLoop]: Abstraction has 3125 states and 7130 transitions. [2018-12-31 20:28:35,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 7130 transitions. [2018-12-31 20:28:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-31 20:28:35,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:35,668 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] [2018-12-31 20:28:35,668 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:35,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:35,669 INFO L82 PathProgramCache]: Analyzing trace with hash -208052547, now seen corresponding path program 2 times [2018-12-31 20:28:35,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:35,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:35,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:35,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:28:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:28:35,753 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 20:28:35,932 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 20:28:35,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 08:28:35 BasicIcfg [2018-12-31 20:28:35,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 20:28:35,940 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 20:28:35,940 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 20:28:35,940 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 20:28:35,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:28:04" (3/4) ... [2018-12-31 20:28:35,947 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 20:28:36,155 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 20:28:36,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 20:28:36,156 INFO L168 Benchmark]: Toolchain (without parser) took 33971.14 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 952.7 MB in the beginning and 1.5 GB in the end (delta: -505.6 MB). Peak memory consumption was 902.6 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:36,158 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:28:36,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 889.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:36,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:36,159 INFO L168 Benchmark]: Boogie Preprocessor took 49.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:28:36,161 INFO L168 Benchmark]: RCFGBuilder took 1153.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:36,162 INFO L168 Benchmark]: TraceAbstraction took 31574.03 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -438.7 MB). Peak memory consumption was 842.7 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:36,162 INFO L168 Benchmark]: Witness Printer took 215.30 ms. Allocated memory is still 2.4 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:36,167 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.61 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 889.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.82 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 1153.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31574.03 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -438.7 MB). Peak memory consumption was 842.7 MB. Max. memory is 11.5 GB. * Witness Printer took 215.30 ms. Allocated memory is still 2.4 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L689] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L690] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L691] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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] [L692] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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] [L693] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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] [L694] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0] [L695] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0] [L696] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t849; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t850; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 y$w_buff1 = y$w_buff0 [L745] 0 y$w_buff0 = 1 [L746] 0 y$w_buff1_used = y$w_buff0_used [L747] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L750] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L751] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L752] 0 y$r_buff0_thd2 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p1_EAX = z [L761] 0 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 x = 1 [L716] 1 __unbuffered_p0_EAX = x [L719] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L720] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L721] 1 y$flush_delayed = weak$$choice2 [L722] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L724] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L724] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L725] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L726] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L727] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L729] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L730] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L731] 1 y = y$flush_delayed ? y$mem_tmp : y [L732] 1 y$flush_delayed = (_Bool)0 [L737] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -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) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -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 [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 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 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 202 locations, 3 error locations. UNSAFE Result, 31.3s OverallTime, 21 OverallIterations, 1 TraceHistogramMax, 16.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5397 SDtfs, 5869 SDslu, 11263 SDs, 0 SdLazy, 4778 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 47 SyntacticMatches, 13 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27858occurred 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: 6.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 50611 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1435 NumberOfCodeBlocks, 1435 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1328 ConstructedInterpolants, 0 QuantifiedInterpolants, 227689 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...