./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer --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 d8ad336436625e6f9cd92efafa328dff9ef611fd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 20:10:37,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 20:10:37,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 20:10:37,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 20:10:37,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 20:10:37,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 20:10:37,285 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 20:10:37,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 20:10:37,287 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 20:10:37,287 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 20:10:37,288 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 20:10:37,288 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 20:10:37,289 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 20:10:37,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 20:10:37,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 20:10:37,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 20:10:37,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 20:10:37,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 20:10:37,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 20:10:37,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 20:10:37,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 20:10:37,294 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 20:10:37,295 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 20:10:37,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 20:10:37,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 20:10:37,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 20:10:37,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 20:10:37,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 20:10:37,297 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 20:10:37,298 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 20:10:37,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 20:10:37,298 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 20:10:37,299 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 20:10:37,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 20:10:37,299 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 20:10:37,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 20:10:37,300 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 20:10:37,307 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 20:10:37,307 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 20:10:37,307 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 20:10:37,307 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 20:10:37,308 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 20:10:37,308 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 20:10:37,308 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 20:10:37,308 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 20:10:37,308 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 20:10:37,308 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 20:10:37,308 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 20:10:37,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 20:10:37,309 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 20:10:37,309 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 20:10:37,309 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 20:10:37,309 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 20:10:37,309 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 20:10:37,309 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 20:10:37,309 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 20:10:37,309 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 20:10:37,310 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 20:10:37,310 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 20:10:37,310 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 20:10:37,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 20:10:37,310 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 20:10:37,310 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 20:10:37,310 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 20:10:37,310 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 20:10:37,311 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 20:10:37,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 20:10:37,311 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer 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 -> d8ad336436625e6f9cd92efafa328dff9ef611fd [2018-12-01 20:10:37,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 20:10:37,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 20:10:37,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 20:10:37,341 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 20:10:37,342 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 20:10:37,342 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi010_tso.opt_false-unreach-call.i [2018-12-01 20:10:37,385 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer/data/203fcf05a/0d7490fe960f49b5878e538f8e7cbae2/FLAG09d2a9835 [2018-12-01 20:10:37,819 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 20:10:37,820 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/sv-benchmarks/c/pthread-wmm/rfi010_tso.opt_false-unreach-call.i [2018-12-01 20:10:37,828 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer/data/203fcf05a/0d7490fe960f49b5878e538f8e7cbae2/FLAG09d2a9835 [2018-12-01 20:10:37,837 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer/data/203fcf05a/0d7490fe960f49b5878e538f8e7cbae2 [2018-12-01 20:10:37,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 20:10:37,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 20:10:37,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 20:10:37,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 20:10:37,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 20:10:37,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:10:37" (1/1) ... [2018-12-01 20:10:37,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:37, skipping insertion in model container [2018-12-01 20:10:37,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:10:37" (1/1) ... [2018-12-01 20:10:37,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 20:10:37,869 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 20:10:38,053 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 20:10:38,060 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 20:10:38,134 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 20:10:38,163 INFO L195 MainTranslator]: Completed translation [2018-12-01 20:10:38,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:38 WrapperNode [2018-12-01 20:10:38,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 20:10:38,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 20:10:38,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 20:10:38,164 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 20:10:38,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:38" (1/1) ... [2018-12-01 20:10:38,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:38" (1/1) ... [2018-12-01 20:10:38,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 20:10:38,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 20:10:38,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 20:10:38,195 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 20:10:38,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:38" (1/1) ... [2018-12-01 20:10:38,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:38" (1/1) ... [2018-12-01 20:10:38,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:38" (1/1) ... [2018-12-01 20:10:38,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:38" (1/1) ... [2018-12-01 20:10:38,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:38" (1/1) ... [2018-12-01 20:10:38,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:38" (1/1) ... [2018-12-01 20:10:38,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:38" (1/1) ... [2018-12-01 20:10:38,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 20:10:38,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 20:10:38,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 20:10:38,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 20:10:38,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 20:10:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 20:10:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 20:10:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 20:10:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 20:10:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 20:10:38,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 20:10:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 20:10:38,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 20:10:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 20:10:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 20:10:38,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 20:10:38,247 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 20:10:38,589 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 20:10:38,589 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 20:10:38,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:10:38 BoogieIcfgContainer [2018-12-01 20:10:38,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 20:10:38,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 20:10:38,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 20:10:38,592 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 20:10:38,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 08:10:37" (1/3) ... [2018-12-01 20:10:38,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6bb12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 08:10:38, skipping insertion in model container [2018-12-01 20:10:38,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:38" (2/3) ... [2018-12-01 20:10:38,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6bb12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 08:10:38, skipping insertion in model container [2018-12-01 20:10:38,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:10:38" (3/3) ... [2018-12-01 20:10:38,594 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010_tso.opt_false-unreach-call.i [2018-12-01 20:10:38,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,619 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,620 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,629 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,629 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,629 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,629 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,629 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 20:10:38,645 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 20:10:38,645 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 20:10:38,651 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 20:10:38,660 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 20:10:38,674 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 20:10:38,674 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 20:10:38,674 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 20:10:38,674 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 20:10:38,674 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 20:10:38,674 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 20:10:38,674 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 20:10:38,675 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 20:10:38,675 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 20:10:38,682 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173places, 226 transitions [2018-12-01 20:10:44,091 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83127 states. [2018-12-01 20:10:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 83127 states. [2018-12-01 20:10:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 20:10:44,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:10:44,098 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] [2018-12-01 20:10:44,100 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:10:44,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:10:44,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1645016021, now seen corresponding path program 1 times [2018-12-01 20:10:44,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:10:44,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:10:44,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:10:44,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:10:44,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:10:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:10:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:10:44,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:10:44,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 20:10:44,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 20:10:44,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 20:10:44,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 20:10:44,266 INFO L87 Difference]: Start difference. First operand 83127 states. Second operand 4 states. [2018-12-01 20:10:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:10:45,354 INFO L93 Difference]: Finished difference Result 150583 states and 603160 transitions. [2018-12-01 20:10:45,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 20:10:45,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-01 20:10:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:10:45,719 INFO L225 Difference]: With dead ends: 150583 [2018-12-01 20:10:45,719 INFO L226 Difference]: Without dead ends: 105839 [2018-12-01 20:10:45,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 20:10:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105839 states. [2018-12-01 20:10:47,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105839 to 61235. [2018-12-01 20:10:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61235 states. [2018-12-01 20:10:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61235 states to 61235 states and 248290 transitions. [2018-12-01 20:10:47,851 INFO L78 Accepts]: Start accepts. Automaton has 61235 states and 248290 transitions. Word has length 38 [2018-12-01 20:10:47,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:10:47,851 INFO L480 AbstractCegarLoop]: Abstraction has 61235 states and 248290 transitions. [2018-12-01 20:10:47,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 20:10:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 61235 states and 248290 transitions. [2018-12-01 20:10:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-01 20:10:47,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:10:47,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:10:47,856 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:10:47,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:10:47,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1043746306, now seen corresponding path program 1 times [2018-12-01 20:10:47,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:10:47,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:10:47,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:10:47,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:10:47,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:10:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:10:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:10:47,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:10:47,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 20:10:47,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 20:10:47,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 20:10:47,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 20:10:47,907 INFO L87 Difference]: Start difference. First operand 61235 states and 248290 transitions. Second operand 5 states. [2018-12-01 20:10:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:10:48,942 INFO L93 Difference]: Finished difference Result 146039 states and 554300 transitions. [2018-12-01 20:10:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 20:10:48,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-01 20:10:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:10:49,289 INFO L225 Difference]: With dead ends: 146039 [2018-12-01 20:10:49,289 INFO L226 Difference]: Without dead ends: 145471 [2018-12-01 20:10:49,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 20:10:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145471 states. [2018-12-01 20:10:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145471 to 96613. [2018-12-01 20:10:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96613 states. [2018-12-01 20:10:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96613 states to 96613 states and 368455 transitions. [2018-12-01 20:10:51,826 INFO L78 Accepts]: Start accepts. Automaton has 96613 states and 368455 transitions. Word has length 46 [2018-12-01 20:10:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:10:51,827 INFO L480 AbstractCegarLoop]: Abstraction has 96613 states and 368455 transitions. [2018-12-01 20:10:51,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 20:10:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 96613 states and 368455 transitions. [2018-12-01 20:10:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-01 20:10:51,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:10:51,831 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] [2018-12-01 20:10:51,831 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:10:51,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:10:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash 136646938, now seen corresponding path program 1 times [2018-12-01 20:10:51,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:10:51,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:10:51,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:10:51,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:10:51,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:10:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:10:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:10:51,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:10:51,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 20:10:51,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 20:10:51,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 20:10:51,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 20:10:51,889 INFO L87 Difference]: Start difference. First operand 96613 states and 368455 transitions. Second operand 5 states. [2018-12-01 20:10:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:10:53,030 INFO L93 Difference]: Finished difference Result 199269 states and 748089 transitions. [2018-12-01 20:10:53,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 20:10:53,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-01 20:10:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:10:53,474 INFO L225 Difference]: With dead ends: 199269 [2018-12-01 20:10:53,474 INFO L226 Difference]: Without dead ends: 198805 [2018-12-01 20:10:53,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 20:10:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198805 states. [2018-12-01 20:10:57,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198805 to 108296. [2018-12-01 20:10:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108296 states. [2018-12-01 20:10:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108296 states to 108296 states and 408659 transitions. [2018-12-01 20:10:58,193 INFO L78 Accepts]: Start accepts. Automaton has 108296 states and 408659 transitions. Word has length 47 [2018-12-01 20:10:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:10:58,193 INFO L480 AbstractCegarLoop]: Abstraction has 108296 states and 408659 transitions. [2018-12-01 20:10:58,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 20:10:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 108296 states and 408659 transitions. [2018-12-01 20:10:58,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-01 20:10:58,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:10:58,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:10:58,202 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:10:58,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:10:58,202 INFO L82 PathProgramCache]: Analyzing trace with hash -943699264, now seen corresponding path program 1 times [2018-12-01 20:10:58,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:10:58,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:10:58,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:10:58,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:10:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:10:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:10:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:10:58,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:10:58,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 20:10:58,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 20:10:58,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 20:10:58,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 20:10:58,231 INFO L87 Difference]: Start difference. First operand 108296 states and 408659 transitions. Second operand 3 states. [2018-12-01 20:10:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:10:59,191 INFO L93 Difference]: Finished difference Result 179115 states and 655174 transitions. [2018-12-01 20:10:59,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 20:10:59,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-01 20:10:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:10:59,526 INFO L225 Difference]: With dead ends: 179115 [2018-12-01 20:10:59,526 INFO L226 Difference]: Without dead ends: 179115 [2018-12-01 20:10:59,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 20:11:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179115 states. [2018-12-01 20:11:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179115 to 163646. [2018-12-01 20:11:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163646 states. [2018-12-01 20:11:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163646 states to 163646 states and 603625 transitions. [2018-12-01 20:11:03,087 INFO L78 Accepts]: Start accepts. Automaton has 163646 states and 603625 transitions. Word has length 49 [2018-12-01 20:11:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:03,087 INFO L480 AbstractCegarLoop]: Abstraction has 163646 states and 603625 transitions. [2018-12-01 20:11:03,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 20:11:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 163646 states and 603625 transitions. [2018-12-01 20:11:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 20:11:03,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:03,101 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] [2018-12-01 20:11:03,101 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:03,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:03,101 INFO L82 PathProgramCache]: Analyzing trace with hash -721809298, now seen corresponding path program 1 times [2018-12-01 20:11:03,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:03,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:03,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:03,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:03,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:03,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:03,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 20:11:03,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 20:11:03,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 20:11:03,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 20:11:03,178 INFO L87 Difference]: Start difference. First operand 163646 states and 603625 transitions. Second operand 6 states. [2018-12-01 20:11:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:04,548 INFO L93 Difference]: Finished difference Result 214598 states and 788311 transitions. [2018-12-01 20:11:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 20:11:04,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-01 20:11:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:05,026 INFO L225 Difference]: With dead ends: 214598 [2018-12-01 20:11:05,026 INFO L226 Difference]: Without dead ends: 214598 [2018-12-01 20:11:05,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 20:11:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214598 states. [2018-12-01 20:11:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214598 to 200128. [2018-12-01 20:11:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200128 states. [2018-12-01 20:11:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200128 states to 200128 states and 735197 transitions. [2018-12-01 20:11:11,118 INFO L78 Accepts]: Start accepts. Automaton has 200128 states and 735197 transitions. Word has length 53 [2018-12-01 20:11:11,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:11,118 INFO L480 AbstractCegarLoop]: Abstraction has 200128 states and 735197 transitions. [2018-12-01 20:11:11,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 20:11:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 200128 states and 735197 transitions. [2018-12-01 20:11:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 20:11:11,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:11,135 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] [2018-12-01 20:11:11,135 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:11,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:11,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1776206639, now seen corresponding path program 1 times [2018-12-01 20:11:11,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:11,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:11,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:11,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:11,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 20:11:11,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 20:11:11,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 20:11:11,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 20:11:11,209 INFO L87 Difference]: Start difference. First operand 200128 states and 735197 transitions. Second operand 7 states. [2018-12-01 20:11:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:13,315 INFO L93 Difference]: Finished difference Result 283834 states and 1009167 transitions. [2018-12-01 20:11:13,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 20:11:13,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-01 20:11:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:13,884 INFO L225 Difference]: With dead ends: 283834 [2018-12-01 20:11:13,884 INFO L226 Difference]: Without dead ends: 283834 [2018-12-01 20:11:13,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-01 20:11:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283834 states. [2018-12-01 20:11:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283834 to 228356. [2018-12-01 20:11:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228356 states. [2018-12-01 20:11:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228356 states to 228356 states and 826700 transitions. [2018-12-01 20:11:20,899 INFO L78 Accepts]: Start accepts. Automaton has 228356 states and 826700 transitions. Word has length 53 [2018-12-01 20:11:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:20,899 INFO L480 AbstractCegarLoop]: Abstraction has 228356 states and 826700 transitions. [2018-12-01 20:11:20,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 20:11:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 228356 states and 826700 transitions. [2018-12-01 20:11:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 20:11:20,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:20,915 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] [2018-12-01 20:11:20,915 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:20,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:20,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1631256976, now seen corresponding path program 1 times [2018-12-01 20:11:20,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:20,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:20,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:20,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:20,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:20,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:20,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:20,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 20:11:20,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 20:11:20,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 20:11:20,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 20:11:20,954 INFO L87 Difference]: Start difference. First operand 228356 states and 826700 transitions. Second operand 3 states. [2018-12-01 20:11:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:21,854 INFO L93 Difference]: Finished difference Result 182587 states and 650625 transitions. [2018-12-01 20:11:21,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 20:11:21,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-01 20:11:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:22,222 INFO L225 Difference]: With dead ends: 182587 [2018-12-01 20:11:22,222 INFO L226 Difference]: Without dead ends: 182587 [2018-12-01 20:11:22,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 20:11:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182587 states. [2018-12-01 20:11:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182587 to 177301. [2018-12-01 20:11:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177301 states. [2018-12-01 20:11:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177301 states to 177301 states and 634196 transitions. [2018-12-01 20:11:25,908 INFO L78 Accepts]: Start accepts. Automaton has 177301 states and 634196 transitions. Word has length 53 [2018-12-01 20:11:25,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:25,908 INFO L480 AbstractCegarLoop]: Abstraction has 177301 states and 634196 transitions. [2018-12-01 20:11:25,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 20:11:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 177301 states and 634196 transitions. [2018-12-01 20:11:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 20:11:25,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:25,919 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] [2018-12-01 20:11:25,919 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:25,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:25,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1658594805, now seen corresponding path program 1 times [2018-12-01 20:11:25,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:25,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:25,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:25,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:25,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:25,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:25,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 20:11:25,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 20:11:25,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 20:11:25,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 20:11:25,963 INFO L87 Difference]: Start difference. First operand 177301 states and 634196 transitions. Second operand 6 states. [2018-12-01 20:11:27,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:27,978 INFO L93 Difference]: Finished difference Result 334770 states and 1177857 transitions. [2018-12-01 20:11:27,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 20:11:27,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-01 20:11:27,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:28,628 INFO L225 Difference]: With dead ends: 334770 [2018-12-01 20:11:28,628 INFO L226 Difference]: Without dead ends: 334234 [2018-12-01 20:11:28,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-01 20:11:31,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334234 states. [2018-12-01 20:11:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334234 to 178407. [2018-12-01 20:11:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178407 states. [2018-12-01 20:11:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178407 states to 178407 states and 637996 transitions. [2018-12-01 20:11:36,067 INFO L78 Accepts]: Start accepts. Automaton has 178407 states and 637996 transitions. Word has length 53 [2018-12-01 20:11:36,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:36,067 INFO L480 AbstractCegarLoop]: Abstraction has 178407 states and 637996 transitions. [2018-12-01 20:11:36,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 20:11:36,067 INFO L276 IsEmpty]: Start isEmpty. Operand 178407 states and 637996 transitions. [2018-12-01 20:11:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-01 20:11:36,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:36,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:36,080 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:36,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:36,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1514606821, now seen corresponding path program 1 times [2018-12-01 20:11:36,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:36,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:36,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:36,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:36,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:36,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:36,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 20:11:36,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 20:11:36,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 20:11:36,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 20:11:36,154 INFO L87 Difference]: Start difference. First operand 178407 states and 637996 transitions. Second operand 6 states. [2018-12-01 20:11:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:37,529 INFO L93 Difference]: Finished difference Result 224186 states and 783823 transitions. [2018-12-01 20:11:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 20:11:37,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-01 20:11:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:37,955 INFO L225 Difference]: With dead ends: 224186 [2018-12-01 20:11:37,955 INFO L226 Difference]: Without dead ends: 224186 [2018-12-01 20:11:37,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 20:11:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224186 states. [2018-12-01 20:11:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224186 to 192266. [2018-12-01 20:11:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192266 states. [2018-12-01 20:11:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192266 states to 192266 states and 683049 transitions. [2018-12-01 20:11:42,320 INFO L78 Accepts]: Start accepts. Automaton has 192266 states and 683049 transitions. Word has length 54 [2018-12-01 20:11:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:42,321 INFO L480 AbstractCegarLoop]: Abstraction has 192266 states and 683049 transitions. [2018-12-01 20:11:42,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 20:11:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 192266 states and 683049 transitions. [2018-12-01 20:11:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-01 20:11:42,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:42,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:42,334 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:42,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:42,334 INFO L82 PathProgramCache]: Analyzing trace with hash -627103140, now seen corresponding path program 1 times [2018-12-01 20:11:42,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:42,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:42,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:42,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:42,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:42,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:42,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 20:11:42,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 20:11:42,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 20:11:42,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 20:11:42,362 INFO L87 Difference]: Start difference. First operand 192266 states and 683049 transitions. Second operand 4 states. [2018-12-01 20:11:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:42,461 INFO L93 Difference]: Finished difference Result 29127 states and 92139 transitions. [2018-12-01 20:11:42,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 20:11:42,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-01 20:11:42,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:42,489 INFO L225 Difference]: With dead ends: 29127 [2018-12-01 20:11:42,489 INFO L226 Difference]: Without dead ends: 22849 [2018-12-01 20:11:42,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 20:11:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22849 states. [2018-12-01 20:11:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22849 to 22602. [2018-12-01 20:11:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22602 states. [2018-12-01 20:11:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22602 states to 22602 states and 69780 transitions. [2018-12-01 20:11:42,722 INFO L78 Accepts]: Start accepts. Automaton has 22602 states and 69780 transitions. Word has length 54 [2018-12-01 20:11:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:42,722 INFO L480 AbstractCegarLoop]: Abstraction has 22602 states and 69780 transitions. [2018-12-01 20:11:42,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 20:11:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 22602 states and 69780 transitions. [2018-12-01 20:11:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-01 20:11:42,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:42,726 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] [2018-12-01 20:11:42,726 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:42,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:42,726 INFO L82 PathProgramCache]: Analyzing trace with hash 228917533, now seen corresponding path program 1 times [2018-12-01 20:11:42,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:42,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:42,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:42,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:42,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:42,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:42,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 20:11:42,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 20:11:42,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 20:11:42,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 20:11:42,766 INFO L87 Difference]: Start difference. First operand 22602 states and 69780 transitions. Second operand 4 states. [2018-12-01 20:11:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:42,938 INFO L93 Difference]: Finished difference Result 29366 states and 90886 transitions. [2018-12-01 20:11:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 20:11:42,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-01 20:11:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:42,973 INFO L225 Difference]: With dead ends: 29366 [2018-12-01 20:11:42,973 INFO L226 Difference]: Without dead ends: 29366 [2018-12-01 20:11:42,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 20:11:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29366 states. [2018-12-01 20:11:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29366 to 26238. [2018-12-01 20:11:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26238 states. [2018-12-01 20:11:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26238 states to 26238 states and 80860 transitions. [2018-12-01 20:11:43,275 INFO L78 Accepts]: Start accepts. Automaton has 26238 states and 80860 transitions. Word has length 63 [2018-12-01 20:11:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:43,276 INFO L480 AbstractCegarLoop]: Abstraction has 26238 states and 80860 transitions. [2018-12-01 20:11:43,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 20:11:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 26238 states and 80860 transitions. [2018-12-01 20:11:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-01 20:11:43,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:43,280 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] [2018-12-01 20:11:43,280 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:43,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1971727868, now seen corresponding path program 1 times [2018-12-01 20:11:43,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:43,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:43,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:43,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:43,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:43,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:43,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 20:11:43,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 20:11:43,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 20:11:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 20:11:43,326 INFO L87 Difference]: Start difference. First operand 26238 states and 80860 transitions. Second operand 6 states. [2018-12-01 20:11:43,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:43,769 INFO L93 Difference]: Finished difference Result 53431 states and 163786 transitions. [2018-12-01 20:11:43,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 20:11:43,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-01 20:11:43,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:43,839 INFO L225 Difference]: With dead ends: 53431 [2018-12-01 20:11:43,839 INFO L226 Difference]: Without dead ends: 53367 [2018-12-01 20:11:43,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-01 20:11:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53367 states. [2018-12-01 20:11:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53367 to 34364. [2018-12-01 20:11:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34364 states. [2018-12-01 20:11:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34364 states to 34364 states and 104270 transitions. [2018-12-01 20:11:44,506 INFO L78 Accepts]: Start accepts. Automaton has 34364 states and 104270 transitions. Word has length 63 [2018-12-01 20:11:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:44,506 INFO L480 AbstractCegarLoop]: Abstraction has 34364 states and 104270 transitions. [2018-12-01 20:11:44,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 20:11:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 34364 states and 104270 transitions. [2018-12-01 20:11:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-01 20:11:44,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:44,515 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] [2018-12-01 20:11:44,515 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:44,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:44,515 INFO L82 PathProgramCache]: Analyzing trace with hash -203492115, now seen corresponding path program 1 times [2018-12-01 20:11:44,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:44,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:44,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:44,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:44,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:44,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:44,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 20:11:44,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 20:11:44,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 20:11:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 20:11:44,531 INFO L87 Difference]: Start difference. First operand 34364 states and 104270 transitions. Second operand 3 states. [2018-12-01 20:11:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:44,641 INFO L93 Difference]: Finished difference Result 37960 states and 113326 transitions. [2018-12-01 20:11:44,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 20:11:44,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-01 20:11:44,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:44,683 INFO L225 Difference]: With dead ends: 37960 [2018-12-01 20:11:44,683 INFO L226 Difference]: Without dead ends: 37960 [2018-12-01 20:11:44,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 20:11:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37960 states. [2018-12-01 20:11:45,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37960 to 33288. [2018-12-01 20:11:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33288 states. [2018-12-01 20:11:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33288 states to 33288 states and 98676 transitions. [2018-12-01 20:11:45,056 INFO L78 Accepts]: Start accepts. Automaton has 33288 states and 98676 transitions. Word has length 69 [2018-12-01 20:11:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:45,056 INFO L480 AbstractCegarLoop]: Abstraction has 33288 states and 98676 transitions. [2018-12-01 20:11:45,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 20:11:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 33288 states and 98676 transitions. [2018-12-01 20:11:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-01 20:11:45,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:45,064 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] [2018-12-01 20:11:45,065 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:45,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash 253207669, now seen corresponding path program 1 times [2018-12-01 20:11:45,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:45,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:45,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:45,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:45,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 20:11:45,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 20:11:45,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 20:11:45,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 20:11:45,097 INFO L87 Difference]: Start difference. First operand 33288 states and 98676 transitions. Second operand 4 states. [2018-12-01 20:11:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:45,517 INFO L93 Difference]: Finished difference Result 44424 states and 131972 transitions. [2018-12-01 20:11:45,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 20:11:45,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-01 20:11:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:45,565 INFO L225 Difference]: With dead ends: 44424 [2018-12-01 20:11:45,565 INFO L226 Difference]: Without dead ends: 43848 [2018-12-01 20:11:45,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 20:11:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43848 states. [2018-12-01 20:11:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43848 to 41436. [2018-12-01 20:11:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41436 states. [2018-12-01 20:11:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41436 states to 41436 states and 122987 transitions. [2018-12-01 20:11:46,001 INFO L78 Accepts]: Start accepts. Automaton has 41436 states and 122987 transitions. Word has length 71 [2018-12-01 20:11:46,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:46,001 INFO L480 AbstractCegarLoop]: Abstraction has 41436 states and 122987 transitions. [2018-12-01 20:11:46,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 20:11:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 41436 states and 122987 transitions. [2018-12-01 20:11:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-01 20:11:46,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:46,013 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] [2018-12-01 20:11:46,013 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:46,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1543743690, now seen corresponding path program 1 times [2018-12-01 20:11:46,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:46,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:46,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:46,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:46,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:46,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:46,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 20:11:46,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 20:11:46,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 20:11:46,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-01 20:11:46,088 INFO L87 Difference]: Start difference. First operand 41436 states and 122987 transitions. Second operand 8 states. [2018-12-01 20:11:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:46,676 INFO L93 Difference]: Finished difference Result 48133 states and 141125 transitions. [2018-12-01 20:11:46,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 20:11:46,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-12-01 20:11:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:46,728 INFO L225 Difference]: With dead ends: 48133 [2018-12-01 20:11:46,728 INFO L226 Difference]: Without dead ends: 48133 [2018-12-01 20:11:46,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-01 20:11:46,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48133 states. [2018-12-01 20:11:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48133 to 44392. [2018-12-01 20:11:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44392 states. [2018-12-01 20:11:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44392 states to 44392 states and 130936 transitions. [2018-12-01 20:11:47,196 INFO L78 Accepts]: Start accepts. Automaton has 44392 states and 130936 transitions. Word has length 71 [2018-12-01 20:11:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:47,196 INFO L480 AbstractCegarLoop]: Abstraction has 44392 states and 130936 transitions. [2018-12-01 20:11:47,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 20:11:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 44392 states and 130936 transitions. [2018-12-01 20:11:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-01 20:11:47,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:47,208 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] [2018-12-01 20:11:47,208 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:47,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:47,208 INFO L82 PathProgramCache]: Analyzing trace with hash -656240009, now seen corresponding path program 1 times [2018-12-01 20:11:47,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:47,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:47,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:47,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:47,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:47,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:47,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 20:11:47,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 20:11:47,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 20:11:47,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 20:11:47,246 INFO L87 Difference]: Start difference. First operand 44392 states and 130936 transitions. Second operand 5 states. [2018-12-01 20:11:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:47,287 INFO L93 Difference]: Finished difference Result 11932 states and 29919 transitions. [2018-12-01 20:11:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 20:11:47,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-01 20:11:47,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:47,294 INFO L225 Difference]: With dead ends: 11932 [2018-12-01 20:11:47,294 INFO L226 Difference]: Without dead ends: 10080 [2018-12-01 20:11:47,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 20:11:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10080 states. [2018-12-01 20:11:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10080 to 7653. [2018-12-01 20:11:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7653 states. [2018-12-01 20:11:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7653 states to 7653 states and 19062 transitions. [2018-12-01 20:11:47,363 INFO L78 Accepts]: Start accepts. Automaton has 7653 states and 19062 transitions. Word has length 71 [2018-12-01 20:11:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:47,363 INFO L480 AbstractCegarLoop]: Abstraction has 7653 states and 19062 transitions. [2018-12-01 20:11:47,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 20:11:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 7653 states and 19062 transitions. [2018-12-01 20:11:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 20:11:47,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:47,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:47,369 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:47,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash -605876344, now seen corresponding path program 1 times [2018-12-01 20:11:47,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:47,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:47,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:47,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:47,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:47,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:47,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 20:11:47,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 20:11:47,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 20:11:47,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 20:11:47,423 INFO L87 Difference]: Start difference. First operand 7653 states and 19062 transitions. Second operand 4 states. [2018-12-01 20:11:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:47,538 INFO L93 Difference]: Finished difference Result 9032 states and 22112 transitions. [2018-12-01 20:11:47,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 20:11:47,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-01 20:11:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:47,544 INFO L225 Difference]: With dead ends: 9032 [2018-12-01 20:11:47,544 INFO L226 Difference]: Without dead ends: 9032 [2018-12-01 20:11:47,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 20:11:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9032 states. [2018-12-01 20:11:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9032 to 8326. [2018-12-01 20:11:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8326 states. [2018-12-01 20:11:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8326 states to 8326 states and 20517 transitions. [2018-12-01 20:11:47,610 INFO L78 Accepts]: Start accepts. Automaton has 8326 states and 20517 transitions. Word has length 100 [2018-12-01 20:11:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:47,610 INFO L480 AbstractCegarLoop]: Abstraction has 8326 states and 20517 transitions. [2018-12-01 20:11:47,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 20:11:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 8326 states and 20517 transitions. [2018-12-01 20:11:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 20:11:47,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:47,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, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:47,615 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:47,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:47,616 INFO L82 PathProgramCache]: Analyzing trace with hash 638888137, now seen corresponding path program 1 times [2018-12-01 20:11:47,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:47,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:47,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:47,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:47,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:47,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:47,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 20:11:47,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 20:11:47,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 20:11:47,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 20:11:47,669 INFO L87 Difference]: Start difference. First operand 8326 states and 20517 transitions. Second operand 8 states. [2018-12-01 20:11:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:48,581 INFO L93 Difference]: Finished difference Result 18094 states and 43167 transitions. [2018-12-01 20:11:48,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-01 20:11:48,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-12-01 20:11:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:48,597 INFO L225 Difference]: With dead ends: 18094 [2018-12-01 20:11:48,597 INFO L226 Difference]: Without dead ends: 17999 [2018-12-01 20:11:48,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-12-01 20:11:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17999 states. [2018-12-01 20:11:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17999 to 14189. [2018-12-01 20:11:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14189 states. [2018-12-01 20:11:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14189 states to 14189 states and 34364 transitions. [2018-12-01 20:11:48,736 INFO L78 Accepts]: Start accepts. Automaton has 14189 states and 34364 transitions. Word has length 100 [2018-12-01 20:11:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:48,736 INFO L480 AbstractCegarLoop]: Abstraction has 14189 states and 34364 transitions. [2018-12-01 20:11:48,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 20:11:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 14189 states and 34364 transitions. [2018-12-01 20:11:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 20:11:48,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:48,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:48,747 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:48,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1438321206, now seen corresponding path program 1 times [2018-12-01 20:11:48,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:48,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:48,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:48,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:48,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:48,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:48,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 20:11:48,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 20:11:48,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 20:11:48,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 20:11:48,822 INFO L87 Difference]: Start difference. First operand 14189 states and 34364 transitions. Second operand 7 states. [2018-12-01 20:11:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:49,147 INFO L93 Difference]: Finished difference Result 19352 states and 44884 transitions. [2018-12-01 20:11:49,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 20:11:49,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-01 20:11:49,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:49,159 INFO L225 Difference]: With dead ends: 19352 [2018-12-01 20:11:49,159 INFO L226 Difference]: Without dead ends: 19352 [2018-12-01 20:11:49,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-01 20:11:49,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19352 states. [2018-12-01 20:11:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19352 to 16465. [2018-12-01 20:11:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16465 states. [2018-12-01 20:11:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16465 states to 16465 states and 38763 transitions. [2018-12-01 20:11:49,306 INFO L78 Accepts]: Start accepts. Automaton has 16465 states and 38763 transitions. Word has length 100 [2018-12-01 20:11:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:49,307 INFO L480 AbstractCegarLoop]: Abstraction has 16465 states and 38763 transitions. [2018-12-01 20:11:49,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 20:11:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 16465 states and 38763 transitions. [2018-12-01 20:11:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 20:11:49,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:49,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:49,318 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:49,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:49,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1226970293, now seen corresponding path program 1 times [2018-12-01 20:11:49,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:49,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:49,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:49,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:49,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:49,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:49,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 20:11:49,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 20:11:49,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 20:11:49,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 20:11:49,382 INFO L87 Difference]: Start difference. First operand 16465 states and 38763 transitions. Second operand 7 states. [2018-12-01 20:11:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:49,736 INFO L93 Difference]: Finished difference Result 18474 states and 43255 transitions. [2018-12-01 20:11:49,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 20:11:49,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-01 20:11:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:49,749 INFO L225 Difference]: With dead ends: 18474 [2018-12-01 20:11:49,749 INFO L226 Difference]: Without dead ends: 18474 [2018-12-01 20:11:49,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-01 20:11:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18474 states. [2018-12-01 20:11:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18474 to 17057. [2018-12-01 20:11:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17057 states. [2018-12-01 20:11:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17057 states to 17057 states and 40062 transitions. [2018-12-01 20:11:49,894 INFO L78 Accepts]: Start accepts. Automaton has 17057 states and 40062 transitions. Word has length 100 [2018-12-01 20:11:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:49,895 INFO L480 AbstractCegarLoop]: Abstraction has 17057 states and 40062 transitions. [2018-12-01 20:11:49,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 20:11:49,895 INFO L276 IsEmpty]: Start isEmpty. Operand 17057 states and 40062 transitions. [2018-12-01 20:11:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 20:11:49,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:49,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:49,906 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:49,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:49,906 INFO L82 PathProgramCache]: Analyzing trace with hash 760511467, now seen corresponding path program 1 times [2018-12-01 20:11:49,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:49,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:49,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:49,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:49,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:50,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:50,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 20:11:50,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 20:11:50,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 20:11:50,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-01 20:11:50,003 INFO L87 Difference]: Start difference. First operand 17057 states and 40062 transitions. Second operand 7 states. [2018-12-01 20:11:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:50,170 INFO L93 Difference]: Finished difference Result 17983 states and 42002 transitions. [2018-12-01 20:11:50,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 20:11:50,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-01 20:11:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:50,183 INFO L225 Difference]: With dead ends: 17983 [2018-12-01 20:11:50,183 INFO L226 Difference]: Without dead ends: 17983 [2018-12-01 20:11:50,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-01 20:11:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17983 states. [2018-12-01 20:11:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17983 to 16520. [2018-12-01 20:11:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16520 states. [2018-12-01 20:11:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16520 states to 16520 states and 38816 transitions. [2018-12-01 20:11:50,327 INFO L78 Accepts]: Start accepts. Automaton has 16520 states and 38816 transitions. Word has length 100 [2018-12-01 20:11:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:50,327 INFO L480 AbstractCegarLoop]: Abstraction has 16520 states and 38816 transitions. [2018-12-01 20:11:50,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 20:11:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 16520 states and 38816 transitions. [2018-12-01 20:11:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 20:11:50,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:50,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:50,338 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:50,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:50,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1648015148, now seen corresponding path program 1 times [2018-12-01 20:11:50,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:50,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:50,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:50,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:50,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:50,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:50,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 20:11:50,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 20:11:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 20:11:50,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 20:11:50,376 INFO L87 Difference]: Start difference. First operand 16520 states and 38816 transitions. Second operand 5 states. [2018-12-01 20:11:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:50,625 INFO L93 Difference]: Finished difference Result 19359 states and 45352 transitions. [2018-12-01 20:11:50,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 20:11:50,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-01 20:11:50,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:50,639 INFO L225 Difference]: With dead ends: 19359 [2018-12-01 20:11:50,639 INFO L226 Difference]: Without dead ends: 19359 [2018-12-01 20:11:50,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 20:11:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2018-12-01 20:11:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 15812. [2018-12-01 20:11:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15812 states. [2018-12-01 20:11:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15812 states to 15812 states and 37143 transitions. [2018-12-01 20:11:50,783 INFO L78 Accepts]: Start accepts. Automaton has 15812 states and 37143 transitions. Word has length 100 [2018-12-01 20:11:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:50,783 INFO L480 AbstractCegarLoop]: Abstraction has 15812 states and 37143 transitions. [2018-12-01 20:11:50,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 20:11:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 15812 states and 37143 transitions. [2018-12-01 20:11:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 20:11:50,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:50,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:50,794 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:50,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:50,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1000590376, now seen corresponding path program 2 times [2018-12-01 20:11:50,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:50,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:50,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:50,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:50,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:50,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:50,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 20:11:50,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 20:11:50,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 20:11:50,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 20:11:50,837 INFO L87 Difference]: Start difference. First operand 15812 states and 37143 transitions. Second operand 5 states. [2018-12-01 20:11:51,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:51,023 INFO L93 Difference]: Finished difference Result 17772 states and 41236 transitions. [2018-12-01 20:11:51,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 20:11:51,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-01 20:11:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:51,036 INFO L225 Difference]: With dead ends: 17772 [2018-12-01 20:11:51,036 INFO L226 Difference]: Without dead ends: 17772 [2018-12-01 20:11:51,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-12-01 20:11:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17772 states. [2018-12-01 20:11:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17772 to 15941. [2018-12-01 20:11:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15941 states. [2018-12-01 20:11:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15941 states to 15941 states and 37408 transitions. [2018-12-01 20:11:51,183 INFO L78 Accepts]: Start accepts. Automaton has 15941 states and 37408 transitions. Word has length 100 [2018-12-01 20:11:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:51,183 INFO L480 AbstractCegarLoop]: Abstraction has 15941 states and 37408 transitions. [2018-12-01 20:11:51,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 20:11:51,183 INFO L276 IsEmpty]: Start isEmpty. Operand 15941 states and 37408 transitions. [2018-12-01 20:11:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 20:11:51,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:51,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:51,194 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:51,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:51,194 INFO L82 PathProgramCache]: Analyzing trace with hash 465947569, now seen corresponding path program 1 times [2018-12-01 20:11:51,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:51,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:51,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:51,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:11:51,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:51,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:51,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 20:11:51,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 20:11:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 20:11:51,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-01 20:11:51,279 INFO L87 Difference]: Start difference. First operand 15941 states and 37408 transitions. Second operand 10 states. [2018-12-01 20:11:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:51,677 INFO L93 Difference]: Finished difference Result 30351 states and 71482 transitions. [2018-12-01 20:11:51,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 20:11:51,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-01 20:11:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:51,680 INFO L225 Difference]: With dead ends: 30351 [2018-12-01 20:11:51,680 INFO L226 Difference]: Without dead ends: 3672 [2018-12-01 20:11:51,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-12-01 20:11:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2018-12-01 20:11:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3670. [2018-12-01 20:11:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3670 states. [2018-12-01 20:11:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 8692 transitions. [2018-12-01 20:11:51,705 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 8692 transitions. Word has length 102 [2018-12-01 20:11:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:51,705 INFO L480 AbstractCegarLoop]: Abstraction has 3670 states and 8692 transitions. [2018-12-01 20:11:51,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 20:11:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 8692 transitions. [2018-12-01 20:11:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 20:11:51,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:51,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:51,707 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:51,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:51,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1406724183, now seen corresponding path program 1 times [2018-12-01 20:11:51,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:51,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:51,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:51,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:51,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:51,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:51,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 20:11:51,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 20:11:51,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 20:11:51,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 20:11:51,744 INFO L87 Difference]: Start difference. First operand 3670 states and 8692 transitions. Second operand 5 states. [2018-12-01 20:11:51,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:51,900 INFO L93 Difference]: Finished difference Result 4083 states and 9603 transitions. [2018-12-01 20:11:51,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 20:11:51,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-01 20:11:51,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:51,905 INFO L225 Difference]: With dead ends: 4083 [2018-12-01 20:11:51,905 INFO L226 Difference]: Without dead ends: 4059 [2018-12-01 20:11:51,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 20:11:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4059 states. [2018-12-01 20:11:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4059 to 3726. [2018-12-01 20:11:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3726 states. [2018-12-01 20:11:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 8817 transitions. [2018-12-01 20:11:51,942 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 8817 transitions. Word has length 102 [2018-12-01 20:11:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:51,942 INFO L480 AbstractCegarLoop]: Abstraction has 3726 states and 8817 transitions. [2018-12-01 20:11:51,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 20:11:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 8817 transitions. [2018-12-01 20:11:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 20:11:51,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:51,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:51,946 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:51,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:51,946 INFO L82 PathProgramCache]: Analyzing trace with hash -716436783, now seen corresponding path program 1 times [2018-12-01 20:11:51,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:51,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:51,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:51,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:51,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:52,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:52,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 20:11:52,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 20:11:52,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 20:11:52,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-01 20:11:52,020 INFO L87 Difference]: Start difference. First operand 3726 states and 8817 transitions. Second operand 7 states. [2018-12-01 20:11:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:52,168 INFO L93 Difference]: Finished difference Result 4173 states and 9758 transitions. [2018-12-01 20:11:52,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 20:11:52,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-01 20:11:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:52,171 INFO L225 Difference]: With dead ends: 4173 [2018-12-01 20:11:52,171 INFO L226 Difference]: Without dead ends: 4173 [2018-12-01 20:11:52,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-01 20:11:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2018-12-01 20:11:52,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 3668. [2018-12-01 20:11:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3668 states. [2018-12-01 20:11:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 8699 transitions. [2018-12-01 20:11:52,195 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 8699 transitions. Word has length 102 [2018-12-01 20:11:52,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:52,195 INFO L480 AbstractCegarLoop]: Abstraction has 3668 states and 8699 transitions. [2018-12-01 20:11:52,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 20:11:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 8699 transitions. [2018-12-01 20:11:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 20:11:52,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:52,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:52,197 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:52,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:52,198 INFO L82 PathProgramCache]: Analyzing trace with hash 299428272, now seen corresponding path program 1 times [2018-12-01 20:11:52,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:52,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:52,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:52,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:52,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:52,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:52,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 20:11:52,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 20:11:52,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 20:11:52,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 20:11:52,261 INFO L87 Difference]: Start difference. First operand 3668 states and 8699 transitions. Second operand 5 states. [2018-12-01 20:11:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:52,285 INFO L93 Difference]: Finished difference Result 3668 states and 8683 transitions. [2018-12-01 20:11:52,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 20:11:52,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-01 20:11:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:52,288 INFO L225 Difference]: With dead ends: 3668 [2018-12-01 20:11:52,288 INFO L226 Difference]: Without dead ends: 3668 [2018-12-01 20:11:52,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-01 20:11:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2018-12-01 20:11:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3274. [2018-12-01 20:11:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3274 states. [2018-12-01 20:11:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 7771 transitions. [2018-12-01 20:11:52,314 INFO L78 Accepts]: Start accepts. Automaton has 3274 states and 7771 transitions. Word has length 102 [2018-12-01 20:11:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:52,314 INFO L480 AbstractCegarLoop]: Abstraction has 3274 states and 7771 transitions. [2018-12-01 20:11:52,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 20:11:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3274 states and 7771 transitions. [2018-12-01 20:11:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 20:11:52,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:52,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:52,316 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:52,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:52,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1186931953, now seen corresponding path program 2 times [2018-12-01 20:11:52,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:52,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:52,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:52,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:11:52,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:11:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:11:52,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:11:52,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-01 20:11:52,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 20:11:52,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 20:11:52,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-01 20:11:52,425 INFO L87 Difference]: Start difference. First operand 3274 states and 7771 transitions. Second operand 13 states. [2018-12-01 20:11:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:11:52,848 INFO L93 Difference]: Finished difference Result 5160 states and 12024 transitions. [2018-12-01 20:11:52,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 20:11:52,848 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-12-01 20:11:52,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 20:11:52,851 INFO L225 Difference]: With dead ends: 5160 [2018-12-01 20:11:52,851 INFO L226 Difference]: Without dead ends: 3780 [2018-12-01 20:11:52,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-01 20:11:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2018-12-01 20:11:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 3330. [2018-12-01 20:11:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2018-12-01 20:11:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 7833 transitions. [2018-12-01 20:11:52,876 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 7833 transitions. Word has length 102 [2018-12-01 20:11:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 20:11:52,876 INFO L480 AbstractCegarLoop]: Abstraction has 3330 states and 7833 transitions. [2018-12-01 20:11:52,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 20:11:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 7833 transitions. [2018-12-01 20:11:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 20:11:52,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 20:11:52,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:11:52,878 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 20:11:52,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:11:52,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1820697969, now seen corresponding path program 3 times [2018-12-01 20:11:52,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:11:52,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:11:52,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:52,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:11:52,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:11:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:11:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:11:52,914 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 20:11:52,983 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 20:11:52,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 08:11:52 BasicIcfg [2018-12-01 20:11:52,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 20:11:52,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 20:11:52,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 20:11:52,984 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 20:11:52,985 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:10:38" (3/4) ... [2018-12-01 20:11:52,986 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 20:11:53,059 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8ff56539-9910-437a-8fc8-6544c3f98d9c/bin-2019/uautomizer/witness.graphml [2018-12-01 20:11:53,059 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 20:11:53,060 INFO L168 Benchmark]: Toolchain (without parser) took 75221.16 ms. Allocated memory was 1.0 GB in the beginning and 7.0 GB in the end (delta: 6.0 GB). Free memory was 951.7 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-12-01 20:11:53,061 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 20:11:53,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -140.4 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-12-01 20:11:53,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 20:11:53,061 INFO L168 Benchmark]: Boogie Preprocessor took 19.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 20:11:53,061 INFO L168 Benchmark]: RCFGBuilder took 374.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2018-12-01 20:11:53,061 INFO L168 Benchmark]: TraceAbstraction took 74394.05 ms. Allocated memory was 1.1 GB in the beginning and 7.0 GB in the end (delta: 5.9 GB). Free memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-12-01 20:11:53,062 INFO L168 Benchmark]: Witness Printer took 75.21 ms. Allocated memory is still 7.0 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2018-12-01 20:11:53,063 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -140.4 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 374.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74394.05 ms. Allocated memory was 1.1 GB in the beginning and 7.0 GB in the end (delta: 5.9 GB). Free memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 75.21 ms. Allocated memory is still 7.0 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 pthread_t t1777; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] FCALL, FORK -1 pthread_create(&t1777, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 pthread_t t1778; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] FCALL, FORK -1 pthread_create(&t1778, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 y$w_buff1 = y$w_buff0 [L735] 0 y$w_buff0 = 1 [L736] 0 y$w_buff1_used = y$w_buff0_used [L737] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 0 y$r_buff0_thd2 = (_Bool)1 [L745] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 0 y$flush_delayed = weak$$choice2 [L748] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L750] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L751] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L755] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 0 y = y$flush_delayed ? y$mem_tmp : y [L758] 0 y$flush_delayed = (_Bool)0 [L761] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 1 x = 1 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 y$flush_delayed = weak$$choice2 [L712] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L714] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L715] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 1 y = y$flush_delayed ? y$mem_tmp : y [L722] 1 y$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 283 locations, 3 error locations. UNSAFE Result, 74.3s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 21.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10382 SDtfs, 12835 SDslu, 25738 SDs, 0 SdLazy, 10218 SolverSat, 614 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 70 SyntacticMatches, 27 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228356occurred in iteration=6, 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: 45.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 515396 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2220 NumberOfCodeBlocks, 2220 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2090 ConstructedInterpolants, 0 QuantifiedInterpolants, 455788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...