./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_tso.oepc_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_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/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 f826e25c8c31c46de95cdece910a51d666dafee4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 11:21:30,031 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:21:30,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:21:30,038 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:21:30,038 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:21:30,039 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:21:30,040 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:21:30,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:21:30,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:21:30,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:21:30,042 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:21:30,042 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:21:30,043 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:21:30,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:21:30,044 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:21:30,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:21:30,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:21:30,046 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:21:30,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:21:30,047 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:21:30,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:21:30,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:21:30,050 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:21:30,050 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:21:30,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:21:30,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:21:30,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:21:30,051 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:21:30,052 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:21:30,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:21:30,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:21:30,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:21:30,053 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:21:30,053 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:21:30,054 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:21:30,054 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:21:30,054 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 11:21:30,061 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:21:30,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:21:30,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:21:30,062 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:21:30,062 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:21:30,063 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:21:30,063 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 11:21:30,063 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:21:30,063 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:21:30,063 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:21:30,063 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:21:30,063 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:21:30,063 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 11:21:30,063 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:21:30,063 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 11:21:30,063 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:21:30,064 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:21:30,064 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 11:21:30,064 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 11:21:30,064 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:21:30,064 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:21:30,064 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:21:30,064 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:21:30,064 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:21:30,064 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:21:30,064 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:21:30,064 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 11:21:30,065 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 11:21:30,065 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:21:30,065 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 11:21:30,065 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_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/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 -> f826e25c8c31c46de95cdece910a51d666dafee4 [2018-12-09 11:21:30,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:21:30,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:21:30,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:21:30,093 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:21:30,093 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:21:30,094 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi008_tso.oepc_false-unreach-call.i [2018-12-09 11:21:30,128 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/bin-2019/uautomizer/data/fa42db608/2dfa501f7fd0435db367531fdd1ce51a/FLAGaa3af7131 [2018-12-09 11:21:30,608 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:21:30,608 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/sv-benchmarks/c/pthread-wmm/rfi008_tso.oepc_false-unreach-call.i [2018-12-09 11:21:30,617 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/bin-2019/uautomizer/data/fa42db608/2dfa501f7fd0435db367531fdd1ce51a/FLAGaa3af7131 [2018-12-09 11:21:31,113 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/bin-2019/uautomizer/data/fa42db608/2dfa501f7fd0435db367531fdd1ce51a [2018-12-09 11:21:31,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:21:31,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:21:31,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:21:31,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:21:31,119 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:21:31,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:21:31" (1/1) ... [2018-12-09 11:21:31,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e282df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31, skipping insertion in model container [2018-12-09 11:21:31,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:21:31" (1/1) ... [2018-12-09 11:21:31,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:21:31,154 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:21:31,350 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:21:31,358 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:21:31,463 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:21:31,494 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:21:31,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31 WrapperNode [2018-12-09 11:21:31,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:21:31,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:21:31,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:21:31,495 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:21:31,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31" (1/1) ... [2018-12-09 11:21:31,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31" (1/1) ... [2018-12-09 11:21:31,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:21:31,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:21:31,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:21:31,531 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:21:31,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31" (1/1) ... [2018-12-09 11:21:31,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31" (1/1) ... [2018-12-09 11:21:31,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31" (1/1) ... [2018-12-09 11:21:31,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31" (1/1) ... [2018-12-09 11:21:31,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31" (1/1) ... [2018-12-09 11:21:31,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31" (1/1) ... [2018-12-09 11:21:31,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31" (1/1) ... [2018-12-09 11:21:31,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:21:31,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:21:31,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:21:31,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:21:31,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/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-09 11:21:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:21:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 11:21:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 11:21:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:21:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 11:21:31,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 11:21:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 11:21:31,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 11:21:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 11:21:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:21:31,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:21:31,585 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 11:21:31,948 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:21:31,948 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 11:21:31,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:21:31 BoogieIcfgContainer [2018-12-09 11:21:31,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:21:31,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:21:31,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:21:31,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:21:31,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:21:31" (1/3) ... [2018-12-09 11:21:31,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579668b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:21:31, skipping insertion in model container [2018-12-09 11:21:31,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:21:31" (2/3) ... [2018-12-09 11:21:31,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579668b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:21:31, skipping insertion in model container [2018-12-09 11:21:31,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:21:31" (3/3) ... [2018-12-09 11:21:31,953 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008_tso.oepc_false-unreach-call.i [2018-12-09 11:21:31,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,979 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,979 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,979 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,979 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,979 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,991 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,991 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:31,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:21:32,006 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 11:21:32,006 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:21:32,011 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 11:21:32,021 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 11:21:32,036 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 11:21:32,036 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:21:32,036 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 11:21:32,036 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:21:32,037 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:21:32,037 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:21:32,037 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:21:32,037 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:21:32,037 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:21:32,044 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2018-12-09 11:21:39,707 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2018-12-09 11:21:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2018-12-09 11:21:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 11:21:39,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:21:39,714 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] [2018-12-09 11:21:39,716 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:21:39,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:21:39,720 INFO L82 PathProgramCache]: Analyzing trace with hash -513582767, now seen corresponding path program 1 times [2018-12-09 11:21:39,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:21:39,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:21:39,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:21:39,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:21:39,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:21:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:21:39,877 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-09 11:21:39,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:21:39,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:21:39,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:21:39,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:21:39,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:21:39,891 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2018-12-09 11:21:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:21:40,924 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2018-12-09 11:21:40,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:21:40,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-09 11:21:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:21:41,387 INFO L225 Difference]: With dead ends: 192000 [2018-12-09 11:21:41,387 INFO L226 Difference]: Without dead ends: 135832 [2018-12-09 11:21:41,388 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-09 11:21:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2018-12-09 11:21:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2018-12-09 11:21:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2018-12-09 11:21:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2018-12-09 11:21:45,541 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2018-12-09 11:21:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:21:45,541 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2018-12-09 11:21:45,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:21:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2018-12-09 11:21:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 11:21:45,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:21:45,547 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-09 11:21:45,547 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:21:45,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:21:45,547 INFO L82 PathProgramCache]: Analyzing trace with hash 133524022, now seen corresponding path program 1 times [2018-12-09 11:21:45,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:21:45,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:21:45,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:21:45,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:21:45,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:21:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:21:45,594 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-09 11:21:45,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:21:45,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:21:45,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:21:45,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:21:45,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:21:45,596 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 5 states. [2018-12-09 11:21:46,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:21:46,688 INFO L93 Difference]: Finished difference Result 195844 states and 748303 transitions. [2018-12-09 11:21:46,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:21:46,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 11:21:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:21:47,410 INFO L225 Difference]: With dead ends: 195844 [2018-12-09 11:21:47,410 INFO L226 Difference]: Without dead ends: 195292 [2018-12-09 11:21:47,410 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-09 11:21:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195292 states. [2018-12-09 11:21:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195292 to 123067. [2018-12-09 11:21:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123067 states. [2018-12-09 11:21:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123067 states to 123067 states and 470493 transitions. [2018-12-09 11:21:50,918 INFO L78 Accepts]: Start accepts. Automaton has 123067 states and 470493 transitions. Word has length 47 [2018-12-09 11:21:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:21:50,919 INFO L480 AbstractCegarLoop]: Abstraction has 123067 states and 470493 transitions. [2018-12-09 11:21:50,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:21:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 123067 states and 470493 transitions. [2018-12-09 11:21:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 11:21:50,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:21:50,923 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] [2018-12-09 11:21:50,924 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:21:50,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:21:50,924 INFO L82 PathProgramCache]: Analyzing trace with hash 84336861, now seen corresponding path program 1 times [2018-12-09 11:21:50,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:21:50,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:21:50,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:21:50,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:21:50,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:21:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:21:50,984 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-09 11:21:50,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:21:50,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:21:50,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:21:50,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:21:50,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:21:50,985 INFO L87 Difference]: Start difference. First operand 123067 states and 470493 transitions. Second operand 5 states. [2018-12-09 11:21:54,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:21:54,001 INFO L93 Difference]: Finished difference Result 253868 states and 961457 transitions. [2018-12-09 11:21:54,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:21:54,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-09 11:21:54,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:21:54,514 INFO L225 Difference]: With dead ends: 253868 [2018-12-09 11:21:54,514 INFO L226 Difference]: Without dead ends: 253356 [2018-12-09 11:21:54,514 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-09 11:21:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253356 states. [2018-12-09 11:21:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253356 to 135934. [2018-12-09 11:21:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135934 states. [2018-12-09 11:21:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135934 states to 135934 states and 515687 transitions. [2018-12-09 11:21:58,764 INFO L78 Accepts]: Start accepts. Automaton has 135934 states and 515687 transitions. Word has length 48 [2018-12-09 11:21:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:21:58,764 INFO L480 AbstractCegarLoop]: Abstraction has 135934 states and 515687 transitions. [2018-12-09 11:21:58,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:21:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 135934 states and 515687 transitions. [2018-12-09 11:21:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 11:21:58,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:21:58,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:21:58,773 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:21:58,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:21:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash 475594115, now seen corresponding path program 1 times [2018-12-09 11:21:58,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:21:58,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:21:58,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:21:58,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:21:58,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:21:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:21:58,803 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-09 11:21:58,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:21:58,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:21:58,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:21:58,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:21:58,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:21:58,804 INFO L87 Difference]: Start difference. First operand 135934 states and 515687 transitions. Second operand 3 states. [2018-12-09 11:21:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:21:59,757 INFO L93 Difference]: Finished difference Result 234162 states and 866041 transitions. [2018-12-09 11:21:59,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:21:59,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 11:21:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:00,276 INFO L225 Difference]: With dead ends: 234162 [2018-12-09 11:22:00,276 INFO L226 Difference]: Without dead ends: 234162 [2018-12-09 11:22:00,276 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-09 11:22:02,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234162 states. [2018-12-09 11:22:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234162 to 207903. [2018-12-09 11:22:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207903 states. [2018-12-09 11:22:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207903 states to 207903 states and 772292 transitions. [2018-12-09 11:22:05,567 INFO L78 Accepts]: Start accepts. Automaton has 207903 states and 772292 transitions. Word has length 50 [2018-12-09 11:22:05,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:05,568 INFO L480 AbstractCegarLoop]: Abstraction has 207903 states and 772292 transitions. [2018-12-09 11:22:05,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:22:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 207903 states and 772292 transitions. [2018-12-09 11:22:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 11:22:05,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:05,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:05,585 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:05,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:05,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1121194702, now seen corresponding path program 1 times [2018-12-09 11:22:05,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:05,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:05,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:05,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:05,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:05,637 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-09 11:22:05,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:05,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:22:05,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:22:05,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:22:05,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:22:05,638 INFO L87 Difference]: Start difference. First operand 207903 states and 772292 transitions. Second operand 6 states. [2018-12-09 11:22:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:07,732 INFO L93 Difference]: Finished difference Result 402833 states and 1473119 transitions. [2018-12-09 11:22:07,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 11:22:07,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-09 11:22:07,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:08,627 INFO L225 Difference]: With dead ends: 402833 [2018-12-09 11:22:08,627 INFO L226 Difference]: Without dead ends: 402257 [2018-12-09 11:22:08,628 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-09 11:22:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402257 states. [2018-12-09 11:22:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402257 to 208069. [2018-12-09 11:22:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208069 states. [2018-12-09 11:22:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208069 states to 208069 states and 773298 transitions. [2018-12-09 11:22:17,854 INFO L78 Accepts]: Start accepts. Automaton has 208069 states and 773298 transitions. Word has length 54 [2018-12-09 11:22:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:17,855 INFO L480 AbstractCegarLoop]: Abstraction has 208069 states and 773298 transitions. [2018-12-09 11:22:17,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:22:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 208069 states and 773298 transitions. [2018-12-09 11:22:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 11:22:17,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:17,870 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-09 11:22:17,870 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:17,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:17,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1930693029, now seen corresponding path program 1 times [2018-12-09 11:22:17,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:17,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:17,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:17,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:17,930 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-09 11:22:17,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:17,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:22:17,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:22:17,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:22:17,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:22:17,931 INFO L87 Difference]: Start difference. First operand 208069 states and 773298 transitions. Second operand 7 states. [2018-12-09 11:22:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:20,096 INFO L93 Difference]: Finished difference Result 325852 states and 1170129 transitions. [2018-12-09 11:22:20,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 11:22:20,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-09 11:22:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:20,805 INFO L225 Difference]: With dead ends: 325852 [2018-12-09 11:22:20,805 INFO L226 Difference]: Without dead ends: 325852 [2018-12-09 11:22:20,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:22:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325852 states. [2018-12-09 11:22:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325852 to 256642. [2018-12-09 11:22:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256642 states. [2018-12-09 11:22:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256642 states to 256642 states and 939283 transitions. [2018-12-09 11:22:29,777 INFO L78 Accepts]: Start accepts. Automaton has 256642 states and 939283 transitions. Word has length 54 [2018-12-09 11:22:29,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:29,778 INFO L480 AbstractCegarLoop]: Abstraction has 256642 states and 939283 transitions. [2018-12-09 11:22:29,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:22:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 256642 states and 939283 transitions. [2018-12-09 11:22:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 11:22:29,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:29,795 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-09 11:22:29,795 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:29,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:29,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1476770586, now seen corresponding path program 1 times [2018-12-09 11:22:29,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:29,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:29,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:29,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:29,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:29,822 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-09 11:22:29,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:29,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:22:29,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:22:29,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:22:29,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:22:29,823 INFO L87 Difference]: Start difference. First operand 256642 states and 939283 transitions. Second operand 3 states. [2018-12-09 11:22:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:30,621 INFO L93 Difference]: Finished difference Result 209798 states and 761087 transitions. [2018-12-09 11:22:30,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:22:30,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-09 11:22:30,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:31,052 INFO L225 Difference]: With dead ends: 209798 [2018-12-09 11:22:31,052 INFO L226 Difference]: Without dead ends: 209798 [2018-12-09 11:22:31,053 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-09 11:22:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209798 states. [2018-12-09 11:22:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209798 to 207253. [2018-12-09 11:22:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207253 states. [2018-12-09 11:22:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207253 states to 207253 states and 752339 transitions. [2018-12-09 11:22:36,313 INFO L78 Accepts]: Start accepts. Automaton has 207253 states and 752339 transitions. Word has length 54 [2018-12-09 11:22:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:36,313 INFO L480 AbstractCegarLoop]: Abstraction has 207253 states and 752339 transitions. [2018-12-09 11:22:36,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:22:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 207253 states and 752339 transitions. [2018-12-09 11:22:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 11:22:36,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:36,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:36,326 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:36,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:36,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1480801646, now seen corresponding path program 1 times [2018-12-09 11:22:36,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:36,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:36,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:36,371 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-09 11:22:36,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:36,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:22:36,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:22:36,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:22:36,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:22:36,372 INFO L87 Difference]: Start difference. First operand 207253 states and 752339 transitions. Second operand 4 states. [2018-12-09 11:22:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:36,469 INFO L93 Difference]: Finished difference Result 32822 states and 104262 transitions. [2018-12-09 11:22:36,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:22:36,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-09 11:22:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:36,502 INFO L225 Difference]: With dead ends: 32822 [2018-12-09 11:22:36,503 INFO L226 Difference]: Without dead ends: 24964 [2018-12-09 11:22:36,503 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-09 11:22:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24964 states. [2018-12-09 11:22:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24964 to 24717. [2018-12-09 11:22:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24717 states. [2018-12-09 11:22:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24717 states to 24717 states and 75708 transitions. [2018-12-09 11:22:36,785 INFO L78 Accepts]: Start accepts. Automaton has 24717 states and 75708 transitions. Word has length 55 [2018-12-09 11:22:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:36,785 INFO L480 AbstractCegarLoop]: Abstraction has 24717 states and 75708 transitions. [2018-12-09 11:22:36,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:22:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 24717 states and 75708 transitions. [2018-12-09 11:22:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 11:22:36,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:36,789 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] [2018-12-09 11:22:36,789 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:36,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:36,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1656702890, now seen corresponding path program 1 times [2018-12-09 11:22:36,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:36,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:36,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:36,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:36,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:22:36,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:36,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:22:36,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:22:36,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:22:36,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:22:36,828 INFO L87 Difference]: Start difference. First operand 24717 states and 75708 transitions. Second operand 4 states. [2018-12-09 11:22:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:36,943 INFO L93 Difference]: Finished difference Result 27155 states and 82977 transitions. [2018-12-09 11:22:36,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:22:36,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-09 11:22:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:36,978 INFO L225 Difference]: With dead ends: 27155 [2018-12-09 11:22:36,978 INFO L226 Difference]: Without dead ends: 27155 [2018-12-09 11:22:36,978 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-09 11:22:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27155 states. [2018-12-09 11:22:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27155 to 25562. [2018-12-09 11:22:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25562 states. [2018-12-09 11:22:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25562 states to 25562 states and 78203 transitions. [2018-12-09 11:22:37,287 INFO L78 Accepts]: Start accepts. Automaton has 25562 states and 78203 transitions. Word has length 62 [2018-12-09 11:22:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:37,287 INFO L480 AbstractCegarLoop]: Abstraction has 25562 states and 78203 transitions. [2018-12-09 11:22:37,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:22:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 25562 states and 78203 transitions. [2018-12-09 11:22:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 11:22:37,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:37,291 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] [2018-12-09 11:22:37,291 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:37,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash -895454071, now seen corresponding path program 1 times [2018-12-09 11:22:37,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:37,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:37,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:37,337 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-09 11:22:37,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:37,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:22:37,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:22:37,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:22:37,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:22:37,338 INFO L87 Difference]: Start difference. First operand 25562 states and 78203 transitions. Second operand 6 states. [2018-12-09 11:22:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:37,799 INFO L93 Difference]: Finished difference Result 53444 states and 162274 transitions. [2018-12-09 11:22:37,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 11:22:37,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 11:22:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:37,866 INFO L225 Difference]: With dead ends: 53444 [2018-12-09 11:22:37,866 INFO L226 Difference]: Without dead ends: 53373 [2018-12-09 11:22:37,867 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-09 11:22:37,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53373 states. [2018-12-09 11:22:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53373 to 32726. [2018-12-09 11:22:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32726 states. [2018-12-09 11:22:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32726 states to 32726 states and 98221 transitions. [2018-12-09 11:22:39,082 INFO L78 Accepts]: Start accepts. Automaton has 32726 states and 98221 transitions. Word has length 62 [2018-12-09 11:22:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:39,082 INFO L480 AbstractCegarLoop]: Abstraction has 32726 states and 98221 transitions. [2018-12-09 11:22:39,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:22:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 32726 states and 98221 transitions. [2018-12-09 11:22:39,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 11:22:39,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:39,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:39,089 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:39,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:39,089 INFO L82 PathProgramCache]: Analyzing trace with hash -191697734, now seen corresponding path program 1 times [2018-12-09 11:22:39,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:39,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:39,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:39,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:39,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:39,113 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-09 11:22:39,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:39,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:22:39,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:22:39,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:22:39,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:22:39,113 INFO L87 Difference]: Start difference. First operand 32726 states and 98221 transitions. Second operand 3 states. [2018-12-09 11:22:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:39,237 INFO L93 Difference]: Finished difference Result 40875 states and 121466 transitions. [2018-12-09 11:22:39,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:22:39,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-09 11:22:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:39,283 INFO L225 Difference]: With dead ends: 40875 [2018-12-09 11:22:39,283 INFO L226 Difference]: Without dead ends: 40875 [2018-12-09 11:22:39,284 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-09 11:22:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40875 states. [2018-12-09 11:22:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40875 to 33483. [2018-12-09 11:22:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33483 states. [2018-12-09 11:22:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33483 states to 33483 states and 98578 transitions. [2018-12-09 11:22:39,697 INFO L78 Accepts]: Start accepts. Automaton has 33483 states and 98578 transitions. Word has length 68 [2018-12-09 11:22:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:39,698 INFO L480 AbstractCegarLoop]: Abstraction has 33483 states and 98578 transitions. [2018-12-09 11:22:39,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:22:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 33483 states and 98578 transitions. [2018-12-09 11:22:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 11:22:39,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:39,706 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] [2018-12-09 11:22:39,707 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:39,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:39,707 INFO L82 PathProgramCache]: Analyzing trace with hash -690040115, now seen corresponding path program 1 times [2018-12-09 11:22:39,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:39,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:39,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:39,747 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-09 11:22:39,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:39,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:22:39,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:22:39,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:22:39,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:22:39,748 INFO L87 Difference]: Start difference. First operand 33483 states and 98578 transitions. Second operand 5 states. [2018-12-09 11:22:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:40,024 INFO L93 Difference]: Finished difference Result 38508 states and 113005 transitions. [2018-12-09 11:22:40,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:22:40,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-09 11:22:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:40,065 INFO L225 Difference]: With dead ends: 38508 [2018-12-09 11:22:40,066 INFO L226 Difference]: Without dead ends: 38508 [2018-12-09 11:22:40,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:22:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38508 states. [2018-12-09 11:22:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38508 to 36833. [2018-12-09 11:22:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36833 states. [2018-12-09 11:22:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36833 states to 36833 states and 108189 transitions. [2018-12-09 11:22:40,480 INFO L78 Accepts]: Start accepts. Automaton has 36833 states and 108189 transitions. Word has length 74 [2018-12-09 11:22:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:40,480 INFO L480 AbstractCegarLoop]: Abstraction has 36833 states and 108189 transitions. [2018-12-09 11:22:40,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:22:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 36833 states and 108189 transitions. [2018-12-09 11:22:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 11:22:40,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:40,488 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] [2018-12-09 11:22:40,488 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:40,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:40,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1052770220, now seen corresponding path program 1 times [2018-12-09 11:22:40,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:40,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:40,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:40,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:40,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:22:40,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:40,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:22:40,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:22:40,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:22:40,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:22:40,541 INFO L87 Difference]: Start difference. First operand 36833 states and 108189 transitions. Second operand 7 states. [2018-12-09 11:22:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:41,096 INFO L93 Difference]: Finished difference Result 44363 states and 130601 transitions. [2018-12-09 11:22:41,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 11:22:41,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-09 11:22:41,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:41,145 INFO L225 Difference]: With dead ends: 44363 [2018-12-09 11:22:41,145 INFO L226 Difference]: Without dead ends: 44276 [2018-12-09 11:22:41,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 11:22:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44276 states. [2018-12-09 11:22:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44276 to 33054. [2018-12-09 11:22:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33054 states. [2018-12-09 11:22:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33054 states to 33054 states and 98260 transitions. [2018-12-09 11:22:41,618 INFO L78 Accepts]: Start accepts. Automaton has 33054 states and 98260 transitions. Word has length 74 [2018-12-09 11:22:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:41,618 INFO L480 AbstractCegarLoop]: Abstraction has 33054 states and 98260 transitions. [2018-12-09 11:22:41,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:22:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 33054 states and 98260 transitions. [2018-12-09 11:22:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 11:22:41,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:41,627 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] [2018-12-09 11:22:41,627 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:41,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:41,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1736865076, now seen corresponding path program 1 times [2018-12-09 11:22:41,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:41,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:41,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:41,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:41,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:41,687 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-09 11:22:41,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:41,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:22:41,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:22:41,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:22:41,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:22:41,687 INFO L87 Difference]: Start difference. First operand 33054 states and 98260 transitions. Second operand 7 states. [2018-12-09 11:22:42,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:42,349 INFO L93 Difference]: Finished difference Result 73264 states and 216100 transitions. [2018-12-09 11:22:42,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 11:22:42,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-09 11:22:42,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:42,437 INFO L225 Difference]: With dead ends: 73264 [2018-12-09 11:22:42,437 INFO L226 Difference]: Without dead ends: 73200 [2018-12-09 11:22:42,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-12-09 11:22:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73200 states. [2018-12-09 11:22:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73200 to 42473. [2018-12-09 11:22:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42473 states. [2018-12-09 11:22:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42473 states to 42473 states and 124402 transitions. [2018-12-09 11:22:43,062 INFO L78 Accepts]: Start accepts. Automaton has 42473 states and 124402 transitions. Word has length 76 [2018-12-09 11:22:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:43,063 INFO L480 AbstractCegarLoop]: Abstraction has 42473 states and 124402 transitions. [2018-12-09 11:22:43,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:22:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 42473 states and 124402 transitions. [2018-12-09 11:22:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 11:22:43,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:43,081 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] [2018-12-09 11:22:43,081 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:43,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:43,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1584283171, now seen corresponding path program 1 times [2018-12-09 11:22:43,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:43,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:43,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:43,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:43,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:22:43,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:43,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:22:43,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:22:43,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:22:43,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:22:43,121 INFO L87 Difference]: Start difference. First operand 42473 states and 124402 transitions. Second operand 4 states. [2018-12-09 11:22:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:43,282 INFO L93 Difference]: Finished difference Result 47450 states and 136404 transitions. [2018-12-09 11:22:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:22:43,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-09 11:22:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:43,336 INFO L225 Difference]: With dead ends: 47450 [2018-12-09 11:22:43,336 INFO L226 Difference]: Without dead ends: 47450 [2018-12-09 11:22:43,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:22:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47450 states. [2018-12-09 11:22:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47450 to 43792. [2018-12-09 11:22:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43792 states. [2018-12-09 11:22:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43792 states to 43792 states and 125556 transitions. [2018-12-09 11:22:43,857 INFO L78 Accepts]: Start accepts. Automaton has 43792 states and 125556 transitions. Word has length 83 [2018-12-09 11:22:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:43,857 INFO L480 AbstractCegarLoop]: Abstraction has 43792 states and 125556 transitions. [2018-12-09 11:22:43,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:22:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 43792 states and 125556 transitions. [2018-12-09 11:22:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 11:22:43,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:43,873 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] [2018-12-09 11:22:43,873 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:43,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1366691952, now seen corresponding path program 1 times [2018-12-09 11:22:43,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:43,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:43,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:43,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:43,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:43,903 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-09 11:22:43,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:43,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:22:43,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:22:43,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:22:43,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:22:43,904 INFO L87 Difference]: Start difference. First operand 43792 states and 125556 transitions. Second operand 4 states. [2018-12-09 11:22:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:44,355 INFO L93 Difference]: Finished difference Result 51886 states and 146275 transitions. [2018-12-09 11:22:44,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:22:44,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-12-09 11:22:44,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:44,407 INFO L225 Difference]: With dead ends: 51886 [2018-12-09 11:22:44,407 INFO L226 Difference]: Without dead ends: 51886 [2018-12-09 11:22:44,407 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-09 11:22:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51886 states. [2018-12-09 11:22:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51886 to 49652. [2018-12-09 11:22:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49652 states. [2018-12-09 11:22:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49652 states to 49652 states and 140792 transitions. [2018-12-09 11:22:44,954 INFO L78 Accepts]: Start accepts. Automaton has 49652 states and 140792 transitions. Word has length 84 [2018-12-09 11:22:44,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:44,954 INFO L480 AbstractCegarLoop]: Abstraction has 49652 states and 140792 transitions. [2018-12-09 11:22:44,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:22:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 49652 states and 140792 transitions. [2018-12-09 11:22:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 11:22:44,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:44,972 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] [2018-12-09 11:22:44,972 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:44,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash 851066001, now seen corresponding path program 1 times [2018-12-09 11:22:44,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:44,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:44,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:44,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:44,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:45,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-09 11:22:45,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:45,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:22:45,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:22:45,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:22:45,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:22:45,020 INFO L87 Difference]: Start difference. First operand 49652 states and 140792 transitions. Second operand 5 states. [2018-12-09 11:22:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:45,078 INFO L93 Difference]: Finished difference Result 22000 states and 53993 transitions. [2018-12-09 11:22:45,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:22:45,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-12-09 11:22:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:45,093 INFO L225 Difference]: With dead ends: 22000 [2018-12-09 11:22:45,093 INFO L226 Difference]: Without dead ends: 20041 [2018-12-09 11:22:45,094 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-09 11:22:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20041 states. [2018-12-09 11:22:45,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20041 to 16787. [2018-12-09 11:22:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16787 states. [2018-12-09 11:22:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16787 states to 16787 states and 41093 transitions. [2018-12-09 11:22:45,249 INFO L78 Accepts]: Start accepts. Automaton has 16787 states and 41093 transitions. Word has length 84 [2018-12-09 11:22:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:45,249 INFO L480 AbstractCegarLoop]: Abstraction has 16787 states and 41093 transitions. [2018-12-09 11:22:45,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:22:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 16787 states and 41093 transitions. [2018-12-09 11:22:45,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:45,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:45,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:45,261 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:45,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:45,261 INFO L82 PathProgramCache]: Analyzing trace with hash -143937600, now seen corresponding path program 1 times [2018-12-09 11:22:45,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:45,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:45,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:45,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:45,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:45,314 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-09 11:22:45,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:45,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:22:45,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:22:45,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:22:45,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:22:45,315 INFO L87 Difference]: Start difference. First operand 16787 states and 41093 transitions. Second operand 5 states. [2018-12-09 11:22:45,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:45,402 INFO L93 Difference]: Finished difference Result 19597 states and 47367 transitions. [2018-12-09 11:22:45,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:22:45,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2018-12-09 11:22:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:45,416 INFO L225 Difference]: With dead ends: 19597 [2018-12-09 11:22:45,416 INFO L226 Difference]: Without dead ends: 19597 [2018-12-09 11:22:45,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:22:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19597 states. [2018-12-09 11:22:45,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19597 to 15476. [2018-12-09 11:22:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15476 states. [2018-12-09 11:22:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15476 states to 15476 states and 37384 transitions. [2018-12-09 11:22:45,562 INFO L78 Accepts]: Start accepts. Automaton has 15476 states and 37384 transitions. Word has length 113 [2018-12-09 11:22:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:45,562 INFO L480 AbstractCegarLoop]: Abstraction has 15476 states and 37384 transitions. [2018-12-09 11:22:45,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:22:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 15476 states and 37384 transitions. [2018-12-09 11:22:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:45,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:45,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 11:22:45,601 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:45,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:45,601 INFO L82 PathProgramCache]: Analyzing trace with hash -123600225, now seen corresponding path program 1 times [2018-12-09 11:22:45,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:45,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:45,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:45,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:45,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:45,638 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-09 11:22:45,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:45,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:22:45,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:22:45,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:22:45,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:22:45,639 INFO L87 Difference]: Start difference. First operand 15476 states and 37384 transitions. Second operand 5 states. [2018-12-09 11:22:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:45,968 INFO L93 Difference]: Finished difference Result 18394 states and 44376 transitions. [2018-12-09 11:22:45,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:22:45,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2018-12-09 11:22:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:45,982 INFO L225 Difference]: With dead ends: 18394 [2018-12-09 11:22:45,982 INFO L226 Difference]: Without dead ends: 18380 [2018-12-09 11:22:45,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:22:46,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2018-12-09 11:22:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16712. [2018-12-09 11:22:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16712 states. [2018-12-09 11:22:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16712 states to 16712 states and 40590 transitions. [2018-12-09 11:22:46,130 INFO L78 Accepts]: Start accepts. Automaton has 16712 states and 40590 transitions. Word has length 113 [2018-12-09 11:22:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:46,130 INFO L480 AbstractCegarLoop]: Abstraction has 16712 states and 40590 transitions. [2018-12-09 11:22:46,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:22:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 16712 states and 40590 transitions. [2018-12-09 11:22:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:46,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:46,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:46,143 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:46,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:46,143 INFO L82 PathProgramCache]: Analyzing trace with hash -172499590, now seen corresponding path program 1 times [2018-12-09 11:22:46,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:46,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:46,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:46,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:46,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:22:46,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:46,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 11:22:46,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 11:22:46,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:22:46,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:22:46,313 INFO L87 Difference]: Start difference. First operand 16712 states and 40590 transitions. Second operand 10 states. [2018-12-09 11:22:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:46,919 INFO L93 Difference]: Finished difference Result 25371 states and 59279 transitions. [2018-12-09 11:22:46,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 11:22:46,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-09 11:22:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:46,938 INFO L225 Difference]: With dead ends: 25371 [2018-12-09 11:22:46,938 INFO L226 Difference]: Without dead ends: 25371 [2018-12-09 11:22:46,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2018-12-09 11:22:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25371 states. [2018-12-09 11:22:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25371 to 21705. [2018-12-09 11:22:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21705 states. [2018-12-09 11:22:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21705 states to 21705 states and 51438 transitions. [2018-12-09 11:22:47,143 INFO L78 Accepts]: Start accepts. Automaton has 21705 states and 51438 transitions. Word has length 113 [2018-12-09 11:22:47,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:47,143 INFO L480 AbstractCegarLoop]: Abstraction has 21705 states and 51438 transitions. [2018-12-09 11:22:47,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 11:22:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 21705 states and 51438 transitions. [2018-12-09 11:22:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:47,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:47,160 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:47,160 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:47,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1009590368, now seen corresponding path program 1 times [2018-12-09 11:22:47,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:47,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:47,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:47,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:47,212 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-09 11:22:47,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:47,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:22:47,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:22:47,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:22:47,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:22:47,213 INFO L87 Difference]: Start difference. First operand 21705 states and 51438 transitions. Second operand 4 states. [2018-12-09 11:22:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:47,345 INFO L93 Difference]: Finished difference Result 23713 states and 55860 transitions. [2018-12-09 11:22:47,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:22:47,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-09 11:22:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:47,361 INFO L225 Difference]: With dead ends: 23713 [2018-12-09 11:22:47,361 INFO L226 Difference]: Without dead ends: 23693 [2018-12-09 11:22:47,362 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-09 11:22:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23693 states. [2018-12-09 11:22:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23693 to 22563. [2018-12-09 11:22:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22563 states. [2018-12-09 11:22:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22563 states to 22563 states and 53386 transitions. [2018-12-09 11:22:47,563 INFO L78 Accepts]: Start accepts. Automaton has 22563 states and 53386 transitions. Word has length 113 [2018-12-09 11:22:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:47,564 INFO L480 AbstractCegarLoop]: Abstraction has 22563 states and 53386 transitions. [2018-12-09 11:22:47,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:22:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 22563 states and 53386 transitions. [2018-12-09 11:22:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:47,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:47,582 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:47,582 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:47,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:47,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2040612447, now seen corresponding path program 1 times [2018-12-09 11:22:47,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:47,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:47,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:47,659 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-09 11:22:47,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:47,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:22:47,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:22:47,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:22:47,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:22:47,659 INFO L87 Difference]: Start difference. First operand 22563 states and 53386 transitions. Second operand 7 states. [2018-12-09 11:22:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:47,953 INFO L93 Difference]: Finished difference Result 31735 states and 73323 transitions. [2018-12-09 11:22:47,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:22:47,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 11:22:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:47,977 INFO L225 Difference]: With dead ends: 31735 [2018-12-09 11:22:47,977 INFO L226 Difference]: Without dead ends: 31704 [2018-12-09 11:22:47,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:22:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31704 states. [2018-12-09 11:22:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31704 to 27494. [2018-12-09 11:22:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27494 states. [2018-12-09 11:22:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27494 states to 27494 states and 63776 transitions. [2018-12-09 11:22:48,255 INFO L78 Accepts]: Start accepts. Automaton has 27494 states and 63776 transitions. Word has length 113 [2018-12-09 11:22:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:48,255 INFO L480 AbstractCegarLoop]: Abstraction has 27494 states and 63776 transitions. [2018-12-09 11:22:48,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:22:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27494 states and 63776 transitions. [2018-12-09 11:22:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:48,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:48,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:48,276 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:48,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash 177145506, now seen corresponding path program 1 times [2018-12-09 11:22:48,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:48,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:48,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:48,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:48,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:48,389 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-09 11:22:48,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:48,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:22:48,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:22:48,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:22:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:22:48,390 INFO L87 Difference]: Start difference. First operand 27494 states and 63776 transitions. Second operand 8 states. [2018-12-09 11:22:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:49,461 INFO L93 Difference]: Finished difference Result 34345 states and 79026 transitions. [2018-12-09 11:22:49,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 11:22:49,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 11:22:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:49,485 INFO L225 Difference]: With dead ends: 34345 [2018-12-09 11:22:49,485 INFO L226 Difference]: Without dead ends: 34345 [2018-12-09 11:22:49,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-09 11:22:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34345 states. [2018-12-09 11:22:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34345 to 31008. [2018-12-09 11:22:49,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31008 states. [2018-12-09 11:22:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31008 states to 31008 states and 71866 transitions. [2018-12-09 11:22:49,790 INFO L78 Accepts]: Start accepts. Automaton has 31008 states and 71866 transitions. Word has length 113 [2018-12-09 11:22:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:49,791 INFO L480 AbstractCegarLoop]: Abstraction has 31008 states and 71866 transitions. [2018-12-09 11:22:49,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:22:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31008 states and 71866 transitions. [2018-12-09 11:22:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:49,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:49,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:49,814 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:49,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:49,814 INFO L82 PathProgramCache]: Analyzing trace with hash 388496419, now seen corresponding path program 1 times [2018-12-09 11:22:49,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:49,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:49,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:49,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:49,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:49,853 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-09 11:22:49,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:49,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:22:49,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:22:49,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:22:49,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:22:49,854 INFO L87 Difference]: Start difference. First operand 31008 states and 71866 transitions. Second operand 3 states. [2018-12-09 11:22:49,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:49,932 INFO L93 Difference]: Finished difference Result 40201 states and 92482 transitions. [2018-12-09 11:22:49,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:22:49,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-09 11:22:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:49,963 INFO L225 Difference]: With dead ends: 40201 [2018-12-09 11:22:49,963 INFO L226 Difference]: Without dead ends: 40201 [2018-12-09 11:22:49,964 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-09 11:22:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40201 states. [2018-12-09 11:22:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40201 to 39802. [2018-12-09 11:22:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39802 states. [2018-12-09 11:22:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39802 states to 39802 states and 91600 transitions. [2018-12-09 11:22:50,316 INFO L78 Accepts]: Start accepts. Automaton has 39802 states and 91600 transitions. Word has length 113 [2018-12-09 11:22:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:50,316 INFO L480 AbstractCegarLoop]: Abstraction has 39802 states and 91600 transitions. [2018-12-09 11:22:50,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:22:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 39802 states and 91600 transitions. [2018-12-09 11:22:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:50,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:50,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:50,345 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:50,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:50,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2113977316, now seen corresponding path program 1 times [2018-12-09 11:22:50,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:50,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:50,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:50,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:50,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:50,412 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-09 11:22:50,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:50,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:22:50,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:22:50,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:22:50,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:22:50,413 INFO L87 Difference]: Start difference. First operand 39802 states and 91600 transitions. Second operand 7 states. [2018-12-09 11:22:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:50,577 INFO L93 Difference]: Finished difference Result 44479 states and 101392 transitions. [2018-12-09 11:22:50,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:22:50,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 11:22:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:50,611 INFO L225 Difference]: With dead ends: 44479 [2018-12-09 11:22:50,611 INFO L226 Difference]: Without dead ends: 44479 [2018-12-09 11:22:50,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:22:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44479 states. [2018-12-09 11:22:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44479 to 39582. [2018-12-09 11:22:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39582 states. [2018-12-09 11:22:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39582 states to 39582 states and 90900 transitions. [2018-12-09 11:22:50,988 INFO L78 Accepts]: Start accepts. Automaton has 39582 states and 90900 transitions. Word has length 113 [2018-12-09 11:22:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:50,988 INFO L480 AbstractCegarLoop]: Abstraction has 39582 states and 90900 transitions. [2018-12-09 11:22:50,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:22:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 39582 states and 90900 transitions. [2018-12-09 11:22:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:51,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:51,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:51,016 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:51,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1913942530, now seen corresponding path program 1 times [2018-12-09 11:22:51,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:51,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:51,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:51,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:51,081 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-09 11:22:51,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:51,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:22:51,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:22:51,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:22:51,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:22:51,081 INFO L87 Difference]: Start difference. First operand 39582 states and 90900 transitions. Second operand 7 states. [2018-12-09 11:22:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:51,477 INFO L93 Difference]: Finished difference Result 49020 states and 110509 transitions. [2018-12-09 11:22:51,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 11:22:51,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 11:22:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:51,512 INFO L225 Difference]: With dead ends: 49020 [2018-12-09 11:22:51,512 INFO L226 Difference]: Without dead ends: 49020 [2018-12-09 11:22:51,512 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-09 11:22:51,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49020 states. [2018-12-09 11:22:51,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49020 to 41218. [2018-12-09 11:22:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41218 states. [2018-12-09 11:22:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41218 states to 41218 states and 93774 transitions. [2018-12-09 11:22:51,922 INFO L78 Accepts]: Start accepts. Automaton has 41218 states and 93774 transitions. Word has length 113 [2018-12-09 11:22:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:51,923 INFO L480 AbstractCegarLoop]: Abstraction has 41218 states and 93774 transitions. [2018-12-09 11:22:51,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:22:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 41218 states and 93774 transitions. [2018-12-09 11:22:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:51,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:51,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:51,952 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:51,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:51,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2125293443, now seen corresponding path program 1 times [2018-12-09 11:22:51,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:51,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:51,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:51,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:51,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:52,053 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-09 11:22:52,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:52,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:22:52,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:22:52,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:22:52,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:22:52,053 INFO L87 Difference]: Start difference. First operand 41218 states and 93774 transitions. Second operand 7 states. [2018-12-09 11:22:52,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:52,276 INFO L93 Difference]: Finished difference Result 42748 states and 97010 transitions. [2018-12-09 11:22:52,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:22:52,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 11:22:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:52,308 INFO L225 Difference]: With dead ends: 42748 [2018-12-09 11:22:52,308 INFO L226 Difference]: Without dead ends: 42748 [2018-12-09 11:22:52,308 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-09 11:22:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42748 states. [2018-12-09 11:22:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42748 to 41656. [2018-12-09 11:22:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41656 states. [2018-12-09 11:22:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41656 states to 41656 states and 94781 transitions. [2018-12-09 11:22:52,679 INFO L78 Accepts]: Start accepts. Automaton has 41656 states and 94781 transitions. Word has length 113 [2018-12-09 11:22:52,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:52,680 INFO L480 AbstractCegarLoop]: Abstraction has 41656 states and 94781 transitions. [2018-12-09 11:22:52,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:22:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 41656 states and 94781 transitions. [2018-12-09 11:22:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:52,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:52,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:52,710 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:52,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1282170172, now seen corresponding path program 1 times [2018-12-09 11:22:52,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:52,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:52,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:52,786 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-09 11:22:52,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:52,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:22:52,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:22:52,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:22:52,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:22:52,786 INFO L87 Difference]: Start difference. First operand 41656 states and 94781 transitions. Second operand 8 states. [2018-12-09 11:22:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:53,197 INFO L93 Difference]: Finished difference Result 49333 states and 111431 transitions. [2018-12-09 11:22:53,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:22:53,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 11:22:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:53,237 INFO L225 Difference]: With dead ends: 49333 [2018-12-09 11:22:53,237 INFO L226 Difference]: Without dead ends: 49333 [2018-12-09 11:22:53,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-09 11:22:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49333 states. [2018-12-09 11:22:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49333 to 42948. [2018-12-09 11:22:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42948 states. [2018-12-09 11:22:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42948 states to 42948 states and 97552 transitions. [2018-12-09 11:22:53,645 INFO L78 Accepts]: Start accepts. Automaton has 42948 states and 97552 transitions. Word has length 113 [2018-12-09 11:22:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:53,645 INFO L480 AbstractCegarLoop]: Abstraction has 42948 states and 97552 transitions. [2018-12-09 11:22:53,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:22:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 42948 states and 97552 transitions. [2018-12-09 11:22:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:53,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:53,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:53,676 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:53,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:53,676 INFO L82 PathProgramCache]: Analyzing trace with hash -517283510, now seen corresponding path program 2 times [2018-12-09 11:22:53,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:53,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:53,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:53,754 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-09 11:22:53,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:53,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:22:53,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:22:53,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:22:53,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:22:53,754 INFO L87 Difference]: Start difference. First operand 42948 states and 97552 transitions. Second operand 8 states. [2018-12-09 11:22:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:54,488 INFO L93 Difference]: Finished difference Result 51746 states and 117038 transitions. [2018-12-09 11:22:54,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:22:54,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 11:22:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:54,531 INFO L225 Difference]: With dead ends: 51746 [2018-12-09 11:22:54,531 INFO L226 Difference]: Without dead ends: 51746 [2018-12-09 11:22:54,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-09 11:22:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51746 states. [2018-12-09 11:22:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51746 to 41173. [2018-12-09 11:22:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41173 states. [2018-12-09 11:22:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41173 states to 41173 states and 93573 transitions. [2018-12-09 11:22:54,952 INFO L78 Accepts]: Start accepts. Automaton has 41173 states and 93573 transitions. Word has length 113 [2018-12-09 11:22:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:54,952 INFO L480 AbstractCegarLoop]: Abstraction has 41173 states and 93573 transitions. [2018-12-09 11:22:54,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:22:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 41173 states and 93573 transitions. [2018-12-09 11:22:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:54,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:54,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:54,983 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:54,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:54,983 INFO L82 PathProgramCache]: Analyzing trace with hash -835478879, now seen corresponding path program 1 times [2018-12-09 11:22:54,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:54,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:54,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:54,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:22:54,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:55,075 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-09 11:22:55,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:55,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:22:55,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:22:55,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:22:55,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:22:55,076 INFO L87 Difference]: Start difference. First operand 41173 states and 93573 transitions. Second operand 8 states. [2018-12-09 11:22:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:56,119 INFO L93 Difference]: Finished difference Result 57102 states and 129961 transitions. [2018-12-09 11:22:56,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 11:22:56,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 11:22:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:56,174 INFO L225 Difference]: With dead ends: 57102 [2018-12-09 11:22:56,175 INFO L226 Difference]: Without dead ends: 57102 [2018-12-09 11:22:56,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-09 11:22:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57102 states. [2018-12-09 11:22:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57102 to 40788. [2018-12-09 11:22:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40788 states. [2018-12-09 11:22:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40788 states to 40788 states and 92755 transitions. [2018-12-09 11:22:56,639 INFO L78 Accepts]: Start accepts. Automaton has 40788 states and 92755 transitions. Word has length 113 [2018-12-09 11:22:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:56,640 INFO L480 AbstractCegarLoop]: Abstraction has 40788 states and 92755 transitions. [2018-12-09 11:22:56,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:22:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 40788 states and 92755 transitions. [2018-12-09 11:22:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:22:56,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:56,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:56,669 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:56,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:56,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1632202250, now seen corresponding path program 3 times [2018-12-09 11:22:56,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:56,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:56,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:56,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:56,719 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-09 11:22:56,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:56,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:22:56,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:22:56,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:22:56,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:22:56,720 INFO L87 Difference]: Start difference. First operand 40788 states and 92755 transitions. Second operand 6 states. [2018-12-09 11:22:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:57,027 INFO L93 Difference]: Finished difference Result 46201 states and 104047 transitions. [2018-12-09 11:22:57,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:22:57,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-09 11:22:57,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:57,062 INFO L225 Difference]: With dead ends: 46201 [2018-12-09 11:22:57,062 INFO L226 Difference]: Without dead ends: 46181 [2018-12-09 11:22:57,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:22:57,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46181 states. [2018-12-09 11:22:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46181 to 41301. [2018-12-09 11:22:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41301 states. [2018-12-09 11:22:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41301 states to 41301 states and 93806 transitions. [2018-12-09 11:22:57,460 INFO L78 Accepts]: Start accepts. Automaton has 41301 states and 93806 transitions. Word has length 113 [2018-12-09 11:22:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:57,460 INFO L480 AbstractCegarLoop]: Abstraction has 41301 states and 93806 transitions. [2018-12-09 11:22:57,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:22:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 41301 states and 93806 transitions. [2018-12-09 11:22:57,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 11:22:57,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:57,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:57,490 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:57,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:57,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1618364905, now seen corresponding path program 1 times [2018-12-09 11:22:57,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:57,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:57,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:22:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:57,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-09 11:22:57,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:57,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 11:22:57,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 11:22:57,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 11:22:57,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:22:57,669 INFO L87 Difference]: Start difference. First operand 41301 states and 93806 transitions. Second operand 14 states. [2018-12-09 11:22:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:58,103 INFO L93 Difference]: Finished difference Result 69626 states and 158138 transitions. [2018-12-09 11:22:58,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 11:22:58,104 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2018-12-09 11:22:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:58,153 INFO L225 Difference]: With dead ends: 69626 [2018-12-09 11:22:58,153 INFO L226 Difference]: Without dead ends: 57326 [2018-12-09 11:22:58,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-12-09 11:22:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57326 states. [2018-12-09 11:22:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57326 to 46406. [2018-12-09 11:22:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46406 states. [2018-12-09 11:22:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46406 states to 46406 states and 104918 transitions. [2018-12-09 11:22:58,619 INFO L78 Accepts]: Start accepts. Automaton has 46406 states and 104918 transitions. Word has length 115 [2018-12-09 11:22:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:58,619 INFO L480 AbstractCegarLoop]: Abstraction has 46406 states and 104918 transitions. [2018-12-09 11:22:58,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 11:22:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 46406 states and 104918 transitions. [2018-12-09 11:22:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 11:22:58,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:58,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 11:22:58,652 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:58,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:58,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1652705303, now seen corresponding path program 2 times [2018-12-09 11:22:58,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:58,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:58,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:58,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:22:58,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:22:58,707 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-09 11:22:58,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:22:58,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:22:58,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:22:58,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:22:58,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:22:58,707 INFO L87 Difference]: Start difference. First operand 46406 states and 104918 transitions. Second operand 7 states. [2018-12-09 11:22:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:22:58,847 INFO L93 Difference]: Finished difference Result 49974 states and 113511 transitions. [2018-12-09 11:22:58,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:22:58,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-09 11:22:58,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:22:58,852 INFO L225 Difference]: With dead ends: 49974 [2018-12-09 11:22:58,852 INFO L226 Difference]: Without dead ends: 7529 [2018-12-09 11:22:58,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-09 11:22:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7529 states. [2018-12-09 11:22:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7529 to 7529. [2018-12-09 11:22:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7529 states. [2018-12-09 11:22:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7529 states to 7529 states and 17643 transitions. [2018-12-09 11:22:58,905 INFO L78 Accepts]: Start accepts. Automaton has 7529 states and 17643 transitions. Word has length 115 [2018-12-09 11:22:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:22:58,906 INFO L480 AbstractCegarLoop]: Abstraction has 7529 states and 17643 transitions. [2018-12-09 11:22:58,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:22:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 7529 states and 17643 transitions. [2018-12-09 11:22:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 11:22:58,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:22:58,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:22:58,911 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:22:58,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:22:58,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1850450446, now seen corresponding path program 1 times [2018-12-09 11:22:58,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:22:58,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:22:58,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:58,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:22:58,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:22:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:22:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:22:58,961 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 11:22:59,061 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 11:22:59,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:22:59 BasicIcfg [2018-12-09 11:22:59,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:22:59,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:22:59,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:22:59,063 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:22:59,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:21:31" (3/4) ... [2018-12-09 11:22:59,065 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 11:22:59,150 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9ba0fbc1-5da0-4e01-bcaf-885cc6d6775d/bin-2019/uautomizer/witness.graphml [2018-12-09 11:22:59,150 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:22:59,150 INFO L168 Benchmark]: Toolchain (without parser) took 88035.22 ms. Allocated memory was 1.0 GB in the beginning and 6.6 GB in the end (delta: 5.6 GB). Free memory was 956.0 MB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-09 11:22:59,151 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:22:59,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-09 11:22:59,152 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.71 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-09 11:22:59,152 INFO L168 Benchmark]: Boogie Preprocessor took 20.95 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-09 11:22:59,152 INFO L168 Benchmark]: RCFGBuilder took 396.91 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: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2018-12-09 11:22:59,152 INFO L168 Benchmark]: TraceAbstraction took 87113.93 ms. Allocated memory was 1.1 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-09 11:22:59,152 INFO L168 Benchmark]: Witness Printer took 86.76 ms. Allocated memory is still 6.6 GB. Free memory was 5.0 GB in the beginning and 5.0 GB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2018-12-09 11:22:59,153 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.71 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 20.95 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 396.91 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: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 87113.93 ms. Allocated memory was 1.1 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 86.76 ms. Allocated memory is still 6.6 GB. Free memory was 5.0 GB in the beginning and 5.0 GB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] -1 pthread_t t1735; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK -1 pthread_create(&t1735, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] -1 pthread_t t1736; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L797] FCALL, FORK -1 pthread_create(&t1736, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$w_buff1 = x$w_buff0 [L707] 0 x$w_buff0 = 1 [L708] 0 x$w_buff1_used = x$w_buff0_used [L709] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L711] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L712] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L713] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L714] 0 x$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 x$flush_delayed = weak$$choice2 [L720] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L722] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L723] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L724] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L725] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 0 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L727] EXPR 0 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 0 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 x = x$flush_delayed ? x$mem_tmp : x [L730] 0 x$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 y = 1 [L753] 1 __unbuffered_p1_EAX = y [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L773] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L773] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L774] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L743] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L804] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L805] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L805] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L806] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L807] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L807] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 87.0s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 25.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14340 SDtfs, 16700 SDslu, 37797 SDs, 0 SdLazy, 12257 SolverSat, 790 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 88 SyntacticMatches, 30 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256642occurred 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: 50.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 704656 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2991 NumberOfCodeBlocks, 2991 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2843 ConstructedInterpolants, 0 QuantifiedInterpolants, 742315 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...