./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_pso.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_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/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 ddefdc0892046fb9fafc8d7bcb31e874c7cb25a7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 10:33:44,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:33:44,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:33:44,109 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:33:44,109 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:33:44,110 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:33:44,110 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:33:44,111 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:33:44,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:33:44,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:33:44,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:33:44,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:33:44,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:33:44,115 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:33:44,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:33:44,117 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:33:44,117 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:33:44,119 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:33:44,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:33:44,121 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:33:44,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:33:44,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:33:44,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:33:44,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:33:44,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:33:44,125 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:33:44,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:33:44,127 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:33:44,127 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:33:44,128 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:33:44,128 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:33:44,129 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:33:44,129 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:33:44,129 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:33:44,130 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:33:44,130 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:33:44,130 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 10:33:44,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:33:44,140 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:33:44,141 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 10:33:44,141 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 10:33:44,141 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:33:44,142 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:33:44,142 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:33:44,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:33:44,142 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:33:44,142 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:33:44,142 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:33:44,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:33:44,143 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 10:33:44,143 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 10:33:44,143 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 10:33:44,143 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:33:44,143 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:33:44,143 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:33:44,143 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 10:33:44,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:33:44,144 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:33:44,144 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 10:33:44,144 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 10:33:44,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 10:33:44,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:33:44,144 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 10:33:44,144 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 10:33:44,145 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:33:44,145 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 10:33:44,145 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 10:33:44,145 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_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/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 -> ddefdc0892046fb9fafc8d7bcb31e874c7cb25a7 [2018-11-28 10:33:44,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:33:44,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:33:44,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:33:44,177 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:33:44,178 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:33:44,178 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix045_pso.opt_false-unreach-call.i [2018-11-28 10:33:44,214 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/bin-2019/uautomizer/data/cac96dc85/e6c6b168e3b14f929b0362f8cc1997eb/FLAGf9da131f5 [2018-11-28 10:33:44,655 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:33:44,655 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/sv-benchmarks/c/pthread-wmm/mix045_pso.opt_false-unreach-call.i [2018-11-28 10:33:44,666 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/bin-2019/uautomizer/data/cac96dc85/e6c6b168e3b14f929b0362f8cc1997eb/FLAGf9da131f5 [2018-11-28 10:33:44,677 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/bin-2019/uautomizer/data/cac96dc85/e6c6b168e3b14f929b0362f8cc1997eb [2018-11-28 10:33:44,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:33:44,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:33:44,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:44,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:33:44,684 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:33:44,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:44" (1/1) ... [2018-11-28 10:33:44,687 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 10:33:44, skipping insertion in model container [2018-11-28 10:33:44,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:44" (1/1) ... [2018-11-28 10:33:44,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:33:44,724 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:33:44,956 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:44,966 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:33:45,055 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:45,089 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:33:45,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:45 WrapperNode [2018-11-28 10:33:45,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:45,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:45,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:33:45,090 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:33:45,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:45" (1/1) ... [2018-11-28 10:33:45,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:45" (1/1) ... [2018-11-28 10:33:45,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:45,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:33:45,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:33:45,134 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:33:45,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:45" (1/1) ... [2018-11-28 10:33:45,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:45" (1/1) ... [2018-11-28 10:33:45,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:45" (1/1) ... [2018-11-28 10:33:45,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:45" (1/1) ... [2018-11-28 10:33:45,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:45" (1/1) ... [2018-11-28 10:33:45,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:45" (1/1) ... [2018-11-28 10:33:45,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:45" (1/1) ... [2018-11-28 10:33:45,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:33:45,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:33:45,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:33:45,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:33:45,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/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 10:33:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:33:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 10:33:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 10:33:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:33:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 10:33:45,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 10:33:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 10:33:45,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 10:33:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-11-28 10:33:45,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-11-28 10:33:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 10:33:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:33:45,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:33:45,198 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 10:33:45,603 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:33:45,604 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 10:33:45,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:45 BoogieIcfgContainer [2018-11-28 10:33:45,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:33:45,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 10:33:45,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 10:33:45,606 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 10:33:45,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:33:44" (1/3) ... [2018-11-28 10:33:45,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6631dde3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:33:45, skipping insertion in model container [2018-11-28 10:33:45,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:45" (2/3) ... [2018-11-28 10:33:45,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6631dde3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:33:45, skipping insertion in model container [2018-11-28 10:33:45,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:45" (3/3) ... [2018-11-28 10:33:45,608 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt_false-unreach-call.i [2018-11-28 10:33:45,634 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,634 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,634 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,634 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,635 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,635 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,635 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,635 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,635 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,635 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,636 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,636 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,636 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,636 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,636 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,641 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,641 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,642 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,642 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,642 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 10:33:45,657 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 10:33:45,657 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 10:33:45,664 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 10:33:45,678 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 10:33:45,698 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:33:45,699 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 10:33:45,699 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 10:33:45,699 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 10:33:45,699 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:33:45,699 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:33:45,699 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 10:33:45,699 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:33:45,700 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 10:33:45,709 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-11-28 10:34:01,136 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-11-28 10:34:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-11-28 10:34:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 10:34:01,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:34:01,146 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] [2018-11-28 10:34:01,147 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:34:01,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:34:01,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-11-28 10:34:01,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:34:01,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:34:01,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:01,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:34:01,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:34:01,339 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 10:34:01,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:01,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:34:01,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:34:01,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:34:01,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:34:01,354 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-11-28 10:34:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:34:02,903 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-11-28 10:34:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:34:02,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-28 10:34:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:34:03,643 INFO L225 Difference]: With dead ends: 233474 [2018-11-28 10:34:03,643 INFO L226 Difference]: Without dead ends: 203724 [2018-11-28 10:34:03,644 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 10:34:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-11-28 10:34:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-11-28 10:34:10,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-11-28 10:34:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-11-28 10:34:10,893 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-11-28 10:34:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:34:10,894 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-11-28 10:34:10,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:34:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-11-28 10:34:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 10:34:10,902 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:34:10,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:34:10,903 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:34:10,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:34:10,903 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-11-28 10:34:10,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:34:10,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:34:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:10,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:34:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:34:10,971 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 10:34:10,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:10,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:34:10,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:34:10,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:34:10,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:34:10,974 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-11-28 10:34:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:34:11,751 INFO L93 Difference]: Finished difference Result 118894 states and 557817 transitions. [2018-11-28 10:34:11,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:34:11,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-28 10:34:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:34:12,086 INFO L225 Difference]: With dead ends: 118894 [2018-11-28 10:34:12,086 INFO L226 Difference]: Without dead ends: 118894 [2018-11-28 10:34:12,087 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 10:34:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-11-28 10:34:14,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-11-28 10:34:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-11-28 10:34:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 557817 transitions. [2018-11-28 10:34:15,146 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 557817 transitions. Word has length 52 [2018-11-28 10:34:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:34:15,147 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 557817 transitions. [2018-11-28 10:34:15,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:34:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 557817 transitions. [2018-11-28 10:34:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 10:34:15,150 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:34:15,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:34:15,150 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:34:15,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:34:15,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-11-28 10:34:15,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:34:15,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:34:15,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:15,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:34:15,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:34:15,227 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 10:34:15,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:15,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:34:15,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:34:15,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:34:15,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:34:15,228 INFO L87 Difference]: Start difference. First operand 118894 states and 557817 transitions. Second operand 5 states. [2018-11-28 10:34:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:34:20,087 INFO L93 Difference]: Finished difference Result 325274 states and 1468251 transitions. [2018-11-28 10:34:20,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:34:20,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-28 10:34:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:34:20,896 INFO L225 Difference]: With dead ends: 325274 [2018-11-28 10:34:20,897 INFO L226 Difference]: Without dead ends: 324274 [2018-11-28 10:34:20,897 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 10:34:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-11-28 10:34:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-11-28 10:34:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-11-28 10:34:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840916 transitions. [2018-11-28 10:34:26,603 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840916 transitions. Word has length 52 [2018-11-28 10:34:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:34:26,604 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840916 transitions. [2018-11-28 10:34:26,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:34:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840916 transitions. [2018-11-28 10:34:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 10:34:26,611 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:34:26,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:34:26,612 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:34:26,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:34:26,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1719302045, now seen corresponding path program 1 times [2018-11-28 10:34:26,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:34:26,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:34:26,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:26,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:34:26,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:34:26,672 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 10:34:26,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:26,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:34:26,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:34:26,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:34:26,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:34:26,673 INFO L87 Difference]: Start difference. First operand 186424 states and 840916 transitions. Second operand 5 states. [2018-11-28 10:34:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:34:28,203 INFO L93 Difference]: Finished difference Result 334054 states and 1500995 transitions. [2018-11-28 10:34:28,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:34:28,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-28 10:34:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:34:29,048 INFO L225 Difference]: With dead ends: 334054 [2018-11-28 10:34:29,049 INFO L226 Difference]: Without dead ends: 333004 [2018-11-28 10:34:29,049 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 10:34:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333004 states. [2018-11-28 10:34:38,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333004 to 194884. [2018-11-28 10:34:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194884 states. [2018-11-28 10:34:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194884 states to 194884 states and 876474 transitions. [2018-11-28 10:34:38,922 INFO L78 Accepts]: Start accepts. Automaton has 194884 states and 876474 transitions. Word has length 53 [2018-11-28 10:34:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:34:38,922 INFO L480 AbstractCegarLoop]: Abstraction has 194884 states and 876474 transitions. [2018-11-28 10:34:38,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:34:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 194884 states and 876474 transitions. [2018-11-28 10:34:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 10:34:38,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:34:38,944 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] [2018-11-28 10:34:38,945 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:34:38,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:34:38,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1090824439, now seen corresponding path program 1 times [2018-11-28 10:34:38,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:34:38,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:34:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:38,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:34:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:34:39,003 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 10:34:39,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:39,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:34:39,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:34:39,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:34:39,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:34:39,004 INFO L87 Difference]: Start difference. First operand 194884 states and 876474 transitions. Second operand 4 states. [2018-11-28 10:34:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:34:40,368 INFO L93 Difference]: Finished difference Result 172220 states and 761327 transitions. [2018-11-28 10:34:40,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:34:40,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-28 10:34:40,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:34:40,763 INFO L225 Difference]: With dead ends: 172220 [2018-11-28 10:34:40,763 INFO L226 Difference]: Without dead ends: 169615 [2018-11-28 10:34:40,763 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 10:34:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169615 states. [2018-11-28 10:34:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169615 to 169615. [2018-11-28 10:34:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169615 states. [2018-11-28 10:34:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169615 states to 169615 states and 752655 transitions. [2018-11-28 10:34:44,501 INFO L78 Accepts]: Start accepts. Automaton has 169615 states and 752655 transitions. Word has length 60 [2018-11-28 10:34:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:34:44,501 INFO L480 AbstractCegarLoop]: Abstraction has 169615 states and 752655 transitions. [2018-11-28 10:34:44,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:34:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 169615 states and 752655 transitions. [2018-11-28 10:34:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 10:34:44,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:34:44,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:34:44,519 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:34:44,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:34:44,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1351804609, now seen corresponding path program 1 times [2018-11-28 10:34:44,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:34:44,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:34:44,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:44,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:34:44,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:34:44,590 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 10:34:44,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:44,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:34:44,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:34:44,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:34:44,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:34:44,591 INFO L87 Difference]: Start difference. First operand 169615 states and 752655 transitions. Second operand 6 states. [2018-11-28 10:34:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:34:48,863 INFO L93 Difference]: Finished difference Result 292571 states and 1274504 transitions. [2018-11-28 10:34:48,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 10:34:48,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-11-28 10:34:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:34:49,612 INFO L225 Difference]: With dead ends: 292571 [2018-11-28 10:34:49,612 INFO L226 Difference]: Without dead ends: 291731 [2018-11-28 10:34:49,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-11-28 10:34:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291731 states. [2018-11-28 10:34:53,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291731 to 164647. [2018-11-28 10:34:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164647 states. [2018-11-28 10:34:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164647 states to 164647 states and 730661 transitions. [2018-11-28 10:34:54,143 INFO L78 Accepts]: Start accepts. Automaton has 164647 states and 730661 transitions. Word has length 61 [2018-11-28 10:34:54,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:34:54,143 INFO L480 AbstractCegarLoop]: Abstraction has 164647 states and 730661 transitions. [2018-11-28 10:34:54,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:34:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 164647 states and 730661 transitions. [2018-11-28 10:34:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 10:34:54,205 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:34:54,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:34:54,205 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:34:54,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:34:54,205 INFO L82 PathProgramCache]: Analyzing trace with hash 368125063, now seen corresponding path program 1 times [2018-11-28 10:34:54,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:34:54,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:34:54,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:54,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:34:54,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:34:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:34:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:34:54,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:54,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:34:54,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:34:54,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:34:54,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:34:54,261 INFO L87 Difference]: Start difference. First operand 164647 states and 730661 transitions. Second operand 3 states. [2018-11-28 10:34:55,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:34:55,505 INFO L93 Difference]: Finished difference Result 164647 states and 730625 transitions. [2018-11-28 10:34:55,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:34:55,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-28 10:34:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:34:55,882 INFO L225 Difference]: With dead ends: 164647 [2018-11-28 10:34:55,882 INFO L226 Difference]: Without dead ends: 164647 [2018-11-28 10:34:55,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:34:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164647 states. [2018-11-28 10:34:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164647 to 164647. [2018-11-28 10:34:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164647 states. [2018-11-28 10:35:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164647 states to 164647 states and 730625 transitions. [2018-11-28 10:35:04,433 INFO L78 Accepts]: Start accepts. Automaton has 164647 states and 730625 transitions. Word has length 68 [2018-11-28 10:35:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:35:04,433 INFO L480 AbstractCegarLoop]: Abstraction has 164647 states and 730625 transitions. [2018-11-28 10:35:04,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:35:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 164647 states and 730625 transitions. [2018-11-28 10:35:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 10:35:04,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:35:04,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:35:04,492 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:35:04,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:35:04,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1669931226, now seen corresponding path program 1 times [2018-11-28 10:35:04,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:35:04,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:35:04,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:35:04,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:35:04,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:35:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:35:04,560 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 10:35:04,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:35:04,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:35:04,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:35:04,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:35:04,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:35:04,561 INFO L87 Difference]: Start difference. First operand 164647 states and 730625 transitions. Second operand 4 states. [2018-11-28 10:35:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:35:05,860 INFO L93 Difference]: Finished difference Result 264423 states and 1158909 transitions. [2018-11-28 10:35:05,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:35:05,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-28 10:35:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:35:06,951 INFO L225 Difference]: With dead ends: 264423 [2018-11-28 10:35:06,951 INFO L226 Difference]: Without dead ends: 263063 [2018-11-28 10:35:06,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:35:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263063 states. [2018-11-28 10:35:11,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263063 to 220279. [2018-11-28 10:35:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220279 states. [2018-11-28 10:35:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220279 states to 220279 states and 974873 transitions. [2018-11-28 10:35:12,445 INFO L78 Accepts]: Start accepts. Automaton has 220279 states and 974873 transitions. Word has length 68 [2018-11-28 10:35:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:35:12,445 INFO L480 AbstractCegarLoop]: Abstraction has 220279 states and 974873 transitions. [2018-11-28 10:35:12,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:35:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 220279 states and 974873 transitions. [2018-11-28 10:35:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 10:35:12,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:35:12,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:35:12,549 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:35:12,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:35:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash -316621529, now seen corresponding path program 1 times [2018-11-28 10:35:12,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:35:12,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:35:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:35:12,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:35:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:35:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:35:12,622 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 10:35:12,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:35:12,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:35:12,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:35:12,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:35:12,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:35:12,623 INFO L87 Difference]: Start difference. First operand 220279 states and 974873 transitions. Second operand 6 states. [2018-11-28 10:35:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:35:15,816 INFO L93 Difference]: Finished difference Result 441807 states and 1933390 transitions. [2018-11-28 10:35:15,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 10:35:15,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 10:35:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:35:17,045 INFO L225 Difference]: With dead ends: 441807 [2018-11-28 10:35:17,046 INFO L226 Difference]: Without dead ends: 440527 [2018-11-28 10:35:17,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 10:35:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440527 states. [2018-11-28 10:35:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440527 to 253351. [2018-11-28 10:35:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253351 states. [2018-11-28 10:35:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253351 states to 253351 states and 1112981 transitions. [2018-11-28 10:35:30,418 INFO L78 Accepts]: Start accepts. Automaton has 253351 states and 1112981 transitions. Word has length 68 [2018-11-28 10:35:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:35:30,418 INFO L480 AbstractCegarLoop]: Abstraction has 253351 states and 1112981 transitions. [2018-11-28 10:35:30,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:35:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 253351 states and 1112981 transitions. [2018-11-28 10:35:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 10:35:30,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:35:30,546 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 10:35:30,546 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:35:30,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:35:30,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1875791031, now seen corresponding path program 1 times [2018-11-28 10:35:30,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:35:30,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:35:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:35:30,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:35:30,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:35:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:35:30,585 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 10:35:30,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:35:30,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:35:30,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:35:30,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:35:30,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:35:30,586 INFO L87 Difference]: Start difference. First operand 253351 states and 1112981 transitions. Second operand 3 states. [2018-11-28 10:35:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:35:32,952 INFO L93 Difference]: Finished difference Result 309531 states and 1343548 transitions. [2018-11-28 10:35:32,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:35:32,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-28 10:35:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:35:33,785 INFO L225 Difference]: With dead ends: 309531 [2018-11-28 10:35:33,785 INFO L226 Difference]: Without dead ends: 309531 [2018-11-28 10:35:33,786 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 10:35:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309531 states. [2018-11-28 10:35:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309531 to 270479. [2018-11-28 10:35:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270479 states. [2018-11-28 10:35:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270479 states to 270479 states and 1183827 transitions. [2018-11-28 10:35:41,333 INFO L78 Accepts]: Start accepts. Automaton has 270479 states and 1183827 transitions. Word has length 70 [2018-11-28 10:35:41,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:35:41,334 INFO L480 AbstractCegarLoop]: Abstraction has 270479 states and 1183827 transitions. [2018-11-28 10:35:41,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:35:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 270479 states and 1183827 transitions. [2018-11-28 10:35:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 10:35:41,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:35:41,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:35:41,531 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:35:41,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:35:41,531 INFO L82 PathProgramCache]: Analyzing trace with hash 850728020, now seen corresponding path program 1 times [2018-11-28 10:35:41,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:35:41,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:35:41,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:35:41,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:35:41,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:35:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:35:41,623 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 10:35:41,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:35:41,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 10:35:41,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:35:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:35:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:35:41,624 INFO L87 Difference]: Start difference. First operand 270479 states and 1183827 transitions. Second operand 7 states. [2018-11-28 10:35:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:35:48,638 INFO L93 Difference]: Finished difference Result 481371 states and 2082099 transitions. [2018-11-28 10:35:48,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 10:35:48,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-28 10:35:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:35:49,958 INFO L225 Difference]: With dead ends: 481371 [2018-11-28 10:35:49,959 INFO L226 Difference]: Without dead ends: 480091 [2018-11-28 10:35:49,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-11-28 10:35:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480091 states. [2018-11-28 10:35:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480091 to 278295. [2018-11-28 10:35:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278295 states. [2018-11-28 10:35:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278295 states to 278295 states and 1216453 transitions. [2018-11-28 10:35:59,359 INFO L78 Accepts]: Start accepts. Automaton has 278295 states and 1216453 transitions. Word has length 74 [2018-11-28 10:35:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:35:59,359 INFO L480 AbstractCegarLoop]: Abstraction has 278295 states and 1216453 transitions. [2018-11-28 10:35:59,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:35:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 278295 states and 1216453 transitions. [2018-11-28 10:35:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 10:35:59,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:35:59,562 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] [2018-11-28 10:35:59,562 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:35:59,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:35:59,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1099982789, now seen corresponding path program 1 times [2018-11-28 10:35:59,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:35:59,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:35:59,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:35:59,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:35:59,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:35:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:35:59,623 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 10:35:59,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:35:59,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:35:59,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:35:59,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:35:59,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:35:59,624 INFO L87 Difference]: Start difference. First operand 278295 states and 1216453 transitions. Second operand 5 states. [2018-11-28 10:36:00,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:00,092 INFO L93 Difference]: Finished difference Result 103695 states and 412723 transitions. [2018-11-28 10:36:00,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:36:00,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-28 10:36:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:00,329 INFO L225 Difference]: With dead ends: 103695 [2018-11-28 10:36:00,330 INFO L226 Difference]: Without dead ends: 101383 [2018-11-28 10:36:00,330 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 10:36:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101383 states. [2018-11-28 10:36:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101383 to 101383. [2018-11-28 10:36:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101383 states. [2018-11-28 10:36:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101383 states to 101383 states and 404069 transitions. [2018-11-28 10:36:02,703 INFO L78 Accepts]: Start accepts. Automaton has 101383 states and 404069 transitions. Word has length 75 [2018-11-28 10:36:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:02,703 INFO L480 AbstractCegarLoop]: Abstraction has 101383 states and 404069 transitions. [2018-11-28 10:36:02,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:36:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 101383 states and 404069 transitions. [2018-11-28 10:36:02,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 10:36:02,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:02,761 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] [2018-11-28 10:36:02,761 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:02,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash 918546230, now seen corresponding path program 1 times [2018-11-28 10:36:02,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:02,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:02,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:02,828 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 10:36:02,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:02,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:36:02,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:36:02,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:36:02,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:36:02,829 INFO L87 Difference]: Start difference. First operand 101383 states and 404069 transitions. Second operand 4 states. [2018-11-28 10:36:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:03,550 INFO L93 Difference]: Finished difference Result 137259 states and 541050 transitions. [2018-11-28 10:36:03,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:36:03,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-28 10:36:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:03,865 INFO L225 Difference]: With dead ends: 137259 [2018-11-28 10:36:03,865 INFO L226 Difference]: Without dead ends: 137259 [2018-11-28 10:36:03,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:36:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137259 states. [2018-11-28 10:36:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137259 to 106891. [2018-11-28 10:36:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106891 states. [2018-11-28 10:36:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106891 states to 106891 states and 424746 transitions. [2018-11-28 10:36:06,284 INFO L78 Accepts]: Start accepts. Automaton has 106891 states and 424746 transitions. Word has length 81 [2018-11-28 10:36:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:06,284 INFO L480 AbstractCegarLoop]: Abstraction has 106891 states and 424746 transitions. [2018-11-28 10:36:06,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:36:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 106891 states and 424746 transitions. [2018-11-28 10:36:06,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 10:36:06,349 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:06,349 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] [2018-11-28 10:36:06,350 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:06,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:06,350 INFO L82 PathProgramCache]: Analyzing trace with hash 233799638, now seen corresponding path program 1 times [2018-11-28 10:36:06,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:06,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:06,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:06,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:06,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:09,005 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 10:36:09,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:09,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:36:09,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:36:09,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:36:09,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:36:09,006 INFO L87 Difference]: Start difference. First operand 106891 states and 424746 transitions. Second operand 4 states. [2018-11-28 10:36:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:10,010 INFO L93 Difference]: Finished difference Result 146326 states and 574564 transitions. [2018-11-28 10:36:10,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:36:10,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-28 10:36:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:10,350 INFO L225 Difference]: With dead ends: 146326 [2018-11-28 10:36:10,351 INFO L226 Difference]: Without dead ends: 146326 [2018-11-28 10:36:10,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:36:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146326 states. [2018-11-28 10:36:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146326 to 133031. [2018-11-28 10:36:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133031 states. [2018-11-28 10:36:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133031 states to 133031 states and 525207 transitions. [2018-11-28 10:36:12,733 INFO L78 Accepts]: Start accepts. Automaton has 133031 states and 525207 transitions. Word has length 81 [2018-11-28 10:36:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:12,733 INFO L480 AbstractCegarLoop]: Abstraction has 133031 states and 525207 transitions. [2018-11-28 10:36:12,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:36:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 133031 states and 525207 transitions. [2018-11-28 10:36:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 10:36:12,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:12,817 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] [2018-11-28 10:36:12,817 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:12,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:12,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1959280535, now seen corresponding path program 1 times [2018-11-28 10:36:12,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:12,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:12,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:12,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:12,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:12,906 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 10:36:12,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:12,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 10:36:12,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:36:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:36:12,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:36:12,907 INFO L87 Difference]: Start difference. First operand 133031 states and 525207 transitions. Second operand 7 states. [2018-11-28 10:36:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:15,149 INFO L93 Difference]: Finished difference Result 250046 states and 957790 transitions. [2018-11-28 10:36:15,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 10:36:15,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-11-28 10:36:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:15,722 INFO L225 Difference]: With dead ends: 250046 [2018-11-28 10:36:15,723 INFO L226 Difference]: Without dead ends: 247262 [2018-11-28 10:36:15,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2018-11-28 10:36:16,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247262 states. [2018-11-28 10:36:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247262 to 150765. [2018-11-28 10:36:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150765 states. [2018-11-28 10:36:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150765 states to 150765 states and 587328 transitions. [2018-11-28 10:36:19,927 INFO L78 Accepts]: Start accepts. Automaton has 150765 states and 587328 transitions. Word has length 81 [2018-11-28 10:36:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:19,928 INFO L480 AbstractCegarLoop]: Abstraction has 150765 states and 587328 transitions. [2018-11-28 10:36:19,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:36:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 150765 states and 587328 transitions. [2018-11-28 10:36:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 10:36:20,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:20,046 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] [2018-11-28 10:36:20,046 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:20,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:20,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1665877528, now seen corresponding path program 1 times [2018-11-28 10:36:20,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:20,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:20,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:20,122 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 10:36:20,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:20,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:36:20,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:36:20,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:36:20,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:36:20,123 INFO L87 Difference]: Start difference. First operand 150765 states and 587328 transitions. Second operand 6 states. [2018-11-28 10:36:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:21,411 INFO L93 Difference]: Finished difference Result 256303 states and 994823 transitions. [2018-11-28 10:36:21,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:36:21,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-28 10:36:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:22,028 INFO L225 Difference]: With dead ends: 256303 [2018-11-28 10:36:22,028 INFO L226 Difference]: Without dead ends: 256303 [2018-11-28 10:36:22,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:36:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256303 states. [2018-11-28 10:36:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256303 to 160843. [2018-11-28 10:36:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160843 states. [2018-11-28 10:36:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160843 states to 160843 states and 623038 transitions. [2018-11-28 10:36:26,408 INFO L78 Accepts]: Start accepts. Automaton has 160843 states and 623038 transitions. Word has length 81 [2018-11-28 10:36:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:26,408 INFO L480 AbstractCegarLoop]: Abstraction has 160843 states and 623038 transitions. [2018-11-28 10:36:26,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:36:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 160843 states and 623038 transitions. [2018-11-28 10:36:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 10:36:26,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:26,528 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] [2018-11-28 10:36:26,528 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:26,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:26,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1411140983, now seen corresponding path program 1 times [2018-11-28 10:36:26,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:26,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:26,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:26,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:26,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:26,603 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 10:36:26,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:26,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:36:26,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:36:26,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:36:26,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:36:26,604 INFO L87 Difference]: Start difference. First operand 160843 states and 623038 transitions. Second operand 6 states. [2018-11-28 10:36:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:26,686 INFO L93 Difference]: Finished difference Result 22827 states and 76782 transitions. [2018-11-28 10:36:26,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:36:26,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-28 10:36:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:26,711 INFO L225 Difference]: With dead ends: 22827 [2018-11-28 10:36:26,711 INFO L226 Difference]: Without dead ends: 20023 [2018-11-28 10:36:26,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:36:26,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20023 states. [2018-11-28 10:36:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20023 to 18683. [2018-11-28 10:36:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18683 states. [2018-11-28 10:36:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18683 states to 18683 states and 63127 transitions. [2018-11-28 10:36:26,924 INFO L78 Accepts]: Start accepts. Automaton has 18683 states and 63127 transitions. Word has length 81 [2018-11-28 10:36:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:26,924 INFO L480 AbstractCegarLoop]: Abstraction has 18683 states and 63127 transitions. [2018-11-28 10:36:26,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:36:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 18683 states and 63127 transitions. [2018-11-28 10:36:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 10:36:26,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:26,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:26,941 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:26,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:26,941 INFO L82 PathProgramCache]: Analyzing trace with hash 853175647, now seen corresponding path program 1 times [2018-11-28 10:36:26,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:26,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:26,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:26,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:26,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:26,996 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 10:36:26,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:26,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:36:26,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 10:36:26,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:36:26,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:36:26,999 INFO L87 Difference]: Start difference. First operand 18683 states and 63127 transitions. Second operand 4 states. [2018-11-28 10:36:27,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:27,131 INFO L93 Difference]: Finished difference Result 21882 states and 73174 transitions. [2018-11-28 10:36:27,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:36:27,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-28 10:36:27,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:27,157 INFO L225 Difference]: With dead ends: 21882 [2018-11-28 10:36:27,157 INFO L226 Difference]: Without dead ends: 21882 [2018-11-28 10:36:27,157 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 10:36:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21882 states. [2018-11-28 10:36:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21882 to 21270. [2018-11-28 10:36:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21270 states. [2018-11-28 10:36:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21270 states to 21270 states and 71339 transitions. [2018-11-28 10:36:27,400 INFO L78 Accepts]: Start accepts. Automaton has 21270 states and 71339 transitions. Word has length 102 [2018-11-28 10:36:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:27,400 INFO L480 AbstractCegarLoop]: Abstraction has 21270 states and 71339 transitions. [2018-11-28 10:36:27,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 10:36:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 21270 states and 71339 transitions. [2018-11-28 10:36:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 10:36:27,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:27,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:27,420 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:27,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:27,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1470852192, now seen corresponding path program 1 times [2018-11-28 10:36:27,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:27,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:27,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:27,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:27,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:27,473 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 10:36:27,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:27,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:36:27,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:36:27,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:36:27,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:36:27,474 INFO L87 Difference]: Start difference. First operand 21270 states and 71339 transitions. Second operand 3 states. [2018-11-28 10:36:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:27,577 INFO L93 Difference]: Finished difference Result 21830 states and 72932 transitions. [2018-11-28 10:36:27,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:36:27,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-28 10:36:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:27,602 INFO L225 Difference]: With dead ends: 21830 [2018-11-28 10:36:27,602 INFO L226 Difference]: Without dead ends: 21830 [2018-11-28 10:36:27,603 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 10:36:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21830 states. [2018-11-28 10:36:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21830 to 21560. [2018-11-28 10:36:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21560 states. [2018-11-28 10:36:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21560 states to 21560 states and 72171 transitions. [2018-11-28 10:36:27,843 INFO L78 Accepts]: Start accepts. Automaton has 21560 states and 72171 transitions. Word has length 102 [2018-11-28 10:36:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:27,844 INFO L480 AbstractCegarLoop]: Abstraction has 21560 states and 72171 transitions. [2018-11-28 10:36:27,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:36:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 21560 states and 72171 transitions. [2018-11-28 10:36:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 10:36:27,864 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:27,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:27,865 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:27,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:27,865 INFO L82 PathProgramCache]: Analyzing trace with hash -977462835, now seen corresponding path program 1 times [2018-11-28 10:36:27,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:27,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:27,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:27,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:27,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:27,948 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 10:36:27,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:27,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 10:36:27,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 10:36:27,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:36:27,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:36:27,949 INFO L87 Difference]: Start difference. First operand 21560 states and 72171 transitions. Second operand 8 states. [2018-11-28 10:36:28,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:28,547 INFO L93 Difference]: Finished difference Result 42420 states and 139457 transitions. [2018-11-28 10:36:28,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 10:36:28,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-11-28 10:36:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:28,599 INFO L225 Difference]: With dead ends: 42420 [2018-11-28 10:36:28,599 INFO L226 Difference]: Without dead ends: 42292 [2018-11-28 10:36:28,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 10:36:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42292 states. [2018-11-28 10:36:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42292 to 23911. [2018-11-28 10:36:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23911 states. [2018-11-28 10:36:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23911 states to 23911 states and 79712 transitions. [2018-11-28 10:36:29,401 INFO L78 Accepts]: Start accepts. Automaton has 23911 states and 79712 transitions. Word has length 102 [2018-11-28 10:36:29,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:29,401 INFO L480 AbstractCegarLoop]: Abstraction has 23911 states and 79712 transitions. [2018-11-28 10:36:29,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 10:36:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 23911 states and 79712 transitions. [2018-11-28 10:36:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 10:36:29,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:29,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:29,423 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:29,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:29,423 INFO L82 PathProgramCache]: Analyzing trace with hash -15848818, now seen corresponding path program 1 times [2018-11-28 10:36:29,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:29,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:29,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:29,491 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 10:36:29,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:29,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:36:29,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:36:29,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:36:29,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:36:29,492 INFO L87 Difference]: Start difference. First operand 23911 states and 79712 transitions. Second operand 5 states. [2018-11-28 10:36:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:29,684 INFO L93 Difference]: Finished difference Result 28083 states and 92655 transitions. [2018-11-28 10:36:29,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:36:29,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-11-28 10:36:29,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:29,719 INFO L225 Difference]: With dead ends: 28083 [2018-11-28 10:36:29,719 INFO L226 Difference]: Without dead ends: 28083 [2018-11-28 10:36:29,720 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 10:36:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28083 states. [2018-11-28 10:36:29,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28083 to 24516. [2018-11-28 10:36:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24516 states. [2018-11-28 10:36:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24516 states to 24516 states and 81456 transitions. [2018-11-28 10:36:29,992 INFO L78 Accepts]: Start accepts. Automaton has 24516 states and 81456 transitions. Word has length 102 [2018-11-28 10:36:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:29,993 INFO L480 AbstractCegarLoop]: Abstraction has 24516 states and 81456 transitions. [2018-11-28 10:36:29,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:36:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 24516 states and 81456 transitions. [2018-11-28 10:36:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 10:36:30,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:30,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:30,013 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:30,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash -688642701, now seen corresponding path program 1 times [2018-11-28 10:36:30,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:30,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:30,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:30,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:30,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:30,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 10:36:30,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:30,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 10:36:30,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:36:30,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:36:30,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:36:30,086 INFO L87 Difference]: Start difference. First operand 24516 states and 81456 transitions. Second operand 7 states. [2018-11-28 10:36:30,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:30,330 INFO L93 Difference]: Finished difference Result 27823 states and 91975 transitions. [2018-11-28 10:36:30,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:36:30,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-11-28 10:36:30,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:30,368 INFO L225 Difference]: With dead ends: 27823 [2018-11-28 10:36:30,368 INFO L226 Difference]: Without dead ends: 27823 [2018-11-28 10:36:30,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:36:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27823 states. [2018-11-28 10:36:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27823 to 25256. [2018-11-28 10:36:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25256 states. [2018-11-28 10:36:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25256 states to 25256 states and 83688 transitions. [2018-11-28 10:36:30,689 INFO L78 Accepts]: Start accepts. Automaton has 25256 states and 83688 transitions. Word has length 102 [2018-11-28 10:36:30,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:30,689 INFO L480 AbstractCegarLoop]: Abstraction has 25256 states and 83688 transitions. [2018-11-28 10:36:30,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:36:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 25256 states and 83688 transitions. [2018-11-28 10:36:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 10:36:30,712 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:30,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:30,713 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:30,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:30,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1282296756, now seen corresponding path program 1 times [2018-11-28 10:36:30,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:30,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:30,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:30,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:30,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:30,782 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 10:36:30,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:30,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:36:30,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:36:30,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:36:30,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:36:30,783 INFO L87 Difference]: Start difference. First operand 25256 states and 83688 transitions. Second operand 5 states. [2018-11-28 10:36:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:30,921 INFO L93 Difference]: Finished difference Result 21633 states and 71970 transitions. [2018-11-28 10:36:30,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:36:30,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-11-28 10:36:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:30,950 INFO L225 Difference]: With dead ends: 21633 [2018-11-28 10:36:30,951 INFO L226 Difference]: Without dead ends: 21633 [2018-11-28 10:36:30,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:36:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21633 states. [2018-11-28 10:36:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21633 to 20833. [2018-11-28 10:36:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2018-11-28 10:36:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 69595 transitions. [2018-11-28 10:36:31,207 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 69595 transitions. Word has length 102 [2018-11-28 10:36:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:31,207 INFO L480 AbstractCegarLoop]: Abstraction has 20833 states and 69595 transitions. [2018-11-28 10:36:31,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:36:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 69595 transitions. [2018-11-28 10:36:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 10:36:31,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:31,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:31,228 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:31,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:31,228 INFO L82 PathProgramCache]: Analyzing trace with hash 114990225, now seen corresponding path program 1 times [2018-11-28 10:36:31,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:31,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:31,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:31,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:31,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:31,317 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 10:36:31,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:31,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:36:31,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:36:31,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:36:31,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:36:31,318 INFO L87 Difference]: Start difference. First operand 20833 states and 69595 transitions. Second operand 6 states. [2018-11-28 10:36:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:31,410 INFO L93 Difference]: Finished difference Result 16993 states and 55387 transitions. [2018-11-28 10:36:31,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:36:31,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-11-28 10:36:31,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:31,432 INFO L225 Difference]: With dead ends: 16993 [2018-11-28 10:36:31,432 INFO L226 Difference]: Without dead ends: 16993 [2018-11-28 10:36:31,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:36:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16993 states. [2018-11-28 10:36:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16993 to 14403. [2018-11-28 10:36:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14403 states. [2018-11-28 10:36:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14403 states to 14403 states and 47393 transitions. [2018-11-28 10:36:31,611 INFO L78 Accepts]: Start accepts. Automaton has 14403 states and 47393 transitions. Word has length 102 [2018-11-28 10:36:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:31,611 INFO L480 AbstractCegarLoop]: Abstraction has 14403 states and 47393 transitions. [2018-11-28 10:36:31,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:36:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 14403 states and 47393 transitions. [2018-11-28 10:36:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 10:36:31,625 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:31,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:31,626 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:31,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:31,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1432893840, now seen corresponding path program 1 times [2018-11-28 10:36:31,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:31,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:31,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:31,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:31,706 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 10:36:31,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:31,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:36:31,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:36:31,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:36:31,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:36:31,707 INFO L87 Difference]: Start difference. First operand 14403 states and 47393 transitions. Second operand 6 states. [2018-11-28 10:36:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:31,817 INFO L93 Difference]: Finished difference Result 16273 states and 52279 transitions. [2018-11-28 10:36:31,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 10:36:31,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-11-28 10:36:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:31,844 INFO L225 Difference]: With dead ends: 16273 [2018-11-28 10:36:31,844 INFO L226 Difference]: Without dead ends: 16273 [2018-11-28 10:36:31,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:36:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16273 states. [2018-11-28 10:36:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16273 to 14803. [2018-11-28 10:36:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14803 states. [2018-11-28 10:36:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14803 states to 14803 states and 48193 transitions. [2018-11-28 10:36:32,034 INFO L78 Accepts]: Start accepts. Automaton has 14803 states and 48193 transitions. Word has length 104 [2018-11-28 10:36:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:32,034 INFO L480 AbstractCegarLoop]: Abstraction has 14803 states and 48193 transitions. [2018-11-28 10:36:32,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:36:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 14803 states and 48193 transitions. [2018-11-28 10:36:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 10:36:32,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:32,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:32,048 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:32,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash 984197201, now seen corresponding path program 1 times [2018-11-28 10:36:32,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:32,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:32,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:32,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:32,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:32,333 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 10:36:32,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:32,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:36:32,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:36:32,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:36:32,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:36:32,334 INFO L87 Difference]: Start difference. First operand 14803 states and 48193 transitions. Second operand 5 states. [2018-11-28 10:36:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:32,472 INFO L93 Difference]: Finished difference Result 16595 states and 53953 transitions. [2018-11-28 10:36:32,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:36:32,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-11-28 10:36:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:32,493 INFO L225 Difference]: With dead ends: 16595 [2018-11-28 10:36:32,493 INFO L226 Difference]: Without dead ends: 16467 [2018-11-28 10:36:32,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:36:32,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16467 states. [2018-11-28 10:36:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16467 to 12742. [2018-11-28 10:36:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12742 states. [2018-11-28 10:36:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12742 states to 12742 states and 41555 transitions. [2018-11-28 10:36:32,666 INFO L78 Accepts]: Start accepts. Automaton has 12742 states and 41555 transitions. Word has length 104 [2018-11-28 10:36:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:32,666 INFO L480 AbstractCegarLoop]: Abstraction has 12742 states and 41555 transitions. [2018-11-28 10:36:32,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:36:32,666 INFO L276 IsEmpty]: Start isEmpty. Operand 12742 states and 41555 transitions. [2018-11-28 10:36:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 10:36:32,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:32,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:32,678 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:32,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:32,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2066005614, now seen corresponding path program 1 times [2018-11-28 10:36:32,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:32,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:32,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:32,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:32,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:32,776 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 10:36:32,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:32,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 10:36:32,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:36:32,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:36:32,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:36:32,777 INFO L87 Difference]: Start difference. First operand 12742 states and 41555 transitions. Second operand 7 states. [2018-11-28 10:36:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:33,005 INFO L93 Difference]: Finished difference Result 24662 states and 80516 transitions. [2018-11-28 10:36:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:36:33,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-11-28 10:36:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:33,021 INFO L225 Difference]: With dead ends: 24662 [2018-11-28 10:36:33,021 INFO L226 Difference]: Without dead ends: 12007 [2018-11-28 10:36:33,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 10:36:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12007 states. [2018-11-28 10:36:33,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12007 to 11799. [2018-11-28 10:36:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11799 states. [2018-11-28 10:36:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11799 states to 11799 states and 38591 transitions. [2018-11-28 10:36:33,160 INFO L78 Accepts]: Start accepts. Automaton has 11799 states and 38591 transitions. Word has length 104 [2018-11-28 10:36:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:33,160 INFO L480 AbstractCegarLoop]: Abstraction has 11799 states and 38591 transitions. [2018-11-28 10:36:33,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:36:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 11799 states and 38591 transitions. [2018-11-28 10:36:33,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 10:36:33,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:33,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:33,171 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:33,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash 834644247, now seen corresponding path program 1 times [2018-11-28 10:36:33,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:33,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:33,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:33,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:33,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:33,273 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 10:36:33,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:33,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 10:36:33,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:36:33,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:36:33,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:36:33,274 INFO L87 Difference]: Start difference. First operand 11799 states and 38591 transitions. Second operand 7 states. [2018-11-28 10:36:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:33,449 INFO L93 Difference]: Finished difference Result 12862 states and 41560 transitions. [2018-11-28 10:36:33,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 10:36:33,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-11-28 10:36:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:33,465 INFO L225 Difference]: With dead ends: 12862 [2018-11-28 10:36:33,465 INFO L226 Difference]: Without dead ends: 12862 [2018-11-28 10:36:33,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-28 10:36:33,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12862 states. [2018-11-28 10:36:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12862 to 12158. [2018-11-28 10:36:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12158 states. [2018-11-28 10:36:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12158 states to 12158 states and 39528 transitions. [2018-11-28 10:36:33,612 INFO L78 Accepts]: Start accepts. Automaton has 12158 states and 39528 transitions. Word has length 104 [2018-11-28 10:36:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:33,612 INFO L480 AbstractCegarLoop]: Abstraction has 12158 states and 39528 transitions. [2018-11-28 10:36:33,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:36:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 12158 states and 39528 transitions. [2018-11-28 10:36:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 10:36:33,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:33,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:33,624 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:33,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:33,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1827519050, now seen corresponding path program 2 times [2018-11-28 10:36:33,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:33,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:33,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:33,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:33,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:36:33,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:33,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 10:36:33,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 10:36:33,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 10:36:33,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 10:36:33,755 INFO L87 Difference]: Start difference. First operand 12158 states and 39528 transitions. Second operand 12 states. [2018-11-28 10:36:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:34,220 INFO L93 Difference]: Finished difference Result 20186 states and 66377 transitions. [2018-11-28 10:36:34,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 10:36:34,220 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2018-11-28 10:36:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:36:34,239 INFO L225 Difference]: With dead ends: 20186 [2018-11-28 10:36:34,239 INFO L226 Difference]: Without dead ends: 15642 [2018-11-28 10:36:34,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-11-28 10:36:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15642 states. [2018-11-28 10:36:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15642 to 14694. [2018-11-28 10:36:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14694 states. [2018-11-28 10:36:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14694 states to 14694 states and 47266 transitions. [2018-11-28 10:36:34,417 INFO L78 Accepts]: Start accepts. Automaton has 14694 states and 47266 transitions. Word has length 104 [2018-11-28 10:36:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:36:34,417 INFO L480 AbstractCegarLoop]: Abstraction has 14694 states and 47266 transitions. [2018-11-28 10:36:34,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 10:36:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 14694 states and 47266 transitions. [2018-11-28 10:36:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 10:36:34,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:36:34,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:34,431 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:36:34,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:34,431 INFO L82 PathProgramCache]: Analyzing trace with hash 983882008, now seen corresponding path program 3 times [2018-11-28 10:36:34,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:34,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:34,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:34,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:36:34,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:34,494 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 10:36:34,600 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 10:36:34,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:36:34 BasicIcfg [2018-11-28 10:36:34,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 10:36:34,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:36:34,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:36:34,602 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:36:34,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:45" (3/4) ... [2018-11-28 10:36:34,605 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 10:36:34,738 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8bbb0647-4f58-4967-8b5b-2de8eb9fc564/bin-2019/uautomizer/witness.graphml [2018-11-28 10:36:34,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:36:34,739 INFO L168 Benchmark]: Toolchain (without parser) took 170059.17 ms. Allocated memory was 1.0 GB in the beginning and 8.5 GB in the end (delta: 7.4 GB). Free memory was 951.3 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.3 GB. Max. memory is 11.5 GB. [2018-11-28 10:36:34,740 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:36:34,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:34,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.17 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:34,741 INFO L168 Benchmark]: Boogie Preprocessor took 23.18 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 10:36:34,741 INFO L168 Benchmark]: RCFGBuilder took 446.37 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: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:34,741 INFO L168 Benchmark]: TraceAbstraction took 168997.46 ms. Allocated memory was 1.2 GB in the beginning and 8.5 GB in the end (delta: 7.3 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.2 GB. Max. memory is 11.5 GB. [2018-11-28 10:36:34,742 INFO L168 Benchmark]: Witness Printer took 136.16 ms. Allocated memory is still 8.5 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:34,743 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.17 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.18 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 446.37 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: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 168997.46 ms. Allocated memory was 1.2 GB in the beginning and 8.5 GB in the end (delta: 7.3 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.2 GB. Max. memory is 11.5 GB. * Witness Printer took 136.16 ms. Allocated memory is still 8.5 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t1204; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t1204, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1205; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1205, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1206; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1206, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 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=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L729] EXPR 2 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=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L729] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 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 [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 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 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -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) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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 [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -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 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 200 locations, 3 error locations. UNSAFE Result, 168.9s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 49.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8226 SDtfs, 8667 SDslu, 18941 SDs, 0 SdLazy, 6715 SolverSat, 426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 91 SyntacticMatches, 21 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278295occurred in iteration=11, 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: 97.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 1231494 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2489 NumberOfCodeBlocks, 2489 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2356 ConstructedInterpolants, 0 QuantifiedInterpolants, 470271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...