./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix054_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix054_tso.oepc_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 6c2480fd206faf06e31cc180dc59749750db48b4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 20:15:21,167 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:15:21,169 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:15:21,183 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:15:21,183 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:15:21,184 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:15:21,189 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:15:21,193 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:15:21,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:15:21,203 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:15:21,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:15:21,204 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:15:21,206 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:15:21,208 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:15:21,210 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:15:21,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:15:21,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:15:21,214 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:15:21,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:15:21,217 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:15:21,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:15:21,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:15:21,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:15:21,223 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:15:21,223 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:15:21,224 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:15:21,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:15:21,226 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:15:21,227 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:15:21,228 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:15:21,229 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:15:21,230 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:15:21,230 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:15:21,230 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:15:21,231 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:15:21,232 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:15:21,233 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 20:15:21,263 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:15:21,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:15:21,264 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:15:21,264 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:15:21,265 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:15:21,265 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:15:21,265 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:15:21,265 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:15:21,265 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:15:21,266 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:15:21,266 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:15:21,266 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:15:21,266 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:15:21,266 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:15:21,266 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:15:21,267 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:15:21,267 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:15:21,267 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:15:21,267 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:15:21,267 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:15:21,268 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:15:21,268 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:15:21,268 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:15:21,268 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:15:21,268 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:15:21,268 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:15:21,269 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:15:21,269 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:15:21,269 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:15:21,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:15:21,269 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 -> 6c2480fd206faf06e31cc180dc59749750db48b4 [2018-11-28 20:15:21,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:15:21,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:15:21,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:15:21,338 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:15:21,338 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:15:21,339 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix054_tso.oepc_false-unreach-call.i [2018-11-28 20:15:21,413 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/084338ca1/e3d8ce1fff8b496987e7adbc57bc6291/FLAG2e80da544 [2018-11-28 20:15:22,081 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:15:22,082 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix054_tso.oepc_false-unreach-call.i [2018-11-28 20:15:22,111 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/084338ca1/e3d8ce1fff8b496987e7adbc57bc6291/FLAG2e80da544 [2018-11-28 20:15:22,310 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/084338ca1/e3d8ce1fff8b496987e7adbc57bc6291 [2018-11-28 20:15:22,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:15:22,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:15:22,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:15:22,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:15:22,322 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:15:22,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:15:22" (1/1) ... [2018-11-28 20:15:22,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e1a52d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:22, skipping insertion in model container [2018-11-28 20:15:22,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:15:22" (1/1) ... [2018-11-28 20:15:22,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:15:22,398 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:15:22,894 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:15:22,918 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:15:23,113 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:15:23,206 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:15:23,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23 WrapperNode [2018-11-28 20:15:23,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:15:23,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:15:23,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:15:23,209 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:15:23,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23" (1/1) ... [2018-11-28 20:15:23,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23" (1/1) ... [2018-11-28 20:15:23,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:15:23,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:15:23,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:15:23,308 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:15:23,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23" (1/1) ... [2018-11-28 20:15:23,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23" (1/1) ... [2018-11-28 20:15:23,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23" (1/1) ... [2018-11-28 20:15:23,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23" (1/1) ... [2018-11-28 20:15:23,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23" (1/1) ... [2018-11-28 20:15:23,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23" (1/1) ... [2018-11-28 20:15:23,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23" (1/1) ... [2018-11-28 20:15:23,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:15:23,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:15:23,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:15:23,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:15:23,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:15:23,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:15:23,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:15:23,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:15:23,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:15:23,430 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:15:23,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:15:23,430 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:15:23,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:15:23,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:15:23,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:15:23,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:15:23,434 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 20:15:24,590 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:15:24,590 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:15:24,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:24 BoogieIcfgContainer [2018-11-28 20:15:24,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:15:24,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:15:24,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:15:24,600 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:15:24,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:15:22" (1/3) ... [2018-11-28 20:15:24,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d129e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:15:24, skipping insertion in model container [2018-11-28 20:15:24,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:23" (2/3) ... [2018-11-28 20:15:24,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d129e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:15:24, skipping insertion in model container [2018-11-28 20:15:24,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:24" (3/3) ... [2018-11-28 20:15:24,604 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_tso.oepc_false-unreach-call.i [2018-11-28 20:15:24,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,650 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,651 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,652 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,652 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,652 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,652 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,653 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,653 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,653 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,653 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,653 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,654 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,654 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,654 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,654 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,655 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,655 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,655 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,655 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,656 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,656 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,656 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,656 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,659 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,659 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,659 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,660 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,660 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,671 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,671 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,671 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:24,704 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:15:24,704 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:15:24,715 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:15:24,735 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:15:24,767 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:15:24,768 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:15:24,768 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:15:24,768 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:15:24,768 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:15:24,768 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:15:24,768 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:15:24,769 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:15:24,769 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:15:24,785 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-11-28 20:15:26,507 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25087 states. [2018-11-28 20:15:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 25087 states. [2018-11-28 20:15:26,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 20:15:26,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:26,519 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] [2018-11-28 20:15:26,521 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:26,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:26,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1104590460, now seen corresponding path program 1 times [2018-11-28 20:15:26,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:26,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:26,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:26,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:26,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:26,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:26,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:26,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:26,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:26,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:26,911 INFO L87 Difference]: Start difference. First operand 25087 states. Second operand 4 states. [2018-11-28 20:15:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:27,972 INFO L93 Difference]: Finished difference Result 45387 states and 177625 transitions. [2018-11-28 20:15:27,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:15:27,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-28 20:15:27,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:28,300 INFO L225 Difference]: With dead ends: 45387 [2018-11-28 20:15:28,301 INFO L226 Difference]: Without dead ends: 40627 [2018-11-28 20:15:28,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40627 states. [2018-11-28 20:15:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40627 to 23661. [2018-11-28 20:15:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23661 states. [2018-11-28 20:15:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23661 states to 23661 states and 92542 transitions. [2018-11-28 20:15:30,164 INFO L78 Accepts]: Start accepts. Automaton has 23661 states and 92542 transitions. Word has length 36 [2018-11-28 20:15:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:30,166 INFO L480 AbstractCegarLoop]: Abstraction has 23661 states and 92542 transitions. [2018-11-28 20:15:30,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 23661 states and 92542 transitions. [2018-11-28 20:15:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 20:15:30,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:30,179 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] [2018-11-28 20:15:30,180 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:30,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:30,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1826409231, now seen corresponding path program 1 times [2018-11-28 20:15:30,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:30,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:30,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:30,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:30,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:30,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:30,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:30,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:30,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:30,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:30,471 INFO L87 Difference]: Start difference. First operand 23661 states and 92542 transitions. Second operand 5 states. [2018-11-28 20:15:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:33,283 INFO L93 Difference]: Finished difference Result 64829 states and 241368 transitions. [2018-11-28 20:15:33,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:15:33,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-28 20:15:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:33,527 INFO L225 Difference]: With dead ends: 64829 [2018-11-28 20:15:33,527 INFO L226 Difference]: Without dead ends: 64669 [2018-11-28 20:15:33,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64669 states. [2018-11-28 20:15:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64669 to 37141. [2018-11-28 20:15:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37141 states. [2018-11-28 20:15:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37141 states to 37141 states and 138283 transitions. [2018-11-28 20:15:35,376 INFO L78 Accepts]: Start accepts. Automaton has 37141 states and 138283 transitions. Word has length 43 [2018-11-28 20:15:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:35,378 INFO L480 AbstractCegarLoop]: Abstraction has 37141 states and 138283 transitions. [2018-11-28 20:15:35,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 37141 states and 138283 transitions. [2018-11-28 20:15:35,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 20:15:35,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:35,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:35,384 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:35,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:35,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1003362560, now seen corresponding path program 1 times [2018-11-28 20:15:35,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:35,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:35,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:35,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:35,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:35,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:35,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:35,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:35,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:35,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:35,475 INFO L87 Difference]: Start difference. First operand 37141 states and 138283 transitions. Second operand 4 states. [2018-11-28 20:15:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:35,558 INFO L93 Difference]: Finished difference Result 12363 states and 41176 transitions. [2018-11-28 20:15:35,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:15:35,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-28 20:15:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:35,593 INFO L225 Difference]: With dead ends: 12363 [2018-11-28 20:15:35,593 INFO L226 Difference]: Without dead ends: 11842 [2018-11-28 20:15:35,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2018-11-28 20:15:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 11842. [2018-11-28 20:15:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2018-11-28 20:15:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 39621 transitions. [2018-11-28 20:15:35,886 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 39621 transitions. Word has length 44 [2018-11-28 20:15:35,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:35,886 INFO L480 AbstractCegarLoop]: Abstraction has 11842 states and 39621 transitions. [2018-11-28 20:15:35,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 39621 transitions. [2018-11-28 20:15:35,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 20:15:35,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:35,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] [2018-11-28 20:15:35,894 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:35,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:35,895 INFO L82 PathProgramCache]: Analyzing trace with hash 551720430, now seen corresponding path program 1 times [2018-11-28 20:15:35,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:35,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:35,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:35,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:35,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:36,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:36,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:36,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:36,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:36,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:36,147 INFO L87 Difference]: Start difference. First operand 11842 states and 39621 transitions. Second operand 4 states. [2018-11-28 20:15:36,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:36,867 INFO L93 Difference]: Finished difference Result 17018 states and 55692 transitions. [2018-11-28 20:15:36,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:15:36,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-11-28 20:15:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:36,910 INFO L225 Difference]: With dead ends: 17018 [2018-11-28 20:15:36,910 INFO L226 Difference]: Without dead ends: 17018 [2018-11-28 20:15:36,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:36,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17018 states. [2018-11-28 20:15:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17018 to 12878. [2018-11-28 20:15:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12878 states. [2018-11-28 20:15:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12878 states to 12878 states and 42719 transitions. [2018-11-28 20:15:37,335 INFO L78 Accepts]: Start accepts. Automaton has 12878 states and 42719 transitions. Word has length 57 [2018-11-28 20:15:37,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:37,336 INFO L480 AbstractCegarLoop]: Abstraction has 12878 states and 42719 transitions. [2018-11-28 20:15:37,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 12878 states and 42719 transitions. [2018-11-28 20:15:37,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 20:15:37,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:37,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:37,346 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:37,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:37,347 INFO L82 PathProgramCache]: Analyzing trace with hash 217321422, now seen corresponding path program 1 times [2018-11-28 20:15:37,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:37,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:37,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:37,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:37,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:37,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:37,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:37,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:37,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:37,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:37,651 INFO L87 Difference]: Start difference. First operand 12878 states and 42719 transitions. Second operand 5 states. [2018-11-28 20:15:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:38,136 INFO L93 Difference]: Finished difference Result 2522 states and 6736 transitions. [2018-11-28 20:15:38,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:15:38,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-11-28 20:15:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:38,145 INFO L225 Difference]: With dead ends: 2522 [2018-11-28 20:15:38,145 INFO L226 Difference]: Without dead ends: 2110 [2018-11-28 20:15:38,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2018-11-28 20:15:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2007. [2018-11-28 20:15:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2018-11-28 20:15:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 5339 transitions. [2018-11-28 20:15:38,204 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 5339 transitions. Word has length 57 [2018-11-28 20:15:38,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:38,204 INFO L480 AbstractCegarLoop]: Abstraction has 2007 states and 5339 transitions. [2018-11-28 20:15:38,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 5339 transitions. [2018-11-28 20:15:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 20:15:38,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:38,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:38,213 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:38,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1229710074, now seen corresponding path program 1 times [2018-11-28 20:15:38,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:38,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:38,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:38,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:38,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:38,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:38,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:15:38,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:15:38,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:15:38,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:38,701 INFO L87 Difference]: Start difference. First operand 2007 states and 5339 transitions. Second operand 7 states. [2018-11-28 20:15:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:39,502 INFO L93 Difference]: Finished difference Result 2413 states and 6166 transitions. [2018-11-28 20:15:39,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:15:39,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-11-28 20:15:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:39,507 INFO L225 Difference]: With dead ends: 2413 [2018-11-28 20:15:39,507 INFO L226 Difference]: Without dead ends: 2329 [2018-11-28 20:15:39,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2018-11-28 20:15:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2253. [2018-11-28 20:15:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2018-11-28 20:15:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 5861 transitions. [2018-11-28 20:15:39,546 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 5861 transitions. Word has length 90 [2018-11-28 20:15:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:39,546 INFO L480 AbstractCegarLoop]: Abstraction has 2253 states and 5861 transitions. [2018-11-28 20:15:39,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:15:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 5861 transitions. [2018-11-28 20:15:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 20:15:39,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:39,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:39,553 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:39,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:39,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2095676199, now seen corresponding path program 1 times [2018-11-28 20:15:39,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:39,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:39,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:39,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:39,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:40,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:40,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:40,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:40,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:40,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:40,013 INFO L87 Difference]: Start difference. First operand 2253 states and 5861 transitions. Second operand 5 states. [2018-11-28 20:15:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:40,592 INFO L93 Difference]: Finished difference Result 2790 states and 7091 transitions. [2018-11-28 20:15:40,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:15:40,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-11-28 20:15:40,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:40,598 INFO L225 Difference]: With dead ends: 2790 [2018-11-28 20:15:40,598 INFO L226 Difference]: Without dead ends: 2751 [2018-11-28 20:15:40,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2018-11-28 20:15:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2379. [2018-11-28 20:15:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2018-11-28 20:15:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 6127 transitions. [2018-11-28 20:15:40,638 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 6127 transitions. Word has length 90 [2018-11-28 20:15:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:40,638 INFO L480 AbstractCegarLoop]: Abstraction has 2379 states and 6127 transitions. [2018-11-28 20:15:40,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 6127 transitions. [2018-11-28 20:15:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 20:15:40,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:40,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:40,646 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:40,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1989063700, now seen corresponding path program 1 times [2018-11-28 20:15:40,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:40,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:40,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:40,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:40,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:40,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:40,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:15:40,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:15:40,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:15:40,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:15:40,776 INFO L87 Difference]: Start difference. First operand 2379 states and 6127 transitions. Second operand 3 states. [2018-11-28 20:15:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:40,975 INFO L93 Difference]: Finished difference Result 2489 states and 6361 transitions. [2018-11-28 20:15:40,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:15:40,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-11-28 20:15:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:40,981 INFO L225 Difference]: With dead ends: 2489 [2018-11-28 20:15:40,981 INFO L226 Difference]: Without dead ends: 2489 [2018-11-28 20:15:40,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:15:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2018-11-28 20:15:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2417. [2018-11-28 20:15:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2417 states. [2018-11-28 20:15:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 6205 transitions. [2018-11-28 20:15:41,018 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 6205 transitions. Word has length 90 [2018-11-28 20:15:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:41,019 INFO L480 AbstractCegarLoop]: Abstraction has 2417 states and 6205 transitions. [2018-11-28 20:15:41,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:15:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 6205 transitions. [2018-11-28 20:15:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:41,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:41,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:41,025 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:41,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:41,025 INFO L82 PathProgramCache]: Analyzing trace with hash 353378826, now seen corresponding path program 1 times [2018-11-28 20:15:41,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:41,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:41,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:41,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:41,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:41,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:41,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:41,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:41,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:41,164 INFO L87 Difference]: Start difference. First operand 2417 states and 6205 transitions. Second operand 4 states. [2018-11-28 20:15:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:41,357 INFO L93 Difference]: Finished difference Result 4371 states and 11304 transitions. [2018-11-28 20:15:41,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:15:41,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-28 20:15:41,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:41,366 INFO L225 Difference]: With dead ends: 4371 [2018-11-28 20:15:41,366 INFO L226 Difference]: Without dead ends: 4371 [2018-11-28 20:15:41,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2018-11-28 20:15:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 2349. [2018-11-28 20:15:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2018-11-28 20:15:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 5959 transitions. [2018-11-28 20:15:41,416 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 5959 transitions. Word has length 92 [2018-11-28 20:15:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:41,416 INFO L480 AbstractCegarLoop]: Abstraction has 2349 states and 5959 transitions. [2018-11-28 20:15:41,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 5959 transitions. [2018-11-28 20:15:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:41,422 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:41,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:41,422 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:41,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:41,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1349001223, now seen corresponding path program 1 times [2018-11-28 20:15:41,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:41,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:41,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:41,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:41,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:41,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:41,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:41,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:41,739 INFO L87 Difference]: Start difference. First operand 2349 states and 5959 transitions. Second operand 4 states. [2018-11-28 20:15:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:41,936 INFO L93 Difference]: Finished difference Result 2685 states and 6879 transitions. [2018-11-28 20:15:41,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:15:41,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-28 20:15:41,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:41,941 INFO L225 Difference]: With dead ends: 2685 [2018-11-28 20:15:41,941 INFO L226 Difference]: Without dead ends: 2685 [2018-11-28 20:15:41,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2018-11-28 20:15:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2653. [2018-11-28 20:15:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2018-11-28 20:15:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 6799 transitions. [2018-11-28 20:15:41,977 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 6799 transitions. Word has length 92 [2018-11-28 20:15:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:41,978 INFO L480 AbstractCegarLoop]: Abstraction has 2653 states and 6799 transitions. [2018-11-28 20:15:41,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 6799 transitions. [2018-11-28 20:15:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:41,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:41,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:41,983 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:41,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:41,983 INFO L82 PathProgramCache]: Analyzing trace with hash 868756730, now seen corresponding path program 1 times [2018-11-28 20:15:41,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:41,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:41,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:41,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:41,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:42,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:42,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:42,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:42,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:42,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:42,217 INFO L87 Difference]: Start difference. First operand 2653 states and 6799 transitions. Second operand 6 states. [2018-11-28 20:15:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:42,618 INFO L93 Difference]: Finished difference Result 3995 states and 10189 transitions. [2018-11-28 20:15:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:42,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-28 20:15:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:42,625 INFO L225 Difference]: With dead ends: 3995 [2018-11-28 20:15:42,625 INFO L226 Difference]: Without dead ends: 3963 [2018-11-28 20:15:42,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2018-11-28 20:15:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3559. [2018-11-28 20:15:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3559 states. [2018-11-28 20:15:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 9122 transitions. [2018-11-28 20:15:42,677 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 9122 transitions. Word has length 92 [2018-11-28 20:15:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:42,677 INFO L480 AbstractCegarLoop]: Abstraction has 3559 states and 9122 transitions. [2018-11-28 20:15:42,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 9122 transitions. [2018-11-28 20:15:42,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:42,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:42,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:42,685 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:42,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:42,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1830370747, now seen corresponding path program 1 times [2018-11-28 20:15:42,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:42,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:42,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:43,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:43,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:15:43,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:15:43,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:15:43,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:43,167 INFO L87 Difference]: Start difference. First operand 3559 states and 9122 transitions. Second operand 7 states. [2018-11-28 20:15:43,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:43,791 INFO L93 Difference]: Finished difference Result 7660 states and 19944 transitions. [2018-11-28 20:15:43,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:15:43,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-28 20:15:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:43,802 INFO L225 Difference]: With dead ends: 7660 [2018-11-28 20:15:43,802 INFO L226 Difference]: Without dead ends: 7660 [2018-11-28 20:15:43,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:15:43,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7660 states. [2018-11-28 20:15:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7660 to 4179. [2018-11-28 20:15:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4179 states. [2018-11-28 20:15:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 10752 transitions. [2018-11-28 20:15:43,884 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 10752 transitions. Word has length 92 [2018-11-28 20:15:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:43,884 INFO L480 AbstractCegarLoop]: Abstraction has 4179 states and 10752 transitions. [2018-11-28 20:15:43,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:15:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 10752 transitions. [2018-11-28 20:15:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:43,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:43,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:43,894 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:43,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1219832068, now seen corresponding path program 1 times [2018-11-28 20:15:43,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:43,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:43,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:43,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:43,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:44,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:44,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:15:44,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:15:44,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:15:44,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:44,237 INFO L87 Difference]: Start difference. First operand 4179 states and 10752 transitions. Second operand 7 states. [2018-11-28 20:15:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:44,684 INFO L93 Difference]: Finished difference Result 3925 states and 10102 transitions. [2018-11-28 20:15:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:15:44,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-28 20:15:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:44,690 INFO L225 Difference]: With dead ends: 3925 [2018-11-28 20:15:44,690 INFO L226 Difference]: Without dead ends: 3925 [2018-11-28 20:15:44,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:15:44,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2018-11-28 20:15:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3771. [2018-11-28 20:15:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3771 states. [2018-11-28 20:15:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 9774 transitions. [2018-11-28 20:15:44,745 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 9774 transitions. Word has length 92 [2018-11-28 20:15:44,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:44,745 INFO L480 AbstractCegarLoop]: Abstraction has 3771 states and 9774 transitions. [2018-11-28 20:15:44,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:15:44,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 9774 transitions. [2018-11-28 20:15:44,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:44,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:44,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:44,754 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:44,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:44,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1611236628, now seen corresponding path program 1 times [2018-11-28 20:15:44,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:44,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:44,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:44,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:44,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:44,930 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 20:15:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:45,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:45,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:15:45,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:15:45,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:15:45,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:45,008 INFO L87 Difference]: Start difference. First operand 3771 states and 9774 transitions. Second operand 7 states. [2018-11-28 20:15:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:45,930 INFO L93 Difference]: Finished difference Result 4019 states and 10380 transitions. [2018-11-28 20:15:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:45,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-28 20:15:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:45,937 INFO L225 Difference]: With dead ends: 4019 [2018-11-28 20:15:45,938 INFO L226 Difference]: Without dead ends: 4019 [2018-11-28 20:15:45,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2018-11-28 20:15:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 3753. [2018-11-28 20:15:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3753 states. [2018-11-28 20:15:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 9738 transitions. [2018-11-28 20:15:45,981 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 9738 transitions. Word has length 92 [2018-11-28 20:15:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:45,981 INFO L480 AbstractCegarLoop]: Abstraction has 3753 states and 9738 transitions. [2018-11-28 20:15:45,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:15:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 9738 transitions. [2018-11-28 20:15:45,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:45,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:45,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:45,987 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:45,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:45,988 INFO L82 PathProgramCache]: Analyzing trace with hash -200357108, now seen corresponding path program 1 times [2018-11-28 20:15:45,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:45,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:45,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:45,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:45,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:46,444 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-11-28 20:15:46,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-11-28 20:15:46,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:46,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:46,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:46,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:46,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:46,530 INFO L87 Difference]: Start difference. First operand 3753 states and 9738 transitions. Second operand 5 states. [2018-11-28 20:15:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:46,754 INFO L93 Difference]: Finished difference Result 3485 states and 9046 transitions. [2018-11-28 20:15:46,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:15:46,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-11-28 20:15:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:46,763 INFO L225 Difference]: With dead ends: 3485 [2018-11-28 20:15:46,763 INFO L226 Difference]: Without dead ends: 3485 [2018-11-28 20:15:46,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-11-28 20:15:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 3485. [2018-11-28 20:15:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3485 states. [2018-11-28 20:15:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 9046 transitions. [2018-11-28 20:15:46,801 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 9046 transitions. Word has length 92 [2018-11-28 20:15:46,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:46,802 INFO L480 AbstractCegarLoop]: Abstraction has 3485 states and 9046 transitions. [2018-11-28 20:15:46,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 9046 transitions. [2018-11-28 20:15:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:46,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:46,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:46,808 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:46,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:46,808 INFO L82 PathProgramCache]: Analyzing trace with hash -649053747, now seen corresponding path program 1 times [2018-11-28 20:15:46,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:46,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:46,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:46,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:46,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:46,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:46,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:46,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:46,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:46,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:46,999 INFO L87 Difference]: Start difference. First operand 3485 states and 9046 transitions. Second operand 6 states. [2018-11-28 20:15:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:47,182 INFO L93 Difference]: Finished difference Result 2877 states and 7206 transitions. [2018-11-28 20:15:47,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:15:47,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-28 20:15:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:47,187 INFO L225 Difference]: With dead ends: 2877 [2018-11-28 20:15:47,187 INFO L226 Difference]: Without dead ends: 2877 [2018-11-28 20:15:47,187 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-11-28 20:15:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2018-11-28 20:15:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1898. [2018-11-28 20:15:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2018-11-28 20:15:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 4870 transitions. [2018-11-28 20:15:47,222 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 4870 transitions. Word has length 92 [2018-11-28 20:15:47,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:47,223 INFO L480 AbstractCegarLoop]: Abstraction has 1898 states and 4870 transitions. [2018-11-28 20:15:47,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 4870 transitions. [2018-11-28 20:15:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:47,228 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:47,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:47,229 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:47,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:47,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1789071189, now seen corresponding path program 1 times [2018-11-28 20:15:47,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:47,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:47,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:47,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:47,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:47,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:47,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:15:47,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:15:47,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:15:47,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:47,385 INFO L87 Difference]: Start difference. First operand 1898 states and 4870 transitions. Second operand 7 states. [2018-11-28 20:15:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:47,995 INFO L93 Difference]: Finished difference Result 2829 states and 7095 transitions. [2018-11-28 20:15:47,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 20:15:47,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-11-28 20:15:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:48,000 INFO L225 Difference]: With dead ends: 2829 [2018-11-28 20:15:48,000 INFO L226 Difference]: Without dead ends: 2829 [2018-11-28 20:15:48,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:15:48,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2018-11-28 20:15:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2248. [2018-11-28 20:15:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-11-28 20:15:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5728 transitions. [2018-11-28 20:15:48,029 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5728 transitions. Word has length 94 [2018-11-28 20:15:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:48,030 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5728 transitions. [2018-11-28 20:15:48,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:15:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5728 transitions. [2018-11-28 20:15:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:48,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:48,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:48,034 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:48,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:48,034 INFO L82 PathProgramCache]: Analyzing trace with hash -544306708, now seen corresponding path program 1 times [2018-11-28 20:15:48,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:48,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:48,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:48,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:48,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:48,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:48,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:48,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:48,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:48,236 INFO L87 Difference]: Start difference. First operand 2248 states and 5728 transitions. Second operand 6 states. [2018-11-28 20:15:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:48,578 INFO L93 Difference]: Finished difference Result 2288 states and 5773 transitions. [2018-11-28 20:15:48,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:15:48,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 20:15:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:48,583 INFO L225 Difference]: With dead ends: 2288 [2018-11-28 20:15:48,584 INFO L226 Difference]: Without dead ends: 2288 [2018-11-28 20:15:48,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:15:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2018-11-28 20:15:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2233. [2018-11-28 20:15:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2233 states. [2018-11-28 20:15:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 5666 transitions. [2018-11-28 20:15:48,610 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 5666 transitions. Word has length 94 [2018-11-28 20:15:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:48,610 INFO L480 AbstractCegarLoop]: Abstraction has 2233 states and 5666 transitions. [2018-11-28 20:15:48,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 5666 transitions. [2018-11-28 20:15:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:48,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:48,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:48,615 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:48,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:48,615 INFO L82 PathProgramCache]: Analyzing trace with hash 917273291, now seen corresponding path program 1 times [2018-11-28 20:15:48,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:48,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:48,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:48,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:48,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:48,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:48,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:48,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:48,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:48,743 INFO L87 Difference]: Start difference. First operand 2233 states and 5666 transitions. Second operand 6 states. [2018-11-28 20:15:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:49,025 INFO L93 Difference]: Finished difference Result 2309 states and 5831 transitions. [2018-11-28 20:15:49,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:15:49,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 20:15:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:49,030 INFO L225 Difference]: With dead ends: 2309 [2018-11-28 20:15:49,030 INFO L226 Difference]: Without dead ends: 2309 [2018-11-28 20:15:49,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:15:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-11-28 20:15:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2272. [2018-11-28 20:15:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2018-11-28 20:15:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 5758 transitions. [2018-11-28 20:15:49,057 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 5758 transitions. Word has length 94 [2018-11-28 20:15:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:49,058 INFO L480 AbstractCegarLoop]: Abstraction has 2272 states and 5758 transitions. [2018-11-28 20:15:49,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 5758 transitions. [2018-11-28 20:15:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:49,063 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:49,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:49,063 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:49,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2274571, now seen corresponding path program 1 times [2018-11-28 20:15:49,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:49,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:49,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:49,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:49,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:49,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:49,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:49,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:49,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:49,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:49,183 INFO L87 Difference]: Start difference. First operand 2272 states and 5758 transitions. Second operand 5 states. [2018-11-28 20:15:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:49,406 INFO L93 Difference]: Finished difference Result 2592 states and 6558 transitions. [2018-11-28 20:15:49,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:49,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-28 20:15:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:49,411 INFO L225 Difference]: With dead ends: 2592 [2018-11-28 20:15:49,411 INFO L226 Difference]: Without dead ends: 2592 [2018-11-28 20:15:49,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2018-11-28 20:15:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2033. [2018-11-28 20:15:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2018-11-28 20:15:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 5159 transitions. [2018-11-28 20:15:49,442 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 5159 transitions. Word has length 94 [2018-11-28 20:15:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:49,442 INFO L480 AbstractCegarLoop]: Abstraction has 2033 states and 5159 transitions. [2018-11-28 20:15:49,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 5159 transitions. [2018-11-28 20:15:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:49,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:49,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:49,446 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:49,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:49,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1247039052, now seen corresponding path program 1 times [2018-11-28 20:15:49,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:49,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:49,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:49,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:49,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:49,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:49,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 20:15:49,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 20:15:49,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 20:15:49,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:15:49,663 INFO L87 Difference]: Start difference. First operand 2033 states and 5159 transitions. Second operand 10 states. [2018-11-28 20:15:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:50,223 INFO L93 Difference]: Finished difference Result 3753 states and 9690 transitions. [2018-11-28 20:15:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:15:50,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2018-11-28 20:15:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:50,227 INFO L225 Difference]: With dead ends: 3753 [2018-11-28 20:15:50,227 INFO L226 Difference]: Without dead ends: 1754 [2018-11-28 20:15:50,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-28 20:15:50,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-11-28 20:15:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2018-11-28 20:15:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2018-11-28 20:15:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 4578 transitions. [2018-11-28 20:15:50,249 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 4578 transitions. Word has length 94 [2018-11-28 20:15:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:50,249 INFO L480 AbstractCegarLoop]: Abstraction has 1754 states and 4578 transitions. [2018-11-28 20:15:50,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 20:15:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 4578 transitions. [2018-11-28 20:15:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:50,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:50,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:50,254 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:50,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:50,254 INFO L82 PathProgramCache]: Analyzing trace with hash 550053201, now seen corresponding path program 1 times [2018-11-28 20:15:50,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:50,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:50,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:50,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:50,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:15:50,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:50,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:50,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:50,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:50,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:50,483 INFO L87 Difference]: Start difference. First operand 1754 states and 4578 transitions. Second operand 6 states. [2018-11-28 20:15:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:50,679 INFO L93 Difference]: Finished difference Result 1840 states and 4742 transitions. [2018-11-28 20:15:50,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:50,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 20:15:50,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:50,683 INFO L225 Difference]: With dead ends: 1840 [2018-11-28 20:15:50,683 INFO L226 Difference]: Without dead ends: 1824 [2018-11-28 20:15:50,684 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-11-28 20:15:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2018-11-28 20:15:50,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1754. [2018-11-28 20:15:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2018-11-28 20:15:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 4570 transitions. [2018-11-28 20:15:50,703 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 4570 transitions. Word has length 94 [2018-11-28 20:15:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:50,704 INFO L480 AbstractCegarLoop]: Abstraction has 1754 states and 4570 transitions. [2018-11-28 20:15:50,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 4570 transitions. [2018-11-28 20:15:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:50,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:50,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:50,707 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:50,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:50,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1150687278, now seen corresponding path program 2 times [2018-11-28 20:15:50,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:50,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:50,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:50,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:50,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:15:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:15:50,814 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:15:50,987 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:15:50,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:15:50 BasicIcfg [2018-11-28 20:15:50,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:15:50,991 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:15:50,991 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:15:50,991 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:15:50,992 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:24" (3/4) ... [2018-11-28 20:15:50,997 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:15:51,152 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:15:51,153 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:15:51,154 INFO L168 Benchmark]: Toolchain (without parser) took 28840.18 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-28 20:15:51,155 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:15:51,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 891.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:51,156 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:51,158 INFO L168 Benchmark]: Boogie Preprocessor took 45.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:15:51,158 INFO L168 Benchmark]: RCFGBuilder took 1239.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:51,159 INFO L168 Benchmark]: TraceAbstraction took 26396.40 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-28 20:15:51,159 INFO L168 Benchmark]: Witness Printer took 161.97 ms. Allocated memory is still 2.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:51,164 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.47 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 891.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.43 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 1239.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26396.40 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 161.97 ms. Allocated memory is still 2.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L679] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L680] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L681] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L682] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L683] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L684] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L685] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L686] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L687] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L688] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L689] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L690] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L691] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L693] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t1455; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t1455, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] -1 pthread_t t1456; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] FCALL, FORK -1 pthread_create(&t1456, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 x$w_buff1 = x$w_buff0 [L720] 0 x$w_buff0 = 2 [L721] 0 x$w_buff1_used = x$w_buff0_used [L722] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L725] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L726] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L727] 0 x$r_buff0_thd2 = (_Bool)1 [L730] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] 1 y = 1 [L702] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L706] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L740] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L709] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L767] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L768] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 x$flush_delayed = weak$$choice2 [L774] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L776] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L778] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L778] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L780] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L781] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] -1 x = x$flush_delayed ? x$mem_tmp : x [L784] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 26.2s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 12.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4553 SDtfs, 4210 SDslu, 10004 SDs, 0 SdLazy, 3901 SolverSat, 240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 55 SyntacticMatches, 13 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37141occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 57897 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1901 NumberOfCodeBlocks, 1901 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1785 ConstructedInterpolants, 0 QuantifiedInterpolants, 366911 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...