./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/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 0b368f0ce895b7ff7a5624a321c593cd8167db8d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0cd3be1 [2018-11-28 11:21:40,132 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:21:40,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:21:40,144 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:21:40,144 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:21:40,145 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:21:40,146 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:21:40,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:21:40,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:21:40,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:21:40,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:21:40,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:21:40,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:21:40,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:21:40,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:21:40,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:21:40,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:21:40,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:21:40,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:21:40,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:21:40,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:21:40,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:21:40,165 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:21:40,165 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:21:40,165 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:21:40,166 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:21:40,167 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:21:40,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:21:40,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:21:40,169 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:21:40,170 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:21:40,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:21:40,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:21:40,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:21:40,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:21:40,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:21:40,173 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:21:40,185 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:21:40,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:21:40,186 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:21:40,187 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:21:40,187 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:21:40,187 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:21:40,188 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:21:40,188 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:21:40,188 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:21:40,188 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:21:40,188 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:21:40,188 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:21:40,189 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:21:40,189 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:21:40,189 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:21:40,189 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:21:40,189 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:21:40,189 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:21:40,190 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:21:40,192 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:21:40,192 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:21:40,192 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:21:40,193 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:21:40,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:21:40,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:21:40,194 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:21:40,194 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:21:40,194 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:21:40,194 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:21:40,195 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:21:40,195 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_00fe55b9-7484-4da8-a2e5-1cd341919eb5/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 -> 0b368f0ce895b7ff7a5624a321c593cd8167db8d [2018-11-28 11:21:40,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:21:40,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:21:40,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:21:40,239 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:21:40,240 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:21:40,240 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi008_power.opt_false-unreach-call.i [2018-11-28 11:21:40,295 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/bin-2019/uautomizer/data/1f1de19f7/76a8e55d978542a8959bc3e935b5e04e/FLAG187c562c7 [2018-11-28 11:21:40,722 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:21:40,723 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/sv-benchmarks/c/pthread-wmm/rfi008_power.opt_false-unreach-call.i [2018-11-28 11:21:40,734 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/bin-2019/uautomizer/data/1f1de19f7/76a8e55d978542a8959bc3e935b5e04e/FLAG187c562c7 [2018-11-28 11:21:40,746 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/bin-2019/uautomizer/data/1f1de19f7/76a8e55d978542a8959bc3e935b5e04e [2018-11-28 11:21:40,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:21:40,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:21:40,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:21:40,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:21:40,752 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:21:40,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:40" (1/1) ... [2018-11-28 11:21:40,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b7394e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:40, skipping insertion in model container [2018-11-28 11:21:40,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:40" (1/1) ... [2018-11-28 11:21:40,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:21:40,795 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:21:41,076 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:21:41,148 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:21:41,212 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:21:41,274 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:21:41,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:41 WrapperNode [2018-11-28 11:21:41,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:21:41,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:21:41,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:21:41,276 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:21:41,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:41" (1/1) ... [2018-11-28 11:21:41,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:41" (1/1) ... [2018-11-28 11:21:41,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:21:41,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:21:41,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:21:41,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:21:41,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:41" (1/1) ... [2018-11-28 11:21:41,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:41" (1/1) ... [2018-11-28 11:21:41,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:41" (1/1) ... [2018-11-28 11:21:41,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:41" (1/1) ... [2018-11-28 11:21:41,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:41" (1/1) ... [2018-11-28 11:21:41,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:41" (1/1) ... [2018-11-28 11:21:41,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:41" (1/1) ... [2018-11-28 11:21:41,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:21:41,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:21:41,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:21:41,363 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:21:41,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/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-11-28 11:21:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:21:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:21:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 11:21:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:21:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 11:21:41,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 11:21:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 11:21:41,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 11:21:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 11:21:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:21:41,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:21:41,410 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 11:21:42,110 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:21:42,110 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 11:21:42,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:42 BoogieIcfgContainer [2018-11-28 11:21:42,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:21:42,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:21:42,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:21:42,115 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:21:42,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:21:40" (1/3) ... [2018-11-28 11:21:42,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279e5c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:21:42, skipping insertion in model container [2018-11-28 11:21:42,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:41" (2/3) ... [2018-11-28 11:21:42,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279e5c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:21:42, skipping insertion in model container [2018-11-28 11:21:42,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:42" (3/3) ... [2018-11-28 11:21:42,118 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008_power.opt_false-unreach-call.i [2018-11-28 11:21:42,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,159 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,159 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,185 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,185 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,186 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,187 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,187 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,207 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:21:42,231 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 11:21:42,232 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:21:42,239 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 11:21:42,249 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 11:21:42,266 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:21:42,266 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:21:42,266 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:21:42,267 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:21:42,267 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:21:42,267 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:21:42,267 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:21:42,267 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:21:42,267 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:21:42,278 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 174places, 227 transitions [2018-11-28 11:21:50,294 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83128 states. [2018-11-28 11:21:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 83128 states. [2018-11-28 11:21:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 11:21:50,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:21:50,304 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] [2018-11-28 11:21:50,306 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:21:50,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash -509770769, now seen corresponding path program 1 times [2018-11-28 11:21:50,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:50,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:50,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:50,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:50,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:21:50,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:21:50,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:21:50,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:21:50,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:21:50,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:21:50,523 INFO L87 Difference]: Start difference. First operand 83128 states. Second operand 4 states. [2018-11-28 11:21:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:21:51,770 INFO L93 Difference]: Finished difference Result 150584 states and 603161 transitions. [2018-11-28 11:21:51,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:21:51,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-28 11:21:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:21:52,684 INFO L225 Difference]: With dead ends: 150584 [2018-11-28 11:21:52,684 INFO L226 Difference]: Without dead ends: 105840 [2018-11-28 11:21:52,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:21:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105840 states. [2018-11-28 11:21:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105840 to 61236. [2018-11-28 11:21:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61236 states. [2018-11-28 11:21:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61236 states to 61236 states and 248291 transitions. [2018-11-28 11:21:55,647 INFO L78 Accepts]: Start accepts. Automaton has 61236 states and 248291 transitions. Word has length 39 [2018-11-28 11:21:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:21:55,648 INFO L480 AbstractCegarLoop]: Abstraction has 61236 states and 248291 transitions. [2018-11-28 11:21:55,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:21:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 61236 states and 248291 transitions. [2018-11-28 11:21:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 11:21:55,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:21:55,656 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-11-28 11:21:55,657 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:21:55,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:55,657 INFO L82 PathProgramCache]: Analyzing trace with hash 433147210, now seen corresponding path program 1 times [2018-11-28 11:21:55,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:55,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:55,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:55,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:55,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:21:55,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:21:55,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:21:55,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:21:55,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:21:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:21:55,748 INFO L87 Difference]: Start difference. First operand 61236 states and 248291 transitions. Second operand 5 states. [2018-11-28 11:21:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:21:59,372 INFO L93 Difference]: Finished difference Result 146040 states and 554301 transitions. [2018-11-28 11:21:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:21:59,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-28 11:21:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:21:59,770 INFO L225 Difference]: With dead ends: 146040 [2018-11-28 11:21:59,771 INFO L226 Difference]: Without dead ends: 145472 [2018-11-28 11:21:59,771 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-11-28 11:22:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145472 states. [2018-11-28 11:22:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145472 to 96614. [2018-11-28 11:22:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96614 states. [2018-11-28 11:22:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96614 states to 96614 states and 368456 transitions. [2018-11-28 11:22:02,834 INFO L78 Accepts]: Start accepts. Automaton has 96614 states and 368456 transitions. Word has length 47 [2018-11-28 11:22:02,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:02,835 INFO L480 AbstractCegarLoop]: Abstraction has 96614 states and 368456 transitions. [2018-11-28 11:22:02,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:22:02,835 INFO L276 IsEmpty]: Start isEmpty. Operand 96614 states and 368456 transitions. [2018-11-28 11:22:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 11:22:02,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:02,839 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-11-28 11:22:02,840 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:02,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:02,840 INFO L82 PathProgramCache]: Analyzing trace with hash 880943432, now seen corresponding path program 1 times [2018-11-28 11:22:02,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:02,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:02,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:02,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:02,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:02,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:02,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:22:02,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:22:02,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:22:02,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:22:02,928 INFO L87 Difference]: Start difference. First operand 96614 states and 368456 transitions. Second operand 5 states. [2018-11-28 11:22:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:04,659 INFO L93 Difference]: Finished difference Result 199270 states and 748090 transitions. [2018-11-28 11:22:04,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:22:04,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-28 11:22:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:05,136 INFO L225 Difference]: With dead ends: 199270 [2018-11-28 11:22:05,136 INFO L226 Difference]: Without dead ends: 198806 [2018-11-28 11:22:05,136 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-11-28 11:22:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198806 states. [2018-11-28 11:22:09,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198806 to 108297. [2018-11-28 11:22:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108297 states. [2018-11-28 11:22:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108297 states to 108297 states and 408660 transitions. [2018-11-28 11:22:09,410 INFO L78 Accepts]: Start accepts. Automaton has 108297 states and 408660 transitions. Word has length 48 [2018-11-28 11:22:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:09,410 INFO L480 AbstractCegarLoop]: Abstraction has 108297 states and 408660 transitions. [2018-11-28 11:22:09,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:22:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 108297 states and 408660 transitions. [2018-11-28 11:22:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 11:22:09,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:09,419 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-11-28 11:22:09,420 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:09,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1360660398, now seen corresponding path program 1 times [2018-11-28 11:22:09,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:09,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:09,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:09,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:09,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:09,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:09,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:09,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:09,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:09,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:09,468 INFO L87 Difference]: Start difference. First operand 108297 states and 408660 transitions. Second operand 3 states. [2018-11-28 11:22:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:12,500 INFO L93 Difference]: Finished difference Result 179116 states and 655175 transitions. [2018-11-28 11:22:12,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:12,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 11:22:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:12,923 INFO L225 Difference]: With dead ends: 179116 [2018-11-28 11:22:12,923 INFO L226 Difference]: Without dead ends: 179116 [2018-11-28 11:22:12,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179116 states. [2018-11-28 11:22:16,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179116 to 163647. [2018-11-28 11:22:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163647 states. [2018-11-28 11:22:17,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163647 states to 163647 states and 603626 transitions. [2018-11-28 11:22:17,288 INFO L78 Accepts]: Start accepts. Automaton has 163647 states and 603626 transitions. Word has length 50 [2018-11-28 11:22:17,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:17,289 INFO L480 AbstractCegarLoop]: Abstraction has 163647 states and 603626 transitions. [2018-11-28 11:22:17,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 163647 states and 603626 transitions. [2018-11-28 11:22:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 11:22:17,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:17,305 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-11-28 11:22:17,305 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:17,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash 945447033, now seen corresponding path program 1 times [2018-11-28 11:22:17,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:17,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:17,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:17,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:17,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:17,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:17,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:22:17,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:22:17,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:22:17,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:22:17,378 INFO L87 Difference]: Start difference. First operand 163647 states and 603626 transitions. Second operand 6 states. [2018-11-28 11:22:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:19,199 INFO L93 Difference]: Finished difference Result 315524 states and 1139599 transitions. [2018-11-28 11:22:19,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:22:19,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-28 11:22:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:20,857 INFO L225 Difference]: With dead ends: 315524 [2018-11-28 11:22:20,857 INFO L226 Difference]: Without dead ends: 314988 [2018-11-28 11:22:20,858 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-11-28 11:22:23,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314988 states. [2018-11-28 11:22:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314988 to 164410. [2018-11-28 11:22:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164410 states. [2018-11-28 11:22:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164410 states to 164410 states and 606497 transitions. [2018-11-28 11:22:30,694 INFO L78 Accepts]: Start accepts. Automaton has 164410 states and 606497 transitions. Word has length 54 [2018-11-28 11:22:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:30,694 INFO L480 AbstractCegarLoop]: Abstraction has 164410 states and 606497 transitions. [2018-11-28 11:22:30,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:22:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 164410 states and 606497 transitions. [2018-11-28 11:22:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 11:22:30,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:30,711 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-11-28 11:22:30,711 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:30,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:30,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1217557252, now seen corresponding path program 1 times [2018-11-28 11:22:30,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:30,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:30,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:30,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:30,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:30,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-11-28 11:22:30,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:30,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:22:30,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:22:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:22:30,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:22:30,828 INFO L87 Difference]: Start difference. First operand 164410 states and 606497 transitions. Second operand 6 states. [2018-11-28 11:22:32,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:32,323 INFO L93 Difference]: Finished difference Result 215867 states and 792771 transitions. [2018-11-28 11:22:32,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:22:32,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-28 11:22:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:32,874 INFO L225 Difference]: With dead ends: 215867 [2018-11-28 11:22:32,875 INFO L226 Difference]: Without dead ends: 215867 [2018-11-28 11:22:32,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:22:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215867 states. [2018-11-28 11:22:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215867 to 201216. [2018-11-28 11:22:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201216 states. [2018-11-28 11:22:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201216 states to 201216 states and 739038 transitions. [2018-11-28 11:22:39,287 INFO L78 Accepts]: Start accepts. Automaton has 201216 states and 739038 transitions. Word has length 54 [2018-11-28 11:22:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:39,287 INFO L480 AbstractCegarLoop]: Abstraction has 201216 states and 739038 transitions. [2018-11-28 11:22:39,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:22:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 201216 states and 739038 transitions. [2018-11-28 11:22:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 11:22:39,307 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:39,307 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-11-28 11:22:39,308 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:39,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:39,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1280458685, now seen corresponding path program 1 times [2018-11-28 11:22:39,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:39,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:39,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:39,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:39,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:22:39,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:22:39,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:22:39,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:22:39,352 INFO L87 Difference]: Start difference. First operand 201216 states and 739038 transitions. Second operand 4 states. [2018-11-28 11:22:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:39,502 INFO L93 Difference]: Finished difference Result 38680 states and 122685 transitions. [2018-11-28 11:22:39,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:22:39,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-28 11:22:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:39,552 INFO L225 Difference]: With dead ends: 38680 [2018-11-28 11:22:39,552 INFO L226 Difference]: Without dead ends: 32084 [2018-11-28 11:22:39,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:22:39,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32084 states. [2018-11-28 11:22:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32084 to 31837. [2018-11-28 11:22:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31837 states. [2018-11-28 11:22:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31837 states to 31837 states and 99516 transitions. [2018-11-28 11:22:39,963 INFO L78 Accepts]: Start accepts. Automaton has 31837 states and 99516 transitions. Word has length 54 [2018-11-28 11:22:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:39,964 INFO L480 AbstractCegarLoop]: Abstraction has 31837 states and 99516 transitions. [2018-11-28 11:22:39,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:22:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 31837 states and 99516 transitions. [2018-11-28 11:22:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 11:22:39,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:39,969 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] [2018-11-28 11:22:39,969 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:39,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:39,969 INFO L82 PathProgramCache]: Analyzing trace with hash -331406897, now seen corresponding path program 1 times [2018-11-28 11:22:39,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:39,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:39,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:39,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:39,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:40,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:40,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:22:40,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:22:40,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:22:40,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:22:40,033 INFO L87 Difference]: Start difference. First operand 31837 states and 99516 transitions. Second operand 4 states. [2018-11-28 11:22:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:40,331 INFO L93 Difference]: Finished difference Result 41209 states and 129950 transitions. [2018-11-28 11:22:40,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:22:40,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 11:22:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:40,393 INFO L225 Difference]: With dead ends: 41209 [2018-11-28 11:22:40,393 INFO L226 Difference]: Without dead ends: 41209 [2018-11-28 11:22:40,393 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-11-28 11:22:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41209 states. [2018-11-28 11:22:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41209 to 35933. [2018-11-28 11:22:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35933 states. [2018-11-28 11:22:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35933 states to 35933 states and 112645 transitions. [2018-11-28 11:22:40,886 INFO L78 Accepts]: Start accepts. Automaton has 35933 states and 112645 transitions. Word has length 64 [2018-11-28 11:22:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:40,887 INFO L480 AbstractCegarLoop]: Abstraction has 35933 states and 112645 transitions. [2018-11-28 11:22:40,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:22:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 35933 states and 112645 transitions. [2018-11-28 11:22:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 11:22:40,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:40,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:22:40,893 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:40,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1411403438, now seen corresponding path program 1 times [2018-11-28 11:22:40,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:40,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:40,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:40,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:40,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:22:40,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:22:40,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:22:40,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:22:40,969 INFO L87 Difference]: Start difference. First operand 35933 states and 112645 transitions. Second operand 6 states. [2018-11-28 11:22:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:41,686 INFO L93 Difference]: Finished difference Result 72510 states and 225561 transitions. [2018-11-28 11:22:41,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:22:41,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-28 11:22:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:41,806 INFO L225 Difference]: With dead ends: 72510 [2018-11-28 11:22:41,806 INFO L226 Difference]: Without dead ends: 72446 [2018-11-28 11:22:41,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:22:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72446 states. [2018-11-28 11:22:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72446 to 40893. [2018-11-28 11:22:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40893 states. [2018-11-28 11:22:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40893 states to 40893 states and 126623 transitions. [2018-11-28 11:22:43,933 INFO L78 Accepts]: Start accepts. Automaton has 40893 states and 126623 transitions. Word has length 64 [2018-11-28 11:22:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:43,933 INFO L480 AbstractCegarLoop]: Abstraction has 40893 states and 126623 transitions. [2018-11-28 11:22:43,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:22:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 40893 states and 126623 transitions. [2018-11-28 11:22:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 11:22:43,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:43,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:22:43,946 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:43,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:43,946 INFO L82 PathProgramCache]: Analyzing trace with hash -434238497, now seen corresponding path program 1 times [2018-11-28 11:22:43,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:43,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:43,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:43,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:44,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:44,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:44,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:44,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:44,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:44,001 INFO L87 Difference]: Start difference. First operand 40893 states and 126623 transitions. Second operand 3 states. [2018-11-28 11:22:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:44,180 INFO L93 Difference]: Finished difference Result 46898 states and 143100 transitions. [2018-11-28 11:22:44,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:44,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-28 11:22:44,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:44,261 INFO L225 Difference]: With dead ends: 46898 [2018-11-28 11:22:44,261 INFO L226 Difference]: Without dead ends: 46898 [2018-11-28 11:22:44,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46898 states. [2018-11-28 11:22:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46898 to 40581. [2018-11-28 11:22:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40581 states. [2018-11-28 11:22:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40581 states to 40581 states and 123025 transitions. [2018-11-28 11:22:44,837 INFO L78 Accepts]: Start accepts. Automaton has 40581 states and 123025 transitions. Word has length 70 [2018-11-28 11:22:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:44,837 INFO L480 AbstractCegarLoop]: Abstraction has 40581 states and 123025 transitions. [2018-11-28 11:22:44,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 40581 states and 123025 transitions. [2018-11-28 11:22:44,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 11:22:44,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:44,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:22:44,851 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:44,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:44,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1095094739, now seen corresponding path program 1 times [2018-11-28 11:22:44,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:44,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:44,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:44,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:44,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:44,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:44,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:22:44,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:22:44,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:22:44,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:22:44,968 INFO L87 Difference]: Start difference. First operand 40581 states and 123025 transitions. Second operand 6 states. [2018-11-28 11:22:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:45,694 INFO L93 Difference]: Finished difference Result 50181 states and 152193 transitions. [2018-11-28 11:22:45,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:22:45,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-28 11:22:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:45,768 INFO L225 Difference]: With dead ends: 50181 [2018-11-28 11:22:45,769 INFO L226 Difference]: Without dead ends: 49877 [2018-11-28 11:22:45,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:22:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49877 states. [2018-11-28 11:22:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49877 to 45421. [2018-11-28 11:22:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45421 states. [2018-11-28 11:22:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45421 states to 45421 states and 138099 transitions. [2018-11-28 11:22:46,320 INFO L78 Accepts]: Start accepts. Automaton has 45421 states and 138099 transitions. Word has length 71 [2018-11-28 11:22:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:46,320 INFO L480 AbstractCegarLoop]: Abstraction has 45421 states and 138099 transitions. [2018-11-28 11:22:46,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:22:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 45421 states and 138099 transitions. [2018-11-28 11:22:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 11:22:46,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:46,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:22:46,332 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:46,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1402921198, now seen corresponding path program 1 times [2018-11-28 11:22:46,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:46,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:46,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:46,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:46,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:46,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:46,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:22:46,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:22:46,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:22:46,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:22:46,389 INFO L87 Difference]: Start difference. First operand 45421 states and 138099 transitions. Second operand 5 states. [2018-11-28 11:22:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:46,438 INFO L93 Difference]: Finished difference Result 12413 states and 31271 transitions. [2018-11-28 11:22:46,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:22:46,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-28 11:22:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:46,449 INFO L225 Difference]: With dead ends: 12413 [2018-11-28 11:22:46,449 INFO L226 Difference]: Without dead ends: 10477 [2018-11-28 11:22:46,450 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-11-28 11:22:46,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10477 states. [2018-11-28 11:22:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10477 to 8356. [2018-11-28 11:22:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8356 states. [2018-11-28 11:22:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8356 states to 8356 states and 20870 transitions. [2018-11-28 11:22:46,547 INFO L78 Accepts]: Start accepts. Automaton has 8356 states and 20870 transitions. Word has length 71 [2018-11-28 11:22:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:46,547 INFO L480 AbstractCegarLoop]: Abstraction has 8356 states and 20870 transitions. [2018-11-28 11:22:46,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:22:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 8356 states and 20870 transitions. [2018-11-28 11:22:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 11:22:46,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:46,554 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] [2018-11-28 11:22:46,555 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:46,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:46,555 INFO L82 PathProgramCache]: Analyzing trace with hash 691224991, now seen corresponding path program 1 times [2018-11-28 11:22:46,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:46,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:46,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:46,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:46,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:46,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:46,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:22:46,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:22:46,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:22:46,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:22:46,630 INFO L87 Difference]: Start difference. First operand 8356 states and 20870 transitions. Second operand 4 states. [2018-11-28 11:22:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:46,777 INFO L93 Difference]: Finished difference Result 9771 states and 23994 transitions. [2018-11-28 11:22:46,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:22:46,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-11-28 11:22:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:46,786 INFO L225 Difference]: With dead ends: 9771 [2018-11-28 11:22:46,786 INFO L226 Difference]: Without dead ends: 9771 [2018-11-28 11:22:46,786 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-11-28 11:22:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9771 states. [2018-11-28 11:22:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9771 to 9252. [2018-11-28 11:22:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9252 states. [2018-11-28 11:22:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9252 states to 9252 states and 22837 transitions. [2018-11-28 11:22:47,033 INFO L78 Accepts]: Start accepts. Automaton has 9252 states and 22837 transitions. Word has length 99 [2018-11-28 11:22:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:47,034 INFO L480 AbstractCegarLoop]: Abstraction has 9252 states and 22837 transitions. [2018-11-28 11:22:47,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:22:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 9252 states and 22837 transitions. [2018-11-28 11:22:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 11:22:47,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:47,042 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] [2018-11-28 11:22:47,043 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:47,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:47,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1318878850, now seen corresponding path program 1 times [2018-11-28 11:22:47,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:47,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:47,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:47,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:47,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:47,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:47,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:47,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:47,086 INFO L87 Difference]: Start difference. First operand 9252 states and 22837 transitions. Second operand 3 states. [2018-11-28 11:22:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:47,239 INFO L93 Difference]: Finished difference Result 12503 states and 30346 transitions. [2018-11-28 11:22:47,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:47,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-28 11:22:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:47,251 INFO L225 Difference]: With dead ends: 12503 [2018-11-28 11:22:47,251 INFO L226 Difference]: Without dead ends: 12503 [2018-11-28 11:22:47,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2018-11-28 11:22:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 11332. [2018-11-28 11:22:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11332 states. [2018-11-28 11:22:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11332 states to 11332 states and 27737 transitions. [2018-11-28 11:22:47,375 INFO L78 Accepts]: Start accepts. Automaton has 11332 states and 27737 transitions. Word has length 99 [2018-11-28 11:22:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:47,376 INFO L480 AbstractCegarLoop]: Abstraction has 11332 states and 27737 transitions. [2018-11-28 11:22:47,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 11332 states and 27737 transitions. [2018-11-28 11:22:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 11:22:47,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:47,385 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] [2018-11-28 11:22:47,386 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:47,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:47,386 INFO L82 PathProgramCache]: Analyzing trace with hash -306513179, now seen corresponding path program 1 times [2018-11-28 11:22:47,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:47,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:47,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:47,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:47,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:47,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:47,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:22:47,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:22:47,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:22:47,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:22:47,467 INFO L87 Difference]: Start difference. First operand 11332 states and 27737 transitions. Second operand 5 states. [2018-11-28 11:22:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:47,708 INFO L93 Difference]: Finished difference Result 13415 states and 32203 transitions. [2018-11-28 11:22:47,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:22:47,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-11-28 11:22:47,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:47,720 INFO L225 Difference]: With dead ends: 13415 [2018-11-28 11:22:47,720 INFO L226 Difference]: Without dead ends: 13415 [2018-11-28 11:22:47,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:22:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13415 states. [2018-11-28 11:22:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13415 to 11959. [2018-11-28 11:22:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11959 states. [2018-11-28 11:22:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11959 states to 11959 states and 29037 transitions. [2018-11-28 11:22:47,853 INFO L78 Accepts]: Start accepts. Automaton has 11959 states and 29037 transitions. Word has length 99 [2018-11-28 11:22:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:47,853 INFO L480 AbstractCegarLoop]: Abstraction has 11959 states and 29037 transitions. [2018-11-28 11:22:47,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:22:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 11959 states and 29037 transitions. [2018-11-28 11:22:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 11:22:47,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:47,868 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] [2018-11-28 11:22:47,869 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:47,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:47,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1202287287, now seen corresponding path program 2 times [2018-11-28 11:22:47,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:47,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:47,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:47,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:47,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:47,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:47,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:22:47,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:22:47,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:22:47,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:22:47,968 INFO L87 Difference]: Start difference. First operand 11959 states and 29037 transitions. Second operand 6 states. [2018-11-28 11:22:48,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:48,349 INFO L93 Difference]: Finished difference Result 14604 states and 34854 transitions. [2018-11-28 11:22:48,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:22:48,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-28 11:22:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:48,362 INFO L225 Difference]: With dead ends: 14604 [2018-11-28 11:22:48,362 INFO L226 Difference]: Without dead ends: 14604 [2018-11-28 11:22:48,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:22:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14604 states. [2018-11-28 11:22:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14604 to 11757. [2018-11-28 11:22:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11757 states. [2018-11-28 11:22:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 28093 transitions. [2018-11-28 11:22:48,490 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 28093 transitions. Word has length 99 [2018-11-28 11:22:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:48,490 INFO L480 AbstractCegarLoop]: Abstraction has 11757 states and 28093 transitions. [2018-11-28 11:22:48,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:22:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 28093 transitions. [2018-11-28 11:22:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 11:22:48,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:48,500 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] [2018-11-28 11:22:48,500 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:48,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:48,500 INFO L82 PathProgramCache]: Analyzing trace with hash 263729739, now seen corresponding path program 1 times [2018-11-28 11:22:48,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:48,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:48,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:48,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:22:48,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:48,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:48,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:22:48,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:22:48,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:22:48,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:22:48,566 INFO L87 Difference]: Start difference. First operand 11757 states and 28093 transitions. Second operand 5 states. [2018-11-28 11:22:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:48,754 INFO L93 Difference]: Finished difference Result 12580 states and 29794 transitions. [2018-11-28 11:22:48,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:22:48,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-11-28 11:22:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:48,765 INFO L225 Difference]: With dead ends: 12580 [2018-11-28 11:22:48,766 INFO L226 Difference]: Without dead ends: 12580 [2018-11-28 11:22:48,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:22:48,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12580 states. [2018-11-28 11:22:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12580 to 11924. [2018-11-28 11:22:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11924 states. [2018-11-28 11:22:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11924 states to 11924 states and 28450 transitions. [2018-11-28 11:22:48,889 INFO L78 Accepts]: Start accepts. Automaton has 11924 states and 28450 transitions. Word has length 101 [2018-11-28 11:22:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:48,889 INFO L480 AbstractCegarLoop]: Abstraction has 11924 states and 28450 transitions. [2018-11-28 11:22:48,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:22:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 11924 states and 28450 transitions. [2018-11-28 11:22:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 11:22:48,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:48,899 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] [2018-11-28 11:22:48,900 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:48,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:48,900 INFO L82 PathProgramCache]: Analyzing trace with hash -168805092, now seen corresponding path program 1 times [2018-11-28 11:22:48,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:48,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:48,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:48,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:48,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:48,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:48,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:22:48,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:22:48,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:22:48,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:22:48,967 INFO L87 Difference]: Start difference. First operand 11924 states and 28450 transitions. Second operand 5 states. [2018-11-28 11:22:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:49,112 INFO L93 Difference]: Finished difference Result 13552 states and 32459 transitions. [2018-11-28 11:22:49,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:22:49,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-11-28 11:22:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:49,130 INFO L225 Difference]: With dead ends: 13552 [2018-11-28 11:22:49,130 INFO L226 Difference]: Without dead ends: 13552 [2018-11-28 11:22:49,130 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-11-28 11:22:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13552 states. [2018-11-28 11:22:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13552 to 12144. [2018-11-28 11:22:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12144 states. [2018-11-28 11:22:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12144 states to 12144 states and 28991 transitions. [2018-11-28 11:22:49,314 INFO L78 Accepts]: Start accepts. Automaton has 12144 states and 28991 transitions. Word has length 101 [2018-11-28 11:22:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:49,314 INFO L480 AbstractCegarLoop]: Abstraction has 12144 states and 28991 transitions. [2018-11-28 11:22:49,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:22:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 12144 states and 28991 transitions. [2018-11-28 11:22:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 11:22:49,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:49,330 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] [2018-11-28 11:22:49,330 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:49,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:49,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1556675805, now seen corresponding path program 1 times [2018-11-28 11:22:49,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:49,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:49,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:49,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:49,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:49,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:49,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:22:49,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:22:49,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:22:49,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:22:49,415 INFO L87 Difference]: Start difference. First operand 12144 states and 28991 transitions. Second operand 6 states. [2018-11-28 11:22:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:49,867 INFO L93 Difference]: Finished difference Result 13480 states and 31895 transitions. [2018-11-28 11:22:49,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:22:49,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-11-28 11:22:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:49,882 INFO L225 Difference]: With dead ends: 13480 [2018-11-28 11:22:49,883 INFO L226 Difference]: Without dead ends: 13480 [2018-11-28 11:22:49,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:22:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13480 states. [2018-11-28 11:22:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13480 to 12144. [2018-11-28 11:22:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12144 states. [2018-11-28 11:22:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12144 states to 12144 states and 28991 transitions. [2018-11-28 11:22:50,055 INFO L78 Accepts]: Start accepts. Automaton has 12144 states and 28991 transitions. Word has length 101 [2018-11-28 11:22:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:50,055 INFO L480 AbstractCegarLoop]: Abstraction has 12144 states and 28991 transitions. [2018-11-28 11:22:50,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:22:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 12144 states and 28991 transitions. [2018-11-28 11:22:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 11:22:50,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:50,070 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] [2018-11-28 11:22:50,070 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:50,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash 392311525, now seen corresponding path program 1 times [2018-11-28 11:22:50,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:50,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:50,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:50,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:50,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:22:50,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:22:50,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:22:50,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:22:50,216 INFO L87 Difference]: Start difference. First operand 12144 states and 28991 transitions. Second operand 6 states. [2018-11-28 11:22:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:50,508 INFO L93 Difference]: Finished difference Result 12032 states and 28535 transitions. [2018-11-28 11:22:50,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:22:50,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-11-28 11:22:50,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:50,523 INFO L225 Difference]: With dead ends: 12032 [2018-11-28 11:22:50,523 INFO L226 Difference]: Without dead ends: 12032 [2018-11-28 11:22:50,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:22:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12032 states. [2018-11-28 11:22:50,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12032 to 10680. [2018-11-28 11:22:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10680 states. [2018-11-28 11:22:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10680 states to 10680 states and 25426 transitions. [2018-11-28 11:22:50,650 INFO L78 Accepts]: Start accepts. Automaton has 10680 states and 25426 transitions. Word has length 101 [2018-11-28 11:22:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:50,650 INFO L480 AbstractCegarLoop]: Abstraction has 10680 states and 25426 transitions. [2018-11-28 11:22:50,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:22:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 10680 states and 25426 transitions. [2018-11-28 11:22:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 11:22:50,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:50,660 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] [2018-11-28 11:22:50,660 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:50,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:50,660 INFO L82 PathProgramCache]: Analyzing trace with hash 262167459, now seen corresponding path program 1 times [2018-11-28 11:22:50,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:50,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:50,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:50,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:50,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:50,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:50,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:22:50,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:22:50,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:22:50,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:22:50,750 INFO L87 Difference]: Start difference. First operand 10680 states and 25426 transitions. Second operand 8 states. [2018-11-28 11:22:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:51,630 INFO L93 Difference]: Finished difference Result 18720 states and 43673 transitions. [2018-11-28 11:22:51,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 11:22:51,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2018-11-28 11:22:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:51,646 INFO L225 Difference]: With dead ends: 18720 [2018-11-28 11:22:51,646 INFO L226 Difference]: Without dead ends: 18637 [2018-11-28 11:22:51,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-11-28 11:22:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18637 states. [2018-11-28 11:22:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18637 to 14090. [2018-11-28 11:22:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14090 states. [2018-11-28 11:22:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14090 states to 14090 states and 33491 transitions. [2018-11-28 11:22:51,815 INFO L78 Accepts]: Start accepts. Automaton has 14090 states and 33491 transitions. Word has length 103 [2018-11-28 11:22:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:51,815 INFO L480 AbstractCegarLoop]: Abstraction has 14090 states and 33491 transitions. [2018-11-28 11:22:51,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:22:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 14090 states and 33491 transitions. [2018-11-28 11:22:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 11:22:51,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:51,826 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] [2018-11-28 11:22:51,826 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:51,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:51,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1747936382, now seen corresponding path program 1 times [2018-11-28 11:22:51,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:51,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:51,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:51,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:51,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:51,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:51,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:22:51,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:22:51,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:22:51,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:22:51,941 INFO L87 Difference]: Start difference. First operand 14090 states and 33491 transitions. Second operand 7 states. [2018-11-28 11:22:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:52,429 INFO L93 Difference]: Finished difference Result 19052 states and 43962 transitions. [2018-11-28 11:22:52,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:22:52,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-11-28 11:22:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:52,442 INFO L225 Difference]: With dead ends: 19052 [2018-11-28 11:22:52,443 INFO L226 Difference]: Without dead ends: 19052 [2018-11-28 11:22:52,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:22:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19052 states. [2018-11-28 11:22:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19052 to 16331. [2018-11-28 11:22:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16331 states. [2018-11-28 11:22:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16331 states to 16331 states and 38195 transitions. [2018-11-28 11:22:52,621 INFO L78 Accepts]: Start accepts. Automaton has 16331 states and 38195 transitions. Word has length 103 [2018-11-28 11:22:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:52,621 INFO L480 AbstractCegarLoop]: Abstraction has 16331 states and 38195 transitions. [2018-11-28 11:22:52,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:22:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 16331 states and 38195 transitions. [2018-11-28 11:22:52,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 11:22:52,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:52,634 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] [2018-11-28 11:22:52,635 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:52,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:52,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2002672927, now seen corresponding path program 1 times [2018-11-28 11:22:52,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:52,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:52,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:52,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:52,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:52,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:52,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:22:52,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:22:52,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:22:52,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:52,681 INFO L87 Difference]: Start difference. First operand 16331 states and 38195 transitions. Second operand 3 states. [2018-11-28 11:22:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:52,744 INFO L93 Difference]: Finished difference Result 19467 states and 45358 transitions. [2018-11-28 11:22:52,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:22:52,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-11-28 11:22:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:52,763 INFO L225 Difference]: With dead ends: 19467 [2018-11-28 11:22:52,764 INFO L226 Difference]: Without dead ends: 19467 [2018-11-28 11:22:52,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:22:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19467 states. [2018-11-28 11:22:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19467 to 19401. [2018-11-28 11:22:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19401 states. [2018-11-28 11:22:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19401 states to 19401 states and 45218 transitions. [2018-11-28 11:22:52,961 INFO L78 Accepts]: Start accepts. Automaton has 19401 states and 45218 transitions. Word has length 103 [2018-11-28 11:22:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:52,961 INFO L480 AbstractCegarLoop]: Abstraction has 19401 states and 45218 transitions. [2018-11-28 11:22:52,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:22:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 19401 states and 45218 transitions. [2018-11-28 11:22:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 11:22:52,979 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:52,979 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] [2018-11-28 11:22:52,980 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:52,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:52,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1791322014, now seen corresponding path program 1 times [2018-11-28 11:22:52,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:52,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:52,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:52,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:53,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:53,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:22:53,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:22:53,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:22:53,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:22:53,102 INFO L87 Difference]: Start difference. First operand 19401 states and 45218 transitions. Second operand 10 states. [2018-11-28 11:22:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:53,547 INFO L93 Difference]: Finished difference Result 21604 states and 50289 transitions. [2018-11-28 11:22:53,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:22:53,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-11-28 11:22:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:53,552 INFO L225 Difference]: With dead ends: 21604 [2018-11-28 11:22:53,552 INFO L226 Difference]: Without dead ends: 3230 [2018-11-28 11:22:53,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:22:53,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2018-11-28 11:22:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3228. [2018-11-28 11:22:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3228 states. [2018-11-28 11:22:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 3228 states and 7664 transitions. [2018-11-28 11:22:53,584 INFO L78 Accepts]: Start accepts. Automaton has 3228 states and 7664 transitions. Word has length 103 [2018-11-28 11:22:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:53,584 INFO L480 AbstractCegarLoop]: Abstraction has 3228 states and 7664 transitions. [2018-11-28 11:22:53,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:22:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3228 states and 7664 transitions. [2018-11-28 11:22:53,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 11:22:53,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:53,587 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] [2018-11-28 11:22:53,587 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:53,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:53,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2139598924, now seen corresponding path program 1 times [2018-11-28 11:22:53,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:53,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:53,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:53,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:53,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:53,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:53,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:22:53,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:22:53,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:22:53,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:22:53,699 INFO L87 Difference]: Start difference. First operand 3228 states and 7664 transitions. Second operand 7 states. [2018-11-28 11:22:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:54,192 INFO L93 Difference]: Finished difference Result 3678 states and 8614 transitions. [2018-11-28 11:22:54,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:22:54,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-11-28 11:22:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:54,198 INFO L225 Difference]: With dead ends: 3678 [2018-11-28 11:22:54,198 INFO L226 Difference]: Without dead ends: 3678 [2018-11-28 11:22:54,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:22:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2018-11-28 11:22:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 3170. [2018-11-28 11:22:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2018-11-28 11:22:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 7546 transitions. [2018-11-28 11:22:54,239 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 7546 transitions. Word has length 103 [2018-11-28 11:22:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:54,239 INFO L480 AbstractCegarLoop]: Abstraction has 3170 states and 7546 transitions. [2018-11-28 11:22:54,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:22:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 7546 transitions. [2018-11-28 11:22:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 11:22:54,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:54,243 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] [2018-11-28 11:22:54,243 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:54,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:54,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1101689485, now seen corresponding path program 2 times [2018-11-28 11:22:54,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:54,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:54,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:54,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:22:54,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:22:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:22:54,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:22:54,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 11:22:54,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:22:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:22:54,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:22:54,375 INFO L87 Difference]: Start difference. First operand 3170 states and 7546 transitions. Second operand 13 states. [2018-11-28 11:22:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:22:54,865 INFO L93 Difference]: Finished difference Result 4972 states and 11624 transitions. [2018-11-28 11:22:54,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:22:54,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2018-11-28 11:22:54,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:22:54,868 INFO L225 Difference]: With dead ends: 4972 [2018-11-28 11:22:54,868 INFO L226 Difference]: Without dead ends: 3627 [2018-11-28 11:22:54,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-11-28 11:22:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2018-11-28 11:22:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3225. [2018-11-28 11:22:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3225 states. [2018-11-28 11:22:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 7607 transitions. [2018-11-28 11:22:54,895 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 7607 transitions. Word has length 103 [2018-11-28 11:22:54,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:22:54,896 INFO L480 AbstractCegarLoop]: Abstraction has 3225 states and 7607 transitions. [2018-11-28 11:22:54,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:22:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 7607 transitions. [2018-11-28 11:22:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 11:22:54,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:22:54,899 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] [2018-11-28 11:22:54,899 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:22:54,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:22:54,899 INFO L82 PathProgramCache]: Analyzing trace with hash 185647889, now seen corresponding path program 3 times [2018-11-28 11:22:54,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:22:54,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:22:54,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:54,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:22:54,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:22:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:22:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:22:54,961 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:22:55,054 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 11:22:55,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:22:55 BasicIcfg [2018-11-28 11:22:55,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:22:55,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:22:55,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:22:55,056 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:22:55,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:42" (3/4) ... [2018-11-28 11:22:55,061 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 11:22:55,172 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_00fe55b9-7484-4da8-a2e5-1cd341919eb5/bin-2019/uautomizer/witness.graphml [2018-11-28 11:22:55,172 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:22:55,173 INFO L168 Benchmark]: Toolchain (without parser) took 74424.85 ms. Allocated memory was 1.0 GB in the beginning and 6.0 GB in the end (delta: 5.0 GB). Free memory was 951.7 MB in the beginning and 4.4 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-28 11:22:55,175 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:22:55,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:22:55,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:22:55,176 INFO L168 Benchmark]: Boogie Preprocessor took 25.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:22:55,176 INFO L168 Benchmark]: RCFGBuilder took 748.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:22:55,176 INFO L168 Benchmark]: TraceAbstraction took 72943.09 ms. Allocated memory was 1.2 GB in the beginning and 6.0 GB in the end (delta: 4.8 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-28 11:22:55,177 INFO L168 Benchmark]: Witness Printer took 117.14 ms. Allocated memory is still 6.0 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:22:55,178 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 525.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 748.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 72943.09 ms. Allocated memory was 1.2 GB in the beginning and 6.0 GB in the end (delta: 4.8 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 117.14 ms. Allocated memory is still 6.0 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 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] [L686] -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, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_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, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L693] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L694] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] -1 pthread_t t1725; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] FCALL, FORK -1 pthread_create(&t1725, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 pthread_t t1726; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK -1 pthread_create(&t1726, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 y$w_buff1 = y$w_buff0 [L738] 0 y$w_buff0 = 1 [L739] 0 y$w_buff1_used = y$w_buff0_used [L740] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L743] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L744] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L745] 0 y$r_buff0_thd2 = (_Bool)1 [L748] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 0 y$flush_delayed = weak$$choice2 [L751] 0 y$mem_tmp = y 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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L753] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L754] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L755] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L756] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L758] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L759] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 0 y = y$flush_delayed ? y$mem_tmp : y [L761] 0 y$flush_delayed = (_Bool)0 [L764] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 1 x = 1 [L709] 1 __unbuffered_p0_EAX = x [L712] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L713] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L714] 1 y$flush_delayed = weak$$choice2 [L715] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L717] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L718] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L719] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L720] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 0 __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=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L721] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=6, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L722] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=6, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L723] 1 __unbuffered_p0_EBX = y 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] EXPR 1 y$flush_delayed ? y$mem_tmp : y 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y = y$flush_delayed ? y$mem_tmp : y [L725] 1 y$flush_delayed = (_Bool)0 [L730] 1 __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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] -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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 284 locations, 3 error locations. UNSAFE Result, 72.7s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 24.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9823 SDtfs, 10957 SDslu, 23991 SDs, 0 SdLazy, 8631 SolverSat, 551 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 64 SyntacticMatches, 20 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201216occurred 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: 37.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 433630 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2207 NumberOfCodeBlocks, 2207 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2078 ConstructedInterpolants, 0 QuantifiedInterpolants, 406298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...