./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec62b1fa1dfab5118959156fde533654a621048a ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:10:50,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:10:50,232 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:10:50,238 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:10:50,239 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:10:50,239 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:10:50,240 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:10:50,240 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:10:50,241 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:10:50,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:10:50,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:10:50,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:10:50,243 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:10:50,243 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:10:50,244 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:10:50,244 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:10:50,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:10:50,245 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:10:50,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:10:50,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:10:50,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:10:50,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:10:50,249 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:10:50,249 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:10:50,249 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:10:50,250 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:10:50,250 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:10:50,251 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:10:50,251 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:10:50,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:10:50,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:10:50,252 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:10:50,252 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:10:50,252 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:10:50,253 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:10:50,253 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:10:50,253 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:10:50,260 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:10:50,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:10:50,261 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:10:50,261 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:10:50,261 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:10:50,261 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:10:50,261 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:10:50,262 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:10:50,262 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:10:50,262 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:10:50,262 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:10:50,262 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:10:50,262 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:10:50,262 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:10:50,263 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:10:50,263 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:10:50,263 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:10:50,263 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:10:50,263 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:10:50,263 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:10:50,263 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:10:50,263 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:10:50,263 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:10:50,263 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:10:50,264 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:10:50,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:10:50,264 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:10:50,264 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:10:50,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:10:50,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:10:50,264 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:10:50,264 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:10:50,264 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:10:50,264 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:10:50,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:10:50,265 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:10:50,265 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan 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 -> Taipan 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 -> ec62b1fa1dfab5118959156fde533654a621048a [2018-12-09 19:10:50,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:10:50,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:10:50,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:10:50,295 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:10:50,296 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:10:50,296 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc_false-unreach-call.i [2018-12-09 19:10:50,333 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan/data/a95eca1d8/b4171ddc405a4809849fdaf1900274b8/FLAG75f7a2a5e [2018-12-09 19:10:50,768 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:10:50,768 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc_false-unreach-call.i [2018-12-09 19:10:50,776 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan/data/a95eca1d8/b4171ddc405a4809849fdaf1900274b8/FLAG75f7a2a5e [2018-12-09 19:10:50,784 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan/data/a95eca1d8/b4171ddc405a4809849fdaf1900274b8 [2018-12-09 19:10:50,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:10:50,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:10:50,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:10:50,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:10:50,790 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:10:50,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:10:50" (1/1) ... [2018-12-09 19:10:50,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:50, skipping insertion in model container [2018-12-09 19:10:50,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:10:50" (1/1) ... [2018-12-09 19:10:50,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:10:50,820 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:10:51,016 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:10:51,023 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:10:51,136 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:10:51,183 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:10:51,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:51 WrapperNode [2018-12-09 19:10:51,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:10:51,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:10:51,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:10:51,184 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:10:51,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:51" (1/1) ... [2018-12-09 19:10:51,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:51" (1/1) ... [2018-12-09 19:10:51,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:10:51,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:10:51,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:10:51,220 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:10:51,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:51" (1/1) ... [2018-12-09 19:10:51,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:51" (1/1) ... [2018-12-09 19:10:51,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:51" (1/1) ... [2018-12-09 19:10:51,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:51" (1/1) ... [2018-12-09 19:10:51,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:51" (1/1) ... [2018-12-09 19:10:51,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:51" (1/1) ... [2018-12-09 19:10:51,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:51" (1/1) ... [2018-12-09 19:10:51,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:10:51,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:10:51,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:10:51,253 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:10:51,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:10:51,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:10:51,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:10:51,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 19:10:51,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:10:51,290 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 19:10:51,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 19:10:51,291 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 19:10:51,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 19:10:51,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 19:10:51,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:10:51,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:10:51,292 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 19:10:51,725 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:10:51,725 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 19:10:51,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:51 BoogieIcfgContainer [2018-12-09 19:10:51,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:10:51,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:10:51,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:10:51,728 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:10:51,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:10:50" (1/3) ... [2018-12-09 19:10:51,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49381c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:10:51, skipping insertion in model container [2018-12-09 19:10:51,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:51" (2/3) ... [2018-12-09 19:10:51,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49381c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:10:51, skipping insertion in model container [2018-12-09 19:10:51,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:51" (3/3) ... [2018-12-09 19:10:51,731 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_pso.oepc_false-unreach-call.i [2018-12-09 19:10:51,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,765 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,765 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,765 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,766 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,766 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,766 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,766 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,766 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,769 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,769 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,769 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,769 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,769 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,769 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,772 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,773 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,795 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,795 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,795 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,795 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,795 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,795 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,795 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,795 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,801 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,801 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,801 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,801 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,801 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,801 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,801 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,801 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:51,811 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 19:10:51,811 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:10:51,817 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 19:10:51,826 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 19:10:51,841 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:10:51,841 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:10:51,841 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:10:51,841 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:10:51,841 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:10:51,842 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:10:51,842 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:10:51,842 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:10:51,849 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 226places, 306 transitions [2018-12-09 19:11:04,764 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 148584 states. [2018-12-09 19:11:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 148584 states. [2018-12-09 19:11:04,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 19:11:04,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:04,770 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] [2018-12-09 19:11:04,772 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:04,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:04,775 INFO L82 PathProgramCache]: Analyzing trace with hash -614504401, now seen corresponding path program 1 times [2018-12-09 19:11:04,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:04,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:04,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:04,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-12-09 19:11:04,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:04,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:11:04,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:04,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:11:04,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:11:04,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:11:04,920 INFO L87 Difference]: Start difference. First operand 148584 states. Second operand 4 states. [2018-12-09 19:11:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:06,491 INFO L93 Difference]: Finished difference Result 272092 states and 1113406 transitions. [2018-12-09 19:11:06,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:11:06,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-09 19:11:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:07,243 INFO L225 Difference]: With dead ends: 272092 [2018-12-09 19:11:07,243 INFO L226 Difference]: Without dead ends: 243812 [2018-12-09 19:11:07,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:11:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243812 states. [2018-12-09 19:11:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243812 to 140486. [2018-12-09 19:11:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140486 states. [2018-12-09 19:11:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140486 states to 140486 states and 574639 transitions. [2018-12-09 19:11:14,005 INFO L78 Accepts]: Start accepts. Automaton has 140486 states and 574639 transitions. Word has length 33 [2018-12-09 19:11:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:14,006 INFO L480 AbstractCegarLoop]: Abstraction has 140486 states and 574639 transitions. [2018-12-09 19:11:14,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:11:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 140486 states and 574639 transitions. [2018-12-09 19:11:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 19:11:14,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:14,010 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-12-09 19:11:14,011 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:14,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:14,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1643249749, now seen corresponding path program 1 times [2018-12-09 19:11:14,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:14,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:14,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:14,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:14,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:14,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:14,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:11:14,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:14,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:11:14,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:11:14,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:11:14,057 INFO L87 Difference]: Start difference. First operand 140486 states and 574639 transitions. Second operand 4 states. [2018-12-09 19:11:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:14,259 INFO L93 Difference]: Finished difference Result 33560 states and 119400 transitions. [2018-12-09 19:11:14,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:11:14,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 19:11:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:14,318 INFO L225 Difference]: With dead ends: 33560 [2018-12-09 19:11:14,318 INFO L226 Difference]: Without dead ends: 31742 [2018-12-09 19:11:14,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:11:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31742 states. [2018-12-09 19:11:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31742 to 31742. [2018-12-09 19:11:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31742 states. [2018-12-09 19:11:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31742 states to 31742 states and 112962 transitions. [2018-12-09 19:11:15,067 INFO L78 Accepts]: Start accepts. Automaton has 31742 states and 112962 transitions. Word has length 45 [2018-12-09 19:11:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:15,067 INFO L480 AbstractCegarLoop]: Abstraction has 31742 states and 112962 transitions. [2018-12-09 19:11:15,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:11:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 31742 states and 112962 transitions. [2018-12-09 19:11:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:11:15,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:15,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:15,069 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:15,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:15,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1175559771, now seen corresponding path program 1 times [2018-12-09 19:11:15,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:15,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:15,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:15,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:15,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:15,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:15,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:11:15,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:15,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:11:15,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:11:15,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:11:15,147 INFO L87 Difference]: Start difference. First operand 31742 states and 112962 transitions. Second operand 5 states. [2018-12-09 19:11:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:15,610 INFO L93 Difference]: Finished difference Result 63360 states and 222752 transitions. [2018-12-09 19:11:15,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:11:15,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 19:11:15,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:15,735 INFO L225 Difference]: With dead ends: 63360 [2018-12-09 19:11:15,736 INFO L226 Difference]: Without dead ends: 63250 [2018-12-09 19:11:15,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:11:15,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63250 states. [2018-12-09 19:11:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63250 to 39276. [2018-12-09 19:11:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39276 states. [2018-12-09 19:11:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39276 states to 39276 states and 136384 transitions. [2018-12-09 19:11:16,382 INFO L78 Accepts]: Start accepts. Automaton has 39276 states and 136384 transitions. Word has length 46 [2018-12-09 19:11:16,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:16,383 INFO L480 AbstractCegarLoop]: Abstraction has 39276 states and 136384 transitions. [2018-12-09 19:11:16,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:11:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 39276 states and 136384 transitions. [2018-12-09 19:11:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 19:11:16,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:16,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:16,385 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:16,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1108738337, now seen corresponding path program 1 times [2018-12-09 19:11:16,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:16,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:16,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:16,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:16,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:16,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:16,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:11:16,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:16,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:11:16,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:11:16,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:11:16,425 INFO L87 Difference]: Start difference. First operand 39276 states and 136384 transitions. Second operand 3 states. [2018-12-09 19:11:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:16,659 INFO L93 Difference]: Finished difference Result 60855 states and 203999 transitions. [2018-12-09 19:11:16,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:11:16,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 19:11:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:16,755 INFO L225 Difference]: With dead ends: 60855 [2018-12-09 19:11:16,755 INFO L226 Difference]: Without dead ends: 60855 [2018-12-09 19:11:16,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:11:16,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60855 states. [2018-12-09 19:11:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60855 to 54767. [2018-12-09 19:11:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54767 states. [2018-12-09 19:11:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54767 states to 54767 states and 184631 transitions. [2018-12-09 19:11:17,801 INFO L78 Accepts]: Start accepts. Automaton has 54767 states and 184631 transitions. Word has length 48 [2018-12-09 19:11:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:17,802 INFO L480 AbstractCegarLoop]: Abstraction has 54767 states and 184631 transitions. [2018-12-09 19:11:17,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:11:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 54767 states and 184631 transitions. [2018-12-09 19:11:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 19:11:17,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:17,803 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-12-09 19:11:17,804 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:17,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:17,804 INFO L82 PathProgramCache]: Analyzing trace with hash 28084908, now seen corresponding path program 1 times [2018-12-09 19:11:17,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:17,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:17,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:17,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:17,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:17,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:17,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:11:17,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:17,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:11:17,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:11:17,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:11:17,888 INFO L87 Difference]: Start difference. First operand 54767 states and 184631 transitions. Second operand 8 states. [2018-12-09 19:11:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:18,786 INFO L93 Difference]: Finished difference Result 69731 states and 227684 transitions. [2018-12-09 19:11:18,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:11:18,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-12-09 19:11:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:18,894 INFO L225 Difference]: With dead ends: 69731 [2018-12-09 19:11:18,894 INFO L226 Difference]: Without dead ends: 69607 [2018-12-09 19:11:18,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:11:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69607 states. [2018-12-09 19:11:19,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69607 to 56775. [2018-12-09 19:11:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56775 states. [2018-12-09 19:11:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56775 states to 56775 states and 189920 transitions. [2018-12-09 19:11:19,744 INFO L78 Accepts]: Start accepts. Automaton has 56775 states and 189920 transitions. Word has length 52 [2018-12-09 19:11:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:19,745 INFO L480 AbstractCegarLoop]: Abstraction has 56775 states and 189920 transitions. [2018-12-09 19:11:19,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:11:19,745 INFO L276 IsEmpty]: Start isEmpty. Operand 56775 states and 189920 transitions. [2018-12-09 19:11:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:11:19,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:19,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:19,749 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:19,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:19,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1485356584, now seen corresponding path program 1 times [2018-12-09 19:11:19,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:19,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:19,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:19,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:19,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:19,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:19,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:11:19,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:19,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:11:19,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:11:19,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:11:19,799 INFO L87 Difference]: Start difference. First operand 56775 states and 189920 transitions. Second operand 6 states. [2018-12-09 19:11:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:20,537 INFO L93 Difference]: Finished difference Result 110773 states and 367372 transitions. [2018-12-09 19:11:20,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:11:20,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 19:11:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:20,723 INFO L225 Difference]: With dead ends: 110773 [2018-12-09 19:11:20,723 INFO L226 Difference]: Without dead ends: 110717 [2018-12-09 19:11:20,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:11:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110717 states. [2018-12-09 19:11:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110717 to 72935. [2018-12-09 19:11:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72935 states. [2018-12-09 19:11:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72935 states to 72935 states and 238398 transitions. [2018-12-09 19:11:22,087 INFO L78 Accepts]: Start accepts. Automaton has 72935 states and 238398 transitions. Word has length 62 [2018-12-09 19:11:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:22,087 INFO L480 AbstractCegarLoop]: Abstraction has 72935 states and 238398 transitions. [2018-12-09 19:11:22,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:11:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 72935 states and 238398 transitions. [2018-12-09 19:11:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:11:22,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:22,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:22,095 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:22,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:22,095 INFO L82 PathProgramCache]: Analyzing trace with hash -260667191, now seen corresponding path program 1 times [2018-12-09 19:11:22,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:22,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:22,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:22,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:22,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:22,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:22,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:11:22,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:22,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:11:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:11:22,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:11:22,198 INFO L87 Difference]: Start difference. First operand 72935 states and 238398 transitions. Second operand 9 states. [2018-12-09 19:11:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:23,888 INFO L93 Difference]: Finished difference Result 96796 states and 308161 transitions. [2018-12-09 19:11:23,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 19:11:23,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-09 19:11:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:24,031 INFO L225 Difference]: With dead ends: 96796 [2018-12-09 19:11:24,031 INFO L226 Difference]: Without dead ends: 96724 [2018-12-09 19:11:24,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2018-12-09 19:11:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96724 states. [2018-12-09 19:11:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96724 to 81133. [2018-12-09 19:11:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81133 states. [2018-12-09 19:11:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81133 states to 81133 states and 261702 transitions. [2018-12-09 19:11:25,294 INFO L78 Accepts]: Start accepts. Automaton has 81133 states and 261702 transitions. Word has length 68 [2018-12-09 19:11:25,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:25,295 INFO L480 AbstractCegarLoop]: Abstraction has 81133 states and 261702 transitions. [2018-12-09 19:11:25,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:11:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 81133 states and 261702 transitions. [2018-12-09 19:11:25,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 19:11:25,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:25,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:25,308 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:25,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:25,308 INFO L82 PathProgramCache]: Analyzing trace with hash -760398597, now seen corresponding path program 1 times [2018-12-09 19:11:25,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:25,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:25,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:25,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:25,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:25,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:25,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:11:25,398 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:25,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:11:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:11:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:11:25,398 INFO L87 Difference]: Start difference. First operand 81133 states and 261702 transitions. Second operand 9 states. [2018-12-09 19:11:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:26,893 INFO L93 Difference]: Finished difference Result 108445 states and 342684 transitions. [2018-12-09 19:11:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 19:11:26,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-12-09 19:11:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:27,065 INFO L225 Difference]: With dead ends: 108445 [2018-12-09 19:11:27,065 INFO L226 Difference]: Without dead ends: 108389 [2018-12-09 19:11:27,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2018-12-09 19:11:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108389 states. [2018-12-09 19:11:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108389 to 80494. [2018-12-09 19:11:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80494 states. [2018-12-09 19:11:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80494 states to 80494 states and 259961 transitions. [2018-12-09 19:11:28,319 INFO L78 Accepts]: Start accepts. Automaton has 80494 states and 259961 transitions. Word has length 74 [2018-12-09 19:11:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:28,319 INFO L480 AbstractCegarLoop]: Abstraction has 80494 states and 259961 transitions. [2018-12-09 19:11:28,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:11:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 80494 states and 259961 transitions. [2018-12-09 19:11:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 19:11:28,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:28,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:28,335 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:28,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2014750299, now seen corresponding path program 1 times [2018-12-09 19:11:28,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:28,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:28,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:28,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:28,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:28,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:28,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:11:28,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:28,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:11:28,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:11:28,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:11:28,375 INFO L87 Difference]: Start difference. First operand 80494 states and 259961 transitions. Second operand 5 states. [2018-12-09 19:11:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:28,953 INFO L93 Difference]: Finished difference Result 112217 states and 365175 transitions. [2018-12-09 19:11:28,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:11:28,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-09 19:11:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:29,133 INFO L225 Difference]: With dead ends: 112217 [2018-12-09 19:11:29,133 INFO L226 Difference]: Without dead ends: 112217 [2018-12-09 19:11:29,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:11:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112217 states. [2018-12-09 19:11:30,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112217 to 104142. [2018-12-09 19:11:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104142 states. [2018-12-09 19:11:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104142 states to 104142 states and 338553 transitions. [2018-12-09 19:11:30,636 INFO L78 Accepts]: Start accepts. Automaton has 104142 states and 338553 transitions. Word has length 76 [2018-12-09 19:11:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:30,636 INFO L480 AbstractCegarLoop]: Abstraction has 104142 states and 338553 transitions. [2018-12-09 19:11:30,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:11:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 104142 states and 338553 transitions. [2018-12-09 19:11:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 19:11:30,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:30,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:30,655 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:30,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash -271939964, now seen corresponding path program 1 times [2018-12-09 19:11:30,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:30,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:30,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:30,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:30,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:30,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:30,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:11:30,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:30,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:11:30,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:11:30,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:11:30,708 INFO L87 Difference]: Start difference. First operand 104142 states and 338553 transitions. Second operand 7 states. [2018-12-09 19:11:31,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:31,913 INFO L93 Difference]: Finished difference Result 189824 states and 618954 transitions. [2018-12-09 19:11:31,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:11:31,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-09 19:11:31,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:32,245 INFO L225 Difference]: With dead ends: 189824 [2018-12-09 19:11:32,246 INFO L226 Difference]: Without dead ends: 189753 [2018-12-09 19:11:32,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:11:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189753 states. [2018-12-09 19:11:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189753 to 123930. [2018-12-09 19:11:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123930 states. [2018-12-09 19:11:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123930 states to 123930 states and 397571 transitions. [2018-12-09 19:11:34,506 INFO L78 Accepts]: Start accepts. Automaton has 123930 states and 397571 transitions. Word has length 76 [2018-12-09 19:11:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:34,506 INFO L480 AbstractCegarLoop]: Abstraction has 123930 states and 397571 transitions. [2018-12-09 19:11:34,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:11:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 123930 states and 397571 transitions. [2018-12-09 19:11:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:11:34,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:34,533 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] [2018-12-09 19:11:34,533 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:34,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:34,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2068033077, now seen corresponding path program 1 times [2018-12-09 19:11:34,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:34,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:34,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:34,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:34,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:34,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:34,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:11:34,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:34,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:11:34,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:11:34,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:11:34,572 INFO L87 Difference]: Start difference. First operand 123930 states and 397571 transitions. Second operand 4 states. [2018-12-09 19:11:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:35,227 INFO L93 Difference]: Finished difference Result 134224 states and 427691 transitions. [2018-12-09 19:11:35,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:11:35,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 19:11:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:35,448 INFO L225 Difference]: With dead ends: 134224 [2018-12-09 19:11:35,448 INFO L226 Difference]: Without dead ends: 134224 [2018-12-09 19:11:35,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:11:35,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134224 states. [2018-12-09 19:11:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134224 to 130356. [2018-12-09 19:11:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130356 states. [2018-12-09 19:11:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130356 states to 130356 states and 416512 transitions. [2018-12-09 19:11:37,411 INFO L78 Accepts]: Start accepts. Automaton has 130356 states and 416512 transitions. Word has length 80 [2018-12-09 19:11:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:37,411 INFO L480 AbstractCegarLoop]: Abstraction has 130356 states and 416512 transitions. [2018-12-09 19:11:37,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:11:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 130356 states and 416512 transitions. [2018-12-09 19:11:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:11:37,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:37,441 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] [2018-12-09 19:11:37,441 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:37,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash 132372790, now seen corresponding path program 1 times [2018-12-09 19:11:37,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:37,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:37,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:37,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:37,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:11:37,465 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:37,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:11:37,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:11:37,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:11:37,465 INFO L87 Difference]: Start difference. First operand 130356 states and 416512 transitions. Second operand 3 states. [2018-12-09 19:11:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:38,111 INFO L93 Difference]: Finished difference Result 132173 states and 421679 transitions. [2018-12-09 19:11:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:11:38,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-09 19:11:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:38,325 INFO L225 Difference]: With dead ends: 132173 [2018-12-09 19:11:38,325 INFO L226 Difference]: Without dead ends: 132173 [2018-12-09 19:11:38,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:11:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132173 states. [2018-12-09 19:11:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132173 to 131296. [2018-12-09 19:11:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131296 states. [2018-12-09 19:11:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131296 states to 131296 states and 419170 transitions. [2018-12-09 19:11:40,041 INFO L78 Accepts]: Start accepts. Automaton has 131296 states and 419170 transitions. Word has length 80 [2018-12-09 19:11:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:40,042 INFO L480 AbstractCegarLoop]: Abstraction has 131296 states and 419170 transitions. [2018-12-09 19:11:40,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:11:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 131296 states and 419170 transitions. [2018-12-09 19:11:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:11:40,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:40,072 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] [2018-12-09 19:11:40,072 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:40,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:40,072 INFO L82 PathProgramCache]: Analyzing trace with hash 394157484, now seen corresponding path program 1 times [2018-12-09 19:11:40,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:40,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:40,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:40,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:40,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:40,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:40,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:11:40,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:40,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:11:40,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:11:40,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:11:40,154 INFO L87 Difference]: Start difference. First operand 131296 states and 419170 transitions. Second operand 10 states. [2018-12-09 19:11:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:42,510 INFO L93 Difference]: Finished difference Result 166835 states and 524111 transitions. [2018-12-09 19:11:42,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 19:11:42,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-12-09 19:11:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:42,774 INFO L225 Difference]: With dead ends: 166835 [2018-12-09 19:11:42,774 INFO L226 Difference]: Without dead ends: 166759 [2018-12-09 19:11:42,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2018-12-09 19:11:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166759 states. [2018-12-09 19:11:44,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166759 to 127980. [2018-12-09 19:11:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127980 states. [2018-12-09 19:11:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127980 states to 127980 states and 410098 transitions. [2018-12-09 19:11:44,823 INFO L78 Accepts]: Start accepts. Automaton has 127980 states and 410098 transitions. Word has length 80 [2018-12-09 19:11:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:44,824 INFO L480 AbstractCegarLoop]: Abstraction has 127980 states and 410098 transitions. [2018-12-09 19:11:44,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:11:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 127980 states and 410098 transitions. [2018-12-09 19:11:44,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:11:44,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:44,855 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] [2018-12-09 19:11:44,855 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:44,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:44,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1341674495, now seen corresponding path program 1 times [2018-12-09 19:11:44,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:44,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:44,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:44,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:44,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:44,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:44,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:11:44,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:44,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:11:44,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:11:44,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:11:44,925 INFO L87 Difference]: Start difference. First operand 127980 states and 410098 transitions. Second operand 6 states. [2018-12-09 19:11:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:46,767 INFO L93 Difference]: Finished difference Result 139402 states and 443686 transitions. [2018-12-09 19:11:46,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:11:46,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 19:11:46,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:46,991 INFO L225 Difference]: With dead ends: 139402 [2018-12-09 19:11:46,992 INFO L226 Difference]: Without dead ends: 139402 [2018-12-09 19:11:46,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:11:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139402 states. [2018-12-09 19:11:48,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139402 to 135898. [2018-12-09 19:11:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135898 states. [2018-12-09 19:11:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135898 states to 135898 states and 433872 transitions. [2018-12-09 19:11:48,771 INFO L78 Accepts]: Start accepts. Automaton has 135898 states and 433872 transitions. Word has length 82 [2018-12-09 19:11:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:48,771 INFO L480 AbstractCegarLoop]: Abstraction has 135898 states and 433872 transitions. [2018-12-09 19:11:48,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:11:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand 135898 states and 433872 transitions. [2018-12-09 19:11:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:11:48,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:48,804 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] [2018-12-09 19:11:48,805 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:48,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:48,805 INFO L82 PathProgramCache]: Analyzing trace with hash -593985792, now seen corresponding path program 1 times [2018-12-09 19:11:48,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:48,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:48,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:48,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:48,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:48,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:48,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:11:48,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:48,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:11:48,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:11:48,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:11:48,869 INFO L87 Difference]: Start difference. First operand 135898 states and 433872 transitions. Second operand 6 states. [2018-12-09 19:11:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:49,759 INFO L93 Difference]: Finished difference Result 143883 states and 451858 transitions. [2018-12-09 19:11:49,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:11:49,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 19:11:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:49,987 INFO L225 Difference]: With dead ends: 143883 [2018-12-09 19:11:49,987 INFO L226 Difference]: Without dead ends: 143883 [2018-12-09 19:11:49,988 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-12-09 19:11:50,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143883 states. [2018-12-09 19:11:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143883 to 138092. [2018-12-09 19:11:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138092 states. [2018-12-09 19:11:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138092 states to 138092 states and 437140 transitions. [2018-12-09 19:11:51,926 INFO L78 Accepts]: Start accepts. Automaton has 138092 states and 437140 transitions. Word has length 82 [2018-12-09 19:11:51,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:51,926 INFO L480 AbstractCegarLoop]: Abstraction has 138092 states and 437140 transitions. [2018-12-09 19:11:51,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:11:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 138092 states and 437140 transitions. [2018-12-09 19:11:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:11:51,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:51,961 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] [2018-12-09 19:11:51,961 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:51,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:51,961 INFO L82 PathProgramCache]: Analyzing trace with hash -264220031, now seen corresponding path program 1 times [2018-12-09 19:11:51,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:51,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:51,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:51,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:51,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:52,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:52,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:11:52,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:52,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:11:52,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:11:52,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:11:52,010 INFO L87 Difference]: Start difference. First operand 138092 states and 437140 transitions. Second operand 5 states. [2018-12-09 19:11:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:52,880 INFO L93 Difference]: Finished difference Result 160064 states and 502579 transitions. [2018-12-09 19:11:52,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:11:52,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 19:11:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:53,129 INFO L225 Difference]: With dead ends: 160064 [2018-12-09 19:11:53,129 INFO L226 Difference]: Without dead ends: 160064 [2018-12-09 19:11:53,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:11:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160064 states. [2018-12-09 19:11:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160064 to 148241. [2018-12-09 19:11:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148241 states. [2018-12-09 19:11:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148241 states to 148241 states and 466166 transitions. [2018-12-09 19:11:55,236 INFO L78 Accepts]: Start accepts. Automaton has 148241 states and 466166 transitions. Word has length 82 [2018-12-09 19:11:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:55,236 INFO L480 AbstractCegarLoop]: Abstraction has 148241 states and 466166 transitions. [2018-12-09 19:11:55,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:11:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 148241 states and 466166 transitions. [2018-12-09 19:11:55,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:11:55,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:55,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:55,276 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:55,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2020643424, now seen corresponding path program 1 times [2018-12-09 19:11:55,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:55,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:55,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:55,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:55,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:11:55,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:55,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:11:55,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:11:55,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:11:55,322 INFO L87 Difference]: Start difference. First operand 148241 states and 466166 transitions. Second operand 5 states. [2018-12-09 19:11:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:56,263 INFO L93 Difference]: Finished difference Result 177929 states and 555113 transitions. [2018-12-09 19:11:56,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:11:56,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 19:11:56,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:56,544 INFO L225 Difference]: With dead ends: 177929 [2018-12-09 19:11:56,544 INFO L226 Difference]: Without dead ends: 177929 [2018-12-09 19:11:56,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:11:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177929 states. [2018-12-09 19:11:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177929 to 167311. [2018-12-09 19:11:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167311 states. [2018-12-09 19:11:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167311 states to 167311 states and 524219 transitions. [2018-12-09 19:11:58,957 INFO L78 Accepts]: Start accepts. Automaton has 167311 states and 524219 transitions. Word has length 82 [2018-12-09 19:11:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:58,957 INFO L480 AbstractCegarLoop]: Abstraction has 167311 states and 524219 transitions. [2018-12-09 19:11:58,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:11:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 167311 states and 524219 transitions. [2018-12-09 19:11:59,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:11:59,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:59,004 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] [2018-12-09 19:11:59,004 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:59,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:59,005 INFO L82 PathProgramCache]: Analyzing trace with hash -56565919, now seen corresponding path program 1 times [2018-12-09 19:11:59,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:59,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:59,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:59,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:59,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:11:59,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:59,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:11:59,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:11:59,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:11:59,049 INFO L87 Difference]: Start difference. First operand 167311 states and 524219 transitions. Second operand 4 states. [2018-12-09 19:12:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:00,310 INFO L93 Difference]: Finished difference Result 233999 states and 731439 transitions. [2018-12-09 19:12:00,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:12:00,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-09 19:12:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:00,708 INFO L225 Difference]: With dead ends: 233999 [2018-12-09 19:12:00,709 INFO L226 Difference]: Without dead ends: 233767 [2018-12-09 19:12:00,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:12:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233767 states. [2018-12-09 19:12:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233767 to 204343. [2018-12-09 19:12:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204343 states. [2018-12-09 19:12:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204343 states to 204343 states and 641541 transitions. [2018-12-09 19:12:03,897 INFO L78 Accepts]: Start accepts. Automaton has 204343 states and 641541 transitions. Word has length 82 [2018-12-09 19:12:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:03,897 INFO L480 AbstractCegarLoop]: Abstraction has 204343 states and 641541 transitions. [2018-12-09 19:12:03,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:12:03,898 INFO L276 IsEmpty]: Start isEmpty. Operand 204343 states and 641541 transitions. [2018-12-09 19:12:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:12:03,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:03,962 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] [2018-12-09 19:12:03,962 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:03,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:03,962 INFO L82 PathProgramCache]: Analyzing trace with hash 905048098, now seen corresponding path program 1 times [2018-12-09 19:12:03,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:03,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:03,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:03,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:03,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:04,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:04,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:12:04,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:04,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:12:04,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:12:04,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:12:04,009 INFO L87 Difference]: Start difference. First operand 204343 states and 641541 transitions. Second operand 5 states. [2018-12-09 19:12:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:05,122 INFO L93 Difference]: Finished difference Result 219711 states and 678043 transitions. [2018-12-09 19:12:05,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:12:05,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 19:12:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:05,511 INFO L225 Difference]: With dead ends: 219711 [2018-12-09 19:12:05,512 INFO L226 Difference]: Without dead ends: 219535 [2018-12-09 19:12:05,512 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-12-09 19:12:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219535 states. [2018-12-09 19:12:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219535 to 181816. [2018-12-09 19:12:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181816 states. [2018-12-09 19:12:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181816 states to 181816 states and 565629 transitions. [2018-12-09 19:12:08,254 INFO L78 Accepts]: Start accepts. Automaton has 181816 states and 565629 transitions. Word has length 82 [2018-12-09 19:12:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:08,254 INFO L480 AbstractCegarLoop]: Abstraction has 181816 states and 565629 transitions. [2018-12-09 19:12:08,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:12:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 181816 states and 565629 transitions. [2018-12-09 19:12:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:12:08,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:08,297 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] [2018-12-09 19:12:08,297 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:08,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:08,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2145154717, now seen corresponding path program 1 times [2018-12-09 19:12:08,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:08,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:08,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:08,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:08,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:08,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:08,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:12:08,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:08,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:12:08,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:12:08,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:12:08,341 INFO L87 Difference]: Start difference. First operand 181816 states and 565629 transitions. Second operand 5 states. [2018-12-09 19:12:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:08,390 INFO L93 Difference]: Finished difference Result 18256 states and 44415 transitions. [2018-12-09 19:12:08,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:12:08,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 19:12:08,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:08,402 INFO L225 Difference]: With dead ends: 18256 [2018-12-09 19:12:08,402 INFO L226 Difference]: Without dead ends: 15627 [2018-12-09 19:12:08,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:12:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15627 states. [2018-12-09 19:12:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15627 to 14310. [2018-12-09 19:12:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14310 states. [2018-12-09 19:12:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14310 states to 14310 states and 33903 transitions. [2018-12-09 19:12:08,519 INFO L78 Accepts]: Start accepts. Automaton has 14310 states and 33903 transitions. Word has length 82 [2018-12-09 19:12:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:08,519 INFO L480 AbstractCegarLoop]: Abstraction has 14310 states and 33903 transitions. [2018-12-09 19:12:08,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:12:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 14310 states and 33903 transitions. [2018-12-09 19:12:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 19:12:08,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:08,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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:08,528 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:08,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:08,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1849176376, now seen corresponding path program 1 times [2018-12-09 19:12:08,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:08,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:08,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:08,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:08,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:08,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:08,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:12:08,756 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:08,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:12:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:12:08,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:12:08,757 INFO L87 Difference]: Start difference. First operand 14310 states and 33903 transitions. Second operand 6 states. [2018-12-09 19:12:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:08,940 INFO L93 Difference]: Finished difference Result 18366 states and 43448 transitions. [2018-12-09 19:12:08,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:12:08,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-12-09 19:12:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:08,953 INFO L225 Difference]: With dead ends: 18366 [2018-12-09 19:12:08,953 INFO L226 Difference]: Without dead ends: 18366 [2018-12-09 19:12:08,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:12:08,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18366 states. [2018-12-09 19:12:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18366 to 16694. [2018-12-09 19:12:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16694 states. [2018-12-09 19:12:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16694 states to 16694 states and 39650 transitions. [2018-12-09 19:12:09,093 INFO L78 Accepts]: Start accepts. Automaton has 16694 states and 39650 transitions. Word has length 88 [2018-12-09 19:12:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:09,093 INFO L480 AbstractCegarLoop]: Abstraction has 16694 states and 39650 transitions. [2018-12-09 19:12:09,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:12:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 16694 states and 39650 transitions. [2018-12-09 19:12:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 19:12:09,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:09,104 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] [2018-12-09 19:12:09,104 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:09,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:09,104 INFO L82 PathProgramCache]: Analyzing trace with hash -106366041, now seen corresponding path program 1 times [2018-12-09 19:12:09,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:09,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:09,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:09,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:09,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:09,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:09,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:12:09,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:09,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:12:09,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:12:09,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:12:09,184 INFO L87 Difference]: Start difference. First operand 16694 states and 39650 transitions. Second operand 10 states. [2018-12-09 19:12:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:10,087 INFO L93 Difference]: Finished difference Result 20494 states and 48001 transitions. [2018-12-09 19:12:10,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 19:12:10,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-12-09 19:12:10,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:10,102 INFO L225 Difference]: With dead ends: 20494 [2018-12-09 19:12:10,102 INFO L226 Difference]: Without dead ends: 20380 [2018-12-09 19:12:10,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2018-12-09 19:12:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20380 states. [2018-12-09 19:12:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20380 to 17809. [2018-12-09 19:12:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17809 states. [2018-12-09 19:12:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17809 states to 17809 states and 42023 transitions. [2018-12-09 19:12:10,257 INFO L78 Accepts]: Start accepts. Automaton has 17809 states and 42023 transitions. Word has length 88 [2018-12-09 19:12:10,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:10,257 INFO L480 AbstractCegarLoop]: Abstraction has 17809 states and 42023 transitions. [2018-12-09 19:12:10,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:12:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 17809 states and 42023 transitions. [2018-12-09 19:12:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 19:12:10,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:10,268 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] [2018-12-09 19:12:10,268 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:10,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:10,268 INFO L82 PathProgramCache]: Analyzing trace with hash -594830456, now seen corresponding path program 1 times [2018-12-09 19:12:10,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:10,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:10,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:10,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:10,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:10,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:12:10,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:10,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:12:10,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:12:10,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:12:10,301 INFO L87 Difference]: Start difference. First operand 17809 states and 42023 transitions. Second operand 6 states. [2018-12-09 19:12:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:10,461 INFO L93 Difference]: Finished difference Result 22682 states and 53302 transitions. [2018-12-09 19:12:10,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:12:10,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-12-09 19:12:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:10,479 INFO L225 Difference]: With dead ends: 22682 [2018-12-09 19:12:10,479 INFO L226 Difference]: Without dead ends: 22682 [2018-12-09 19:12:10,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:12:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22682 states. [2018-12-09 19:12:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22682 to 17804. [2018-12-09 19:12:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17804 states. [2018-12-09 19:12:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17804 states to 17804 states and 42001 transitions. [2018-12-09 19:12:10,651 INFO L78 Accepts]: Start accepts. Automaton has 17804 states and 42001 transitions. Word has length 88 [2018-12-09 19:12:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:10,651 INFO L480 AbstractCegarLoop]: Abstraction has 17804 states and 42001 transitions. [2018-12-09 19:12:10,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:12:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 17804 states and 42001 transitions. [2018-12-09 19:12:10,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 19:12:10,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:10,662 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] [2018-12-09 19:12:10,662 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:10,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:10,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1147979879, now seen corresponding path program 1 times [2018-12-09 19:12:10,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:10,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:10,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:10,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:10,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:12:10,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:10,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:12:10,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:12:10,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:12:10,741 INFO L87 Difference]: Start difference. First operand 17804 states and 42001 transitions. Second operand 10 states. [2018-12-09 19:12:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:11,475 INFO L93 Difference]: Finished difference Result 20835 states and 48650 transitions. [2018-12-09 19:12:11,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 19:12:11,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-12-09 19:12:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:11,490 INFO L225 Difference]: With dead ends: 20835 [2018-12-09 19:12:11,490 INFO L226 Difference]: Without dead ends: 20749 [2018-12-09 19:12:11,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-12-09 19:12:11,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20749 states. [2018-12-09 19:12:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20749 to 17590. [2018-12-09 19:12:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17590 states. [2018-12-09 19:12:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17590 states to 17590 states and 41562 transitions. [2018-12-09 19:12:11,644 INFO L78 Accepts]: Start accepts. Automaton has 17590 states and 41562 transitions. Word has length 88 [2018-12-09 19:12:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:11,644 INFO L480 AbstractCegarLoop]: Abstraction has 17590 states and 41562 transitions. [2018-12-09 19:12:11,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:12:11,644 INFO L276 IsEmpty]: Start isEmpty. Operand 17590 states and 41562 transitions. [2018-12-09 19:12:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:12:11,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:11,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:11,656 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:11,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash -968928213, now seen corresponding path program 1 times [2018-12-09 19:12:11,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:11,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:11,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:11,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:11,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:11,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:11,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:12:11,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:11,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:12:11,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:12:11,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:12:11,704 INFO L87 Difference]: Start difference. First operand 17590 states and 41562 transitions. Second operand 7 states. [2018-12-09 19:12:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:12,006 INFO L93 Difference]: Finished difference Result 22434 states and 52977 transitions. [2018-12-09 19:12:12,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:12:12,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 19:12:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:12,023 INFO L225 Difference]: With dead ends: 22434 [2018-12-09 19:12:12,024 INFO L226 Difference]: Without dead ends: 22434 [2018-12-09 19:12:12,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:12:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2018-12-09 19:12:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 18153. [2018-12-09 19:12:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18153 states. [2018-12-09 19:12:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18153 states to 18153 states and 42901 transitions. [2018-12-09 19:12:12,190 INFO L78 Accepts]: Start accepts. Automaton has 18153 states and 42901 transitions. Word has length 100 [2018-12-09 19:12:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:12,190 INFO L480 AbstractCegarLoop]: Abstraction has 18153 states and 42901 transitions. [2018-12-09 19:12:12,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:12:12,190 INFO L276 IsEmpty]: Start isEmpty. Operand 18153 states and 42901 transitions. [2018-12-09 19:12:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:12:12,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:12,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:12,203 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:12,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:12,203 INFO L82 PathProgramCache]: Analyzing trace with hash 773882122, now seen corresponding path program 1 times [2018-12-09 19:12:12,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:12,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:12,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:12,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:12,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:12:12,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:12,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:12:12,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:12:12,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:12:12,291 INFO L87 Difference]: Start difference. First operand 18153 states and 42901 transitions. Second operand 11 states. [2018-12-09 19:12:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:13,366 INFO L93 Difference]: Finished difference Result 21139 states and 49475 transitions. [2018-12-09 19:12:13,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 19:12:13,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2018-12-09 19:12:13,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:13,381 INFO L225 Difference]: With dead ends: 21139 [2018-12-09 19:12:13,381 INFO L226 Difference]: Without dead ends: 21009 [2018-12-09 19:12:13,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 19:12:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21009 states. [2018-12-09 19:12:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21009 to 16774. [2018-12-09 19:12:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16774 states. [2018-12-09 19:12:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16774 states to 16774 states and 39914 transitions. [2018-12-09 19:12:13,556 INFO L78 Accepts]: Start accepts. Automaton has 16774 states and 39914 transitions. Word has length 100 [2018-12-09 19:12:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:13,556 INFO L480 AbstractCegarLoop]: Abstraction has 16774 states and 39914 transitions. [2018-12-09 19:12:13,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:12:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 16774 states and 39914 transitions. [2018-12-09 19:12:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 19:12:13,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:13,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:13,568 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:13,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:13,569 INFO L82 PathProgramCache]: Analyzing trace with hash -906257866, now seen corresponding path program 1 times [2018-12-09 19:12:13,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:13,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:13,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:13,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:13,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:13,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:13,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:12:13,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:13,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:12:13,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:12:13,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:12:13,641 INFO L87 Difference]: Start difference. First operand 16774 states and 39914 transitions. Second operand 7 states. [2018-12-09 19:12:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:14,217 INFO L93 Difference]: Finished difference Result 20448 states and 48334 transitions. [2018-12-09 19:12:14,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:12:14,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-12-09 19:12:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:14,232 INFO L225 Difference]: With dead ends: 20448 [2018-12-09 19:12:14,232 INFO L226 Difference]: Without dead ends: 20448 [2018-12-09 19:12:14,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:12:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20448 states. [2018-12-09 19:12:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20448 to 17150. [2018-12-09 19:12:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17150 states. [2018-12-09 19:12:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17150 states to 17150 states and 40983 transitions. [2018-12-09 19:12:14,386 INFO L78 Accepts]: Start accepts. Automaton has 17150 states and 40983 transitions. Word has length 125 [2018-12-09 19:12:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:14,386 INFO L480 AbstractCegarLoop]: Abstraction has 17150 states and 40983 transitions. [2018-12-09 19:12:14,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:12:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 17150 states and 40983 transitions. [2018-12-09 19:12:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 19:12:14,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:14,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:14,399 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:14,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:14,399 INFO L82 PathProgramCache]: Analyzing trace with hash 295243193, now seen corresponding path program 1 times [2018-12-09 19:12:14,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:14,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:14,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:14,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:14,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:14,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:14,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:12:14,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:14,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:12:14,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:12:14,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:12:14,454 INFO L87 Difference]: Start difference. First operand 17150 states and 40983 transitions. Second operand 5 states. [2018-12-09 19:12:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:14,607 INFO L93 Difference]: Finished difference Result 26994 states and 63376 transitions. [2018-12-09 19:12:14,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:12:14,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2018-12-09 19:12:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:14,629 INFO L225 Difference]: With dead ends: 26994 [2018-12-09 19:12:14,629 INFO L226 Difference]: Without dead ends: 26994 [2018-12-09 19:12:14,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:12:14,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26994 states. [2018-12-09 19:12:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26994 to 24454. [2018-12-09 19:12:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24454 states. [2018-12-09 19:12:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24454 states to 24454 states and 57989 transitions. [2018-12-09 19:12:14,853 INFO L78 Accepts]: Start accepts. Automaton has 24454 states and 57989 transitions. Word has length 125 [2018-12-09 19:12:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:14,854 INFO L480 AbstractCegarLoop]: Abstraction has 24454 states and 57989 transitions. [2018-12-09 19:12:14,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:12:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 24454 states and 57989 transitions. [2018-12-09 19:12:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:12:14,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:14,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:14,874 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:14,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash 25931487, now seen corresponding path program 1 times [2018-12-09 19:12:14,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:14,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:14,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:14,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:14,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:12:14,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:14,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:12:14,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:12:14,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:12:14,928 INFO L87 Difference]: Start difference. First operand 24454 states and 57989 transitions. Second operand 6 states. [2018-12-09 19:12:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:15,119 INFO L93 Difference]: Finished difference Result 37692 states and 89177 transitions. [2018-12-09 19:12:15,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:12:15,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-09 19:12:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:15,157 INFO L225 Difference]: With dead ends: 37692 [2018-12-09 19:12:15,157 INFO L226 Difference]: Without dead ends: 37692 [2018-12-09 19:12:15,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:12:15,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37692 states. [2018-12-09 19:12:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37692 to 24305. [2018-12-09 19:12:15,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24305 states. [2018-12-09 19:12:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24305 states to 24305 states and 57756 transitions. [2018-12-09 19:12:15,415 INFO L78 Accepts]: Start accepts. Automaton has 24305 states and 57756 transitions. Word has length 127 [2018-12-09 19:12:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:15,415 INFO L480 AbstractCegarLoop]: Abstraction has 24305 states and 57756 transitions. [2018-12-09 19:12:15,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:12:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 24305 states and 57756 transitions. [2018-12-09 19:12:15,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:12:15,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:15,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:15,433 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:15,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:15,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1157415810, now seen corresponding path program 1 times [2018-12-09 19:12:15,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:15,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:15,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:15,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:15,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:15,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:15,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:12:15,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:15,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:12:15,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:12:15,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:12:15,477 INFO L87 Difference]: Start difference. First operand 24305 states and 57756 transitions. Second operand 4 states. [2018-12-09 19:12:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:15,734 INFO L93 Difference]: Finished difference Result 30698 states and 71631 transitions. [2018-12-09 19:12:15,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:12:15,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-09 19:12:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:15,757 INFO L225 Difference]: With dead ends: 30698 [2018-12-09 19:12:15,757 INFO L226 Difference]: Without dead ends: 30631 [2018-12-09 19:12:15,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:12:15,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30631 states. [2018-12-09 19:12:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30631 to 28665. [2018-12-09 19:12:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28665 states. [2018-12-09 19:12:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28665 states to 28665 states and 67379 transitions. [2018-12-09 19:12:16,018 INFO L78 Accepts]: Start accepts. Automaton has 28665 states and 67379 transitions. Word has length 127 [2018-12-09 19:12:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:16,018 INFO L480 AbstractCegarLoop]: Abstraction has 28665 states and 67379 transitions. [2018-12-09 19:12:16,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:12:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 28665 states and 67379 transitions. [2018-12-09 19:12:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:12:16,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:16,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:16,040 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:16,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:16,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1201891199, now seen corresponding path program 1 times [2018-12-09 19:12:16,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:16,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:16,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:16,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:16,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:16,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:16,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:12:16,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:16,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:12:16,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:12:16,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:12:16,135 INFO L87 Difference]: Start difference. First operand 28665 states and 67379 transitions. Second operand 11 states. [2018-12-09 19:12:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:18,901 INFO L93 Difference]: Finished difference Result 75448 states and 177106 transitions. [2018-12-09 19:12:18,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 19:12:18,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2018-12-09 19:12:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:18,957 INFO L225 Difference]: With dead ends: 75448 [2018-12-09 19:12:18,957 INFO L226 Difference]: Without dead ends: 57405 [2018-12-09 19:12:18,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2018-12-09 19:12:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57405 states. [2018-12-09 19:12:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57405 to 27910. [2018-12-09 19:12:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27910 states. [2018-12-09 19:12:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27910 states to 27910 states and 65707 transitions. [2018-12-09 19:12:19,359 INFO L78 Accepts]: Start accepts. Automaton has 27910 states and 65707 transitions. Word has length 127 [2018-12-09 19:12:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:19,359 INFO L480 AbstractCegarLoop]: Abstraction has 27910 states and 65707 transitions. [2018-12-09 19:12:19,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:12:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 27910 states and 65707 transitions. [2018-12-09 19:12:19,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:12:19,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:19,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:19,380 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:19,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:19,380 INFO L82 PathProgramCache]: Analyzing trace with hash -60439278, now seen corresponding path program 1 times [2018-12-09 19:12:19,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:19,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:19,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:19,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:19,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:19,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:19,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:12:19,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:19,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:12:19,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:12:19,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:12:19,457 INFO L87 Difference]: Start difference. First operand 27910 states and 65707 transitions. Second operand 6 states. [2018-12-09 19:12:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:19,667 INFO L93 Difference]: Finished difference Result 30652 states and 71268 transitions. [2018-12-09 19:12:19,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:12:19,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-09 19:12:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:19,693 INFO L225 Difference]: With dead ends: 30652 [2018-12-09 19:12:19,693 INFO L226 Difference]: Without dead ends: 30610 [2018-12-09 19:12:19,693 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-12-09 19:12:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30610 states. [2018-12-09 19:12:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30610 to 27193. [2018-12-09 19:12:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27193 states. [2018-12-09 19:12:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27193 states to 27193 states and 63382 transitions. [2018-12-09 19:12:19,959 INFO L78 Accepts]: Start accepts. Automaton has 27193 states and 63382 transitions. Word has length 127 [2018-12-09 19:12:19,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:19,960 INFO L480 AbstractCegarLoop]: Abstraction has 27193 states and 63382 transitions. [2018-12-09 19:12:19,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:12:19,960 INFO L276 IsEmpty]: Start isEmpty. Operand 27193 states and 63382 transitions. [2018-12-09 19:12:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:12:19,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:19,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:19,982 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:19,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:19,982 INFO L82 PathProgramCache]: Analyzing trace with hash 577542988, now seen corresponding path program 1 times [2018-12-09 19:12:19,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:19,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:19,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:19,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:19,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:20,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:20,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:12:20,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:20,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:12:20,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:12:20,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:12:20,017 INFO L87 Difference]: Start difference. First operand 27193 states and 63382 transitions. Second operand 5 states. [2018-12-09 19:12:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:20,246 INFO L93 Difference]: Finished difference Result 28839 states and 66769 transitions. [2018-12-09 19:12:20,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:12:20,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-09 19:12:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:20,269 INFO L225 Difference]: With dead ends: 28839 [2018-12-09 19:12:20,269 INFO L226 Difference]: Without dead ends: 28839 [2018-12-09 19:12:20,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:12:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28839 states. [2018-12-09 19:12:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28839 to 27412. [2018-12-09 19:12:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27412 states. [2018-12-09 19:12:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27412 states to 27412 states and 63848 transitions. [2018-12-09 19:12:20,527 INFO L78 Accepts]: Start accepts. Automaton has 27412 states and 63848 transitions. Word has length 127 [2018-12-09 19:12:20,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:20,527 INFO L480 AbstractCegarLoop]: Abstraction has 27412 states and 63848 transitions. [2018-12-09 19:12:20,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:12:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 27412 states and 63848 transitions. [2018-12-09 19:12:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:12:20,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:20,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:20,550 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:20,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:20,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1488351502, now seen corresponding path program 2 times [2018-12-09 19:12:20,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:20,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:20,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:20,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:20,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:20,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:20,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:12:20,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:20,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:12:20,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:12:20,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:12:20,599 INFO L87 Difference]: Start difference. First operand 27412 states and 63848 transitions. Second operand 6 states. [2018-12-09 19:12:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:20,802 INFO L93 Difference]: Finished difference Result 27526 states and 63909 transitions. [2018-12-09 19:12:20,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:12:20,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-09 19:12:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:20,825 INFO L225 Difference]: With dead ends: 27526 [2018-12-09 19:12:20,825 INFO L226 Difference]: Without dead ends: 27526 [2018-12-09 19:12:20,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:12:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27526 states. [2018-12-09 19:12:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27526 to 24870. [2018-12-09 19:12:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24870 states. [2018-12-09 19:12:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24870 states to 24870 states and 57768 transitions. [2018-12-09 19:12:21,058 INFO L78 Accepts]: Start accepts. Automaton has 24870 states and 57768 transitions. Word has length 127 [2018-12-09 19:12:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:21,058 INFO L480 AbstractCegarLoop]: Abstraction has 24870 states and 57768 transitions. [2018-12-09 19:12:21,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:12:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24870 states and 57768 transitions. [2018-12-09 19:12:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:12:21,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:21,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:21,079 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:21,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash 893789617, now seen corresponding path program 2 times [2018-12-09 19:12:21,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:21,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:12:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:21,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:21,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:21,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:12:21,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:21,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:12:21,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:12:21,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:12:21,142 INFO L87 Difference]: Start difference. First operand 24870 states and 57768 transitions. Second operand 7 states. [2018-12-09 19:12:22,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:22,341 INFO L93 Difference]: Finished difference Result 39862 states and 92923 transitions. [2018-12-09 19:12:22,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:12:22,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-12-09 19:12:22,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:22,354 INFO L225 Difference]: With dead ends: 39862 [2018-12-09 19:12:22,354 INFO L226 Difference]: Without dead ends: 12503 [2018-12-09 19:12:22,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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-12-09 19:12:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2018-12-09 19:12:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 12503. [2018-12-09 19:12:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12503 states. [2018-12-09 19:12:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12503 states to 12503 states and 29534 transitions. [2018-12-09 19:12:22,455 INFO L78 Accepts]: Start accepts. Automaton has 12503 states and 29534 transitions. Word has length 127 [2018-12-09 19:12:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:22,456 INFO L480 AbstractCegarLoop]: Abstraction has 12503 states and 29534 transitions. [2018-12-09 19:12:22,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:12:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 12503 states and 29534 transitions. [2018-12-09 19:12:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:12:22,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:22,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:22,468 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:22,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:22,469 INFO L82 PathProgramCache]: Analyzing trace with hash 528390363, now seen corresponding path program 3 times [2018-12-09 19:12:22,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:22,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:22,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:12:22,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:22,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:22,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:22,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 19:12:22,611 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:22,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 19:12:22,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 19:12:22,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:12:22,612 INFO L87 Difference]: Start difference. First operand 12503 states and 29534 transitions. Second operand 15 states. [2018-12-09 19:12:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:23,155 INFO L93 Difference]: Finished difference Result 27006 states and 64211 transitions. [2018-12-09 19:12:23,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:12:23,155 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 127 [2018-12-09 19:12:23,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:23,173 INFO L225 Difference]: With dead ends: 27006 [2018-12-09 19:12:23,173 INFO L226 Difference]: Without dead ends: 25346 [2018-12-09 19:12:23,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-12-09 19:12:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2018-12-09 19:12:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 20915. [2018-12-09 19:12:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20915 states. [2018-12-09 19:12:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20915 states to 20915 states and 49002 transitions. [2018-12-09 19:12:23,399 INFO L78 Accepts]: Start accepts. Automaton has 20915 states and 49002 transitions. Word has length 127 [2018-12-09 19:12:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:23,399 INFO L480 AbstractCegarLoop]: Abstraction has 20915 states and 49002 transitions. [2018-12-09 19:12:23,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 19:12:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 20915 states and 49002 transitions. [2018-12-09 19:12:23,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:12:23,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:23,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:23,412 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:23,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:23,412 INFO L82 PathProgramCache]: Analyzing trace with hash 520631004, now seen corresponding path program 1 times [2018-12-09 19:12:23,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:23,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:23,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:12:23,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:23,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:23,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:23,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:12:23,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:23,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:12:23,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:12:23,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:12:23,479 INFO L87 Difference]: Start difference. First operand 20915 states and 49002 transitions. Second operand 5 states. [2018-12-09 19:12:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:23,571 INFO L93 Difference]: Finished difference Result 17074 states and 39845 transitions. [2018-12-09 19:12:23,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:12:23,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-09 19:12:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:23,583 INFO L225 Difference]: With dead ends: 17074 [2018-12-09 19:12:23,583 INFO L226 Difference]: Without dead ends: 17074 [2018-12-09 19:12:23,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:12:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17074 states. [2018-12-09 19:12:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17074 to 16940. [2018-12-09 19:12:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16940 states. [2018-12-09 19:12:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16940 states to 16940 states and 39561 transitions. [2018-12-09 19:12:23,719 INFO L78 Accepts]: Start accepts. Automaton has 16940 states and 39561 transitions. Word has length 127 [2018-12-09 19:12:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:23,719 INFO L480 AbstractCegarLoop]: Abstraction has 16940 states and 39561 transitions. [2018-12-09 19:12:23,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:12:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 16940 states and 39561 transitions. [2018-12-09 19:12:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:12:23,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:23,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:23,732 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:23,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:23,732 INFO L82 PathProgramCache]: Analyzing trace with hash -42610214, now seen corresponding path program 2 times [2018-12-09 19:12:23,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:23,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:23,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:23,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:23,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:23,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:23,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:12:23,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:23,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:12:23,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:12:23,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:12:23,809 INFO L87 Difference]: Start difference. First operand 16940 states and 39561 transitions. Second operand 8 states. [2018-12-09 19:12:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:24,304 INFO L93 Difference]: Finished difference Result 19482 states and 45243 transitions. [2018-12-09 19:12:24,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:12:24,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-12-09 19:12:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:24,319 INFO L225 Difference]: With dead ends: 19482 [2018-12-09 19:12:24,319 INFO L226 Difference]: Without dead ends: 19482 [2018-12-09 19:12:24,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:12:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19482 states. [2018-12-09 19:12:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19482 to 18409. [2018-12-09 19:12:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18409 states. [2018-12-09 19:12:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18409 states to 18409 states and 42940 transitions. [2018-12-09 19:12:24,470 INFO L78 Accepts]: Start accepts. Automaton has 18409 states and 42940 transitions. Word has length 127 [2018-12-09 19:12:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:24,470 INFO L480 AbstractCegarLoop]: Abstraction has 18409 states and 42940 transitions. [2018-12-09 19:12:24,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:12:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 18409 states and 42940 transitions. [2018-12-09 19:12:24,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:12:24,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:24,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:24,484 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:24,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:24,484 INFO L82 PathProgramCache]: Analyzing trace with hash 198779015, now seen corresponding path program 4 times [2018-12-09 19:12:24,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:24,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:24,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:12:24,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:24,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:12:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:12:24,533 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:12:24,619 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 19:12:24,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:12:24 BasicIcfg [2018-12-09 19:12:24,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:12:24,620 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:12:24,620 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:12:24,621 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:12:24,621 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:51" (3/4) ... [2018-12-09 19:12:24,623 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:12:24,705 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e2ea88f6-80cd-4927-baed-88576864c1cb/bin-2019/utaipan/witness.graphml [2018-12-09 19:12:24,705 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:12:24,706 INFO L168 Benchmark]: Toolchain (without parser) took 93919.60 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 951.7 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-09 19:12:24,707 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:12:24,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:12:24,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.16 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-12-09 19:12:24,707 INFO L168 Benchmark]: Boogie Preprocessor took 32.97 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-12-09 19:12:24,707 INFO L168 Benchmark]: RCFGBuilder took 472.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:12:24,708 INFO L168 Benchmark]: TraceAbstraction took 92894.23 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-09 19:12:24,708 INFO L168 Benchmark]: Witness Printer took 85.16 ms. Allocated memory is still 5.3 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 84.7 MB). Peak memory consumption was 84.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:12:24,709 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.16 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 32.97 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 472.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 92894.23 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 85.16 ms. Allocated memory is still 5.3 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 84.7 MB). Peak memory consumption was 84.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] -1 pthread_t t1591; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] FCALL, FORK -1 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 2 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 pthread_t t1592; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK -1 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 2 [L732] 1 y = 1 [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 [L751] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L752] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L753] 1 y$flush_delayed = weak$$choice2 [L754] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 y = y$flush_delayed ? y$mem_tmp : y [L764] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1] [L767] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1] [L767] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 1 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, 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] [L769] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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] [L770] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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] [L771] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L806] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L807] -1 y$flush_delayed = weak$$choice2 [L808] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] -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) [L810] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] -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)) [L811] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] -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)) [L812] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] -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)) [L813] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] -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)) [L814] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] -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)) [L815] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] -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)) [L816] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] -1 y = y$flush_delayed ? y$mem_tmp : y [L818] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 348 locations, 3 error locations. UNSAFE Result, 92.7s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 35.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22499 SDtfs, 23049 SDslu, 68389 SDs, 0 SdLazy, 28114 SolverSat, 1035 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 556 GetRequests, 126 SyntacticMatches, 29 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204343occurred in iteration=18, 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: 41.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 529726 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3593 NumberOfCodeBlocks, 3593 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3428 ConstructedInterpolants, 0 QuantifiedInterpolants, 810820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...