./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_power.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_0b1f8563-19fe-4710-a797-8212bfb27527/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/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 4b89bc26925c394dcaabb010017df5fbae02ffed ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:44:15,339 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:44:15,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:44:15,346 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:44:15,346 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:44:15,346 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:44:15,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:44:15,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:44:15,348 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:44:15,349 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:44:15,349 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:44:15,349 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:44:15,350 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:44:15,350 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:44:15,351 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:44:15,351 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:44:15,352 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:44:15,352 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:44:15,353 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:44:15,354 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:44:15,355 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:44:15,355 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:44:15,356 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:44:15,356 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:44:15,356 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:44:15,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:44:15,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:44:15,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:44:15,358 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:44:15,359 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:44:15,359 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:44:15,359 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:44:15,359 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:44:15,359 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:44:15,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:44:15,360 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:44:15,360 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:44:15,367 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:44:15,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:44:15,368 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:44:15,368 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:44:15,368 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:44:15,368 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:44:15,368 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:44:15,368 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:44:15,368 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:44:15,368 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:44:15,368 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:44:15,369 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:44:15,369 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:44:15,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:44:15,369 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:44:15,369 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:44:15,369 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:44:15,369 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:44:15,370 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:44:15,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:44:15,370 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:44:15,370 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:44:15,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:44:15,370 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:44:15,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:44:15,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:44:15,370 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:44:15,370 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:44:15,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:44:15,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:44:15,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:44:15,371 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:44:15,371 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:44:15,371 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:44:15,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:44:15,371 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:44:15,371 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_0b1f8563-19fe-4710-a797-8212bfb27527/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 -> 4b89bc26925c394dcaabb010017df5fbae02ffed [2018-12-09 19:44:15,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:44:15,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:44:15,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:44:15,401 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:44:15,401 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:44:15,402 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi000_power.oepc_false-unreach-call.i [2018-12-09 19:44:15,447 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/bin-2019/utaipan/data/93476ca91/91066967e02d4eecb146c8331a182c63/FLAGa3b04c7fd [2018-12-09 19:44:15,913 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:44:15,914 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/sv-benchmarks/c/pthread-wmm/rfi000_power.oepc_false-unreach-call.i [2018-12-09 19:44:15,922 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/bin-2019/utaipan/data/93476ca91/91066967e02d4eecb146c8331a182c63/FLAGa3b04c7fd [2018-12-09 19:44:15,930 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/bin-2019/utaipan/data/93476ca91/91066967e02d4eecb146c8331a182c63 [2018-12-09 19:44:15,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:44:15,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:44:15,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:44:15,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:44:15,935 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:44:15,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:44:15" (1/1) ... [2018-12-09 19:44:15,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:44:15, skipping insertion in model container [2018-12-09 19:44:15,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:44:15" (1/1) ... [2018-12-09 19:44:15,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:44:15,964 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:44:16,156 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:44:16,164 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:44:16,252 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:44:16,282 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:44:16,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:44:16 WrapperNode [2018-12-09 19:44:16,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:44:16,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:44:16,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:44:16,283 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:44:16,289 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:44:16" (1/1) ... [2018-12-09 19:44:16,300 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:44:16" (1/1) ... [2018-12-09 19:44:16,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:44:16,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:44:16,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:44:16,318 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:44:16,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:44:16" (1/1) ... [2018-12-09 19:44:16,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:44:16" (1/1) ... [2018-12-09 19:44:16,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:44:16" (1/1) ... [2018-12-09 19:44:16,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:44:16" (1/1) ... [2018-12-09 19:44:16,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:44:16" (1/1) ... [2018-12-09 19:44:16,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:44:16" (1/1) ... [2018-12-09 19:44:16,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:44:16" (1/1) ... [2018-12-09 19:44:16,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:44:16,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:44:16,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:44:16,343 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:44:16,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:44:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/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:44:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:44:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:44:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 19:44:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:44:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 19:44:16,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 19:44:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 19:44:16,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 19:44:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 19:44:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:44:16,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:44:16,380 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:44:16,772 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:44:16,773 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 19:44:16,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:44:16 BoogieIcfgContainer [2018-12-09 19:44:16,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:44:16,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:44:16,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:44:16,776 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:44:16,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:44:15" (1/3) ... [2018-12-09 19:44:16,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420a29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:44:16, skipping insertion in model container [2018-12-09 19:44:16,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:44:16" (2/3) ... [2018-12-09 19:44:16,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420a29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:44:16, skipping insertion in model container [2018-12-09 19:44:16,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:44:16" (3/3) ... [2018-12-09 19:44:16,779 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc_false-unreach-call.i [2018-12-09 19:44:16,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,816 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,816 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,816 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,816 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:44:16,817 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,817 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,823 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,823 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:44:16,854 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 19:44:16,854 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:44:16,862 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 19:44:16,874 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 19:44:16,896 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:44:16,896 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:44:16,896 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:44:16,896 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:44:16,896 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:44:16,896 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:44:16,896 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:44:16,897 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:44:16,907 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 226places, 306 transitions [2018-12-09 19:44:30,230 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 148584 states. [2018-12-09 19:44:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 148584 states. [2018-12-09 19:44:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 19:44:30,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:44:30,236 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:44:30,238 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:44:30,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:44:30,241 INFO L82 PathProgramCache]: Analyzing trace with hash -614504401, now seen corresponding path program 1 times [2018-12-09 19:44:30,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:44:30,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:30,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:44:30,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:30,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:44:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:44:30,376 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:44:30,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:44:30,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:44:30,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:44:30,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:44:30,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:44:30,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:44:30,390 INFO L87 Difference]: Start difference. First operand 148584 states. Second operand 4 states. [2018-12-09 19:44:33,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:44:33,386 INFO L93 Difference]: Finished difference Result 272092 states and 1113406 transitions. [2018-12-09 19:44:33,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:44:33,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-09 19:44:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:44:34,136 INFO L225 Difference]: With dead ends: 272092 [2018-12-09 19:44:34,136 INFO L226 Difference]: Without dead ends: 243812 [2018-12-09 19:44:34,137 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:44:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243812 states. [2018-12-09 19:44:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243812 to 140486. [2018-12-09 19:44:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140486 states. [2018-12-09 19:44:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140486 states to 140486 states and 574639 transitions. [2018-12-09 19:44:39,193 INFO L78 Accepts]: Start accepts. Automaton has 140486 states and 574639 transitions. Word has length 33 [2018-12-09 19:44:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:44:39,194 INFO L480 AbstractCegarLoop]: Abstraction has 140486 states and 574639 transitions. [2018-12-09 19:44:39,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:44:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 140486 states and 574639 transitions. [2018-12-09 19:44:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 19:44:39,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:44:39,199 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:44:39,199 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:44:39,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:44:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1643249749, now seen corresponding path program 1 times [2018-12-09 19:44:39,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:44:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:39,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:44:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:39,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:44:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:44:39,269 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:44:39,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:44:39,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:44:39,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:44:39,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:44:39,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:44:39,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:44:39,271 INFO L87 Difference]: Start difference. First operand 140486 states and 574639 transitions. Second operand 4 states. [2018-12-09 19:44:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:44:39,477 INFO L93 Difference]: Finished difference Result 33560 states and 119400 transitions. [2018-12-09 19:44:39,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:44:39,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 19:44:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:44:39,540 INFO L225 Difference]: With dead ends: 33560 [2018-12-09 19:44:39,541 INFO L226 Difference]: Without dead ends: 31742 [2018-12-09 19:44:39,541 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:44:39,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31742 states. [2018-12-09 19:44:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31742 to 31742. [2018-12-09 19:44:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31742 states. [2018-12-09 19:44:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31742 states to 31742 states and 112962 transitions. [2018-12-09 19:44:39,951 INFO L78 Accepts]: Start accepts. Automaton has 31742 states and 112962 transitions. Word has length 45 [2018-12-09 19:44:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:44:39,951 INFO L480 AbstractCegarLoop]: Abstraction has 31742 states and 112962 transitions. [2018-12-09 19:44:39,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:44:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 31742 states and 112962 transitions. [2018-12-09 19:44:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:44:39,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:44:39,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:44:39,952 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:44:39,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:44:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1175559771, now seen corresponding path program 1 times [2018-12-09 19:44:39,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:44:39,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:39,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:44:39,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:39,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:44:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:44:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:44:40,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:44:40,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:44:40,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:44:40,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:44:40,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:44:40,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:44:40,004 INFO L87 Difference]: Start difference. First operand 31742 states and 112962 transitions. Second operand 5 states. [2018-12-09 19:44:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:44:40,457 INFO L93 Difference]: Finished difference Result 63360 states and 222752 transitions. [2018-12-09 19:44:40,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:44:40,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 19:44:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:44:40,591 INFO L225 Difference]: With dead ends: 63360 [2018-12-09 19:44:40,591 INFO L226 Difference]: Without dead ends: 63250 [2018-12-09 19:44:40,591 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:44:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63250 states. [2018-12-09 19:44:41,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63250 to 39276. [2018-12-09 19:44:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39276 states. [2018-12-09 19:44:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39276 states to 39276 states and 136384 transitions. [2018-12-09 19:44:41,352 INFO L78 Accepts]: Start accepts. Automaton has 39276 states and 136384 transitions. Word has length 46 [2018-12-09 19:44:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:44:41,352 INFO L480 AbstractCegarLoop]: Abstraction has 39276 states and 136384 transitions. [2018-12-09 19:44:41,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:44:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 39276 states and 136384 transitions. [2018-12-09 19:44:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 19:44:41,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:44:41,354 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:44:41,354 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:44:41,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:44:41,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1108738337, now seen corresponding path program 1 times [2018-12-09 19:44:41,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:44:41,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:41,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:44:41,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:41,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:44:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:44:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:44:41,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:44:41,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:44:41,388 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:44:41,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:44:41,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:44:41,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:44:41,389 INFO L87 Difference]: Start difference. First operand 39276 states and 136384 transitions. Second operand 3 states. [2018-12-09 19:44:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:44:41,618 INFO L93 Difference]: Finished difference Result 60855 states and 203999 transitions. [2018-12-09 19:44:41,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:44:41,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 19:44:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:44:41,710 INFO L225 Difference]: With dead ends: 60855 [2018-12-09 19:44:41,710 INFO L226 Difference]: Without dead ends: 60855 [2018-12-09 19:44:41,710 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:44:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60855 states. [2018-12-09 19:44:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60855 to 54767. [2018-12-09 19:44:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54767 states. [2018-12-09 19:44:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54767 states to 54767 states and 184631 transitions. [2018-12-09 19:44:42,480 INFO L78 Accepts]: Start accepts. Automaton has 54767 states and 184631 transitions. Word has length 48 [2018-12-09 19:44:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:44:42,480 INFO L480 AbstractCegarLoop]: Abstraction has 54767 states and 184631 transitions. [2018-12-09 19:44:42,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:44:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 54767 states and 184631 transitions. [2018-12-09 19:44:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 19:44:42,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:44:42,482 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:44:42,482 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:44:42,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:44:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash 28084908, now seen corresponding path program 1 times [2018-12-09 19:44:42,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:44:42,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:42,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:44:42,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:42,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:44:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:44:42,561 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:44:42,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:44:42,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:44:42,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:44:42,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:44:42,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:44:42,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:44:42,562 INFO L87 Difference]: Start difference. First operand 54767 states and 184631 transitions. Second operand 8 states. [2018-12-09 19:44:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:44:43,422 INFO L93 Difference]: Finished difference Result 69731 states and 227684 transitions. [2018-12-09 19:44:43,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:44:43,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-12-09 19:44:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:44:43,530 INFO L225 Difference]: With dead ends: 69731 [2018-12-09 19:44:43,531 INFO L226 Difference]: Without dead ends: 69607 [2018-12-09 19:44:43,531 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:44:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69607 states. [2018-12-09 19:44:44,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69607 to 56775. [2018-12-09 19:44:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56775 states. [2018-12-09 19:44:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56775 states to 56775 states and 189920 transitions. [2018-12-09 19:44:44,639 INFO L78 Accepts]: Start accepts. Automaton has 56775 states and 189920 transitions. Word has length 52 [2018-12-09 19:44:44,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:44:44,639 INFO L480 AbstractCegarLoop]: Abstraction has 56775 states and 189920 transitions. [2018-12-09 19:44:44,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:44:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 56775 states and 189920 transitions. [2018-12-09 19:44:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:44:44,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:44:44,643 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:44:44,643 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:44:44,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:44:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1485356584, now seen corresponding path program 1 times [2018-12-09 19:44:44,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:44:44,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:44,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:44:44,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:44,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:44:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:44:44,685 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:44:44,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:44:44,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:44:44,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:44:44,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:44:44,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:44:44,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:44:44,686 INFO L87 Difference]: Start difference. First operand 56775 states and 189920 transitions. Second operand 6 states. [2018-12-09 19:44:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:44:45,379 INFO L93 Difference]: Finished difference Result 110773 states and 367372 transitions. [2018-12-09 19:44:45,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:44:45,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 19:44:45,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:44:45,559 INFO L225 Difference]: With dead ends: 110773 [2018-12-09 19:44:45,559 INFO L226 Difference]: Without dead ends: 110717 [2018-12-09 19:44:45,559 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:44:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110717 states. [2018-12-09 19:44:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110717 to 72935. [2018-12-09 19:44:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72935 states. [2018-12-09 19:44:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72935 states to 72935 states and 238398 transitions. [2018-12-09 19:44:46,746 INFO L78 Accepts]: Start accepts. Automaton has 72935 states and 238398 transitions. Word has length 62 [2018-12-09 19:44:46,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:44:46,746 INFO L480 AbstractCegarLoop]: Abstraction has 72935 states and 238398 transitions. [2018-12-09 19:44:46,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:44:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 72935 states and 238398 transitions. [2018-12-09 19:44:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:44:46,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:44:46,753 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:44:46,753 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:44:46,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:44:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash -260667191, now seen corresponding path program 1 times [2018-12-09 19:44:46,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:44:46,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:46,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:44:46,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:46,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:44:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:44:46,805 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:44:46,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:44:46,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:44:46,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:44:46,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:44:46,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:44:46,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:44:46,806 INFO L87 Difference]: Start difference. First operand 72935 states and 238398 transitions. Second operand 7 states. [2018-12-09 19:44:47,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:44:47,739 INFO L93 Difference]: Finished difference Result 119360 states and 393342 transitions. [2018-12-09 19:44:47,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:44:47,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-12-09 19:44:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:44:47,933 INFO L225 Difference]: With dead ends: 119360 [2018-12-09 19:44:47,933 INFO L226 Difference]: Without dead ends: 119288 [2018-12-09 19:44:47,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:44:48,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119288 states. [2018-12-09 19:44:49,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119288 to 77093. [2018-12-09 19:44:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77093 states. [2018-12-09 19:44:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77093 states to 77093 states and 250179 transitions. [2018-12-09 19:44:49,267 INFO L78 Accepts]: Start accepts. Automaton has 77093 states and 250179 transitions. Word has length 68 [2018-12-09 19:44:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:44:49,267 INFO L480 AbstractCegarLoop]: Abstraction has 77093 states and 250179 transitions. [2018-12-09 19:44:49,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:44:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 77093 states and 250179 transitions. [2018-12-09 19:44:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 19:44:49,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:44:49,279 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:44:49,280 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:44:49,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:44:49,280 INFO L82 PathProgramCache]: Analyzing trace with hash -760398597, now seen corresponding path program 1 times [2018-12-09 19:44:49,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:44:49,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:49,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:44:49,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:49,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:44:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:44:49,363 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:44:49,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:44:49,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:44:49,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:44:49,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:44:49,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:44:49,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:44:49,364 INFO L87 Difference]: Start difference. First operand 77093 states and 250179 transitions. Second operand 9 states. [2018-12-09 19:44:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:44:50,998 INFO L93 Difference]: Finished difference Result 104535 states and 331511 transitions. [2018-12-09 19:44:50,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 19:44:50,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-12-09 19:44:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:44:51,153 INFO L225 Difference]: With dead ends: 104535 [2018-12-09 19:44:51,153 INFO L226 Difference]: Without dead ends: 104479 [2018-12-09 19:44:51,153 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:44:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104479 states. [2018-12-09 19:44:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104479 to 77966. [2018-12-09 19:44:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77966 states. [2018-12-09 19:44:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77966 states to 77966 states and 252956 transitions. [2018-12-09 19:44:52,283 INFO L78 Accepts]: Start accepts. Automaton has 77966 states and 252956 transitions. Word has length 74 [2018-12-09 19:44:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:44:52,283 INFO L480 AbstractCegarLoop]: Abstraction has 77966 states and 252956 transitions. [2018-12-09 19:44:52,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:44:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 77966 states and 252956 transitions. [2018-12-09 19:44:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 19:44:52,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:44:52,298 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:44:52,298 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:44:52,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:44:52,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2014750299, now seen corresponding path program 1 times [2018-12-09 19:44:52,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:44:52,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:52,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:44:52,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:52,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:44:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:44:52,343 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:44:52,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:44:52,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:44:52,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:44:52,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:44:52,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:44:52,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:44:52,344 INFO L87 Difference]: Start difference. First operand 77966 states and 252956 transitions. Second operand 5 states. [2018-12-09 19:44:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:44:52,745 INFO L93 Difference]: Finished difference Result 110313 states and 360156 transitions. [2018-12-09 19:44:52,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:44:52,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-09 19:44:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:44:52,940 INFO L225 Difference]: With dead ends: 110313 [2018-12-09 19:44:52,940 INFO L226 Difference]: Without dead ends: 110313 [2018-12-09 19:44:52,940 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:44:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110313 states. [2018-12-09 19:44:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110313 to 102002. [2018-12-09 19:44:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102002 states. [2018-12-09 19:44:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102002 states to 102002 states and 332817 transitions. [2018-12-09 19:44:54,457 INFO L78 Accepts]: Start accepts. Automaton has 102002 states and 332817 transitions. Word has length 76 [2018-12-09 19:44:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:44:54,457 INFO L480 AbstractCegarLoop]: Abstraction has 102002 states and 332817 transitions. [2018-12-09 19:44:54,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:44:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 102002 states and 332817 transitions. [2018-12-09 19:44:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 19:44:54,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:44:54,477 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:44:54,477 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:44:54,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:44:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash -271939964, now seen corresponding path program 1 times [2018-12-09 19:44:54,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:44:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:54,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:44:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:54,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:44:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:44:54,526 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:44:54,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:44:54,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:44:54,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:44:54,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:44:54,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:44:54,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:44:54,528 INFO L87 Difference]: Start difference. First operand 102002 states and 332817 transitions. Second operand 7 states. [2018-12-09 19:44:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:44:55,675 INFO L93 Difference]: Finished difference Result 187768 states and 613432 transitions. [2018-12-09 19:44:55,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:44:55,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-09 19:44:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:44:55,984 INFO L225 Difference]: With dead ends: 187768 [2018-12-09 19:44:55,984 INFO L226 Difference]: Without dead ends: 187697 [2018-12-09 19:44:55,985 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:44:56,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187697 states. [2018-12-09 19:44:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187697 to 121808. [2018-12-09 19:44:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121808 states. [2018-12-09 19:44:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121808 states to 121808 states and 391873 transitions. [2018-12-09 19:44:58,314 INFO L78 Accepts]: Start accepts. Automaton has 121808 states and 391873 transitions. Word has length 76 [2018-12-09 19:44:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:44:58,314 INFO L480 AbstractCegarLoop]: Abstraction has 121808 states and 391873 transitions. [2018-12-09 19:44:58,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:44:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 121808 states and 391873 transitions. [2018-12-09 19:44:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:44:58,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:44:58,339 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:44:58,339 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:44:58,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:44:58,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2068033077, now seen corresponding path program 1 times [2018-12-09 19:44:58,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:44:58,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:58,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:44:58,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:44:58,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:44:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:44:58,380 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:44:58,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:44:58,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:44:58,380 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:44:58,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:44:58,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:44:58,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:44:58,381 INFO L87 Difference]: Start difference. First operand 121808 states and 391873 transitions. Second operand 4 states. [2018-12-09 19:44:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:44:59,008 INFO L93 Difference]: Finished difference Result 132091 states and 421971 transitions. [2018-12-09 19:44:59,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:44:59,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 19:44:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:44:59,212 INFO L225 Difference]: With dead ends: 132091 [2018-12-09 19:44:59,212 INFO L226 Difference]: Without dead ends: 132091 [2018-12-09 19:44:59,213 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:44:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132091 states. [2018-12-09 19:45:00,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132091 to 128155. [2018-12-09 19:45:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128155 states. [2018-12-09 19:45:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128155 states to 128155 states and 410602 transitions. [2018-12-09 19:45:00,846 INFO L78 Accepts]: Start accepts. Automaton has 128155 states and 410602 transitions. Word has length 80 [2018-12-09 19:45:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:00,847 INFO L480 AbstractCegarLoop]: Abstraction has 128155 states and 410602 transitions. [2018-12-09 19:45:00,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:45:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 128155 states and 410602 transitions. [2018-12-09 19:45:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:45:00,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:00,875 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:45:00,876 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:00,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:00,876 INFO L82 PathProgramCache]: Analyzing trace with hash 132372790, now seen corresponding path program 1 times [2018-12-09 19:45:00,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:00,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:00,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:00,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:00,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:00,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:45:00,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:00,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:45:00,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:00,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:45:00,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:45:00,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:45:00,907 INFO L87 Difference]: Start difference. First operand 128155 states and 410602 transitions. Second operand 3 states. [2018-12-09 19:45:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:01,439 INFO L93 Difference]: Finished difference Result 129974 states and 415773 transitions. [2018-12-09 19:45:01,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:45:01,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-09 19:45:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:01,632 INFO L225 Difference]: With dead ends: 129974 [2018-12-09 19:45:01,632 INFO L226 Difference]: Without dead ends: 129974 [2018-12-09 19:45:01,632 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:45:02,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129974 states. [2018-12-09 19:45:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129974 to 129095. [2018-12-09 19:45:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129095 states. [2018-12-09 19:45:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129095 states to 129095 states and 413260 transitions. [2018-12-09 19:45:03,368 INFO L78 Accepts]: Start accepts. Automaton has 129095 states and 413260 transitions. Word has length 80 [2018-12-09 19:45:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:03,368 INFO L480 AbstractCegarLoop]: Abstraction has 129095 states and 413260 transitions. [2018-12-09 19:45:03,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:45:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 129095 states and 413260 transitions. [2018-12-09 19:45:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:45:03,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:03,397 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:45:03,397 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:03,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash 394157484, now seen corresponding path program 1 times [2018-12-09 19:45:03,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:03,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:03,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:03,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:03,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:03,470 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:45:03,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:03,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:45:03,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:03,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:45:03,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:45:03,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:45:03,471 INFO L87 Difference]: Start difference. First operand 129095 states and 413260 transitions. Second operand 10 states. [2018-12-09 19:45:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:06,398 INFO L93 Difference]: Finished difference Result 169279 states and 531404 transitions. [2018-12-09 19:45:06,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 19:45:06,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-12-09 19:45:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:06,656 INFO L225 Difference]: With dead ends: 169279 [2018-12-09 19:45:06,656 INFO L226 Difference]: Without dead ends: 169203 [2018-12-09 19:45:06,657 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:45:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169203 states. [2018-12-09 19:45:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169203 to 127980. [2018-12-09 19:45:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127980 states. [2018-12-09 19:45:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127980 states to 127980 states and 410098 transitions. [2018-12-09 19:45:08,724 INFO L78 Accepts]: Start accepts. Automaton has 127980 states and 410098 transitions. Word has length 80 [2018-12-09 19:45:08,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:08,724 INFO L480 AbstractCegarLoop]: Abstraction has 127980 states and 410098 transitions. [2018-12-09 19:45:08,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:45:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 127980 states and 410098 transitions. [2018-12-09 19:45:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:45:08,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:08,755 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:45:08,755 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:08,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:08,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1341674495, now seen corresponding path program 1 times [2018-12-09 19:45:08,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:08,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:08,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:08,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:08,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:08,805 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:45:08,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:08,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:45:08,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:08,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:45:08,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:45:08,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:45:08,806 INFO L87 Difference]: Start difference. First operand 127980 states and 410098 transitions. Second operand 6 states. [2018-12-09 19:45:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:10,166 INFO L93 Difference]: Finished difference Result 139402 states and 443686 transitions. [2018-12-09 19:45:10,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:45:10,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 19:45:10,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:10,382 INFO L225 Difference]: With dead ends: 139402 [2018-12-09 19:45:10,382 INFO L226 Difference]: Without dead ends: 139402 [2018-12-09 19:45:10,382 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:45:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139402 states. [2018-12-09 19:45:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139402 to 135898. [2018-12-09 19:45:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135898 states. [2018-12-09 19:45:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135898 states to 135898 states and 433872 transitions. [2018-12-09 19:45:12,191 INFO L78 Accepts]: Start accepts. Automaton has 135898 states and 433872 transitions. Word has length 82 [2018-12-09 19:45:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:12,191 INFO L480 AbstractCegarLoop]: Abstraction has 135898 states and 433872 transitions. [2018-12-09 19:45:12,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:45:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 135898 states and 433872 transitions. [2018-12-09 19:45:12,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:45:12,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:12,224 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:45:12,224 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:12,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:12,224 INFO L82 PathProgramCache]: Analyzing trace with hash -593985792, now seen corresponding path program 1 times [2018-12-09 19:45:12,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:12,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:12,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:12,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:12,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:12,283 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:45:12,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:12,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:45:12,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:12,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:45:12,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:45:12,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:45:12,283 INFO L87 Difference]: Start difference. First operand 135898 states and 433872 transitions. Second operand 6 states. [2018-12-09 19:45:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:13,102 INFO L93 Difference]: Finished difference Result 143883 states and 451858 transitions. [2018-12-09 19:45:13,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:45:13,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 19:45:13,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:13,318 INFO L225 Difference]: With dead ends: 143883 [2018-12-09 19:45:13,318 INFO L226 Difference]: Without dead ends: 143883 [2018-12-09 19:45:13,318 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:45:13,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143883 states. [2018-12-09 19:45:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143883 to 138092. [2018-12-09 19:45:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138092 states. [2018-12-09 19:45:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138092 states to 138092 states and 437140 transitions. [2018-12-09 19:45:15,367 INFO L78 Accepts]: Start accepts. Automaton has 138092 states and 437140 transitions. Word has length 82 [2018-12-09 19:45:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:15,367 INFO L480 AbstractCegarLoop]: Abstraction has 138092 states and 437140 transitions. [2018-12-09 19:45:15,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:45:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 138092 states and 437140 transitions. [2018-12-09 19:45:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:45:15,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:15,396 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:45:15,397 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:15,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash -264220031, now seen corresponding path program 1 times [2018-12-09 19:45:15,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:15,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:15,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:15,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:15,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:15,447 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:45:15,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:15,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:45:15,448 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:15,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:45:15,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:45:15,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:45:15,449 INFO L87 Difference]: Start difference. First operand 138092 states and 437140 transitions. Second operand 5 states. [2018-12-09 19:45:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:16,218 INFO L93 Difference]: Finished difference Result 160064 states and 502579 transitions. [2018-12-09 19:45:16,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:45:16,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 19:45:16,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:16,457 INFO L225 Difference]: With dead ends: 160064 [2018-12-09 19:45:16,458 INFO L226 Difference]: Without dead ends: 160064 [2018-12-09 19:45:16,458 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:45:16,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160064 states. [2018-12-09 19:45:18,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160064 to 148241. [2018-12-09 19:45:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148241 states. [2018-12-09 19:45:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148241 states to 148241 states and 466166 transitions. [2018-12-09 19:45:18,650 INFO L78 Accepts]: Start accepts. Automaton has 148241 states and 466166 transitions. Word has length 82 [2018-12-09 19:45:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:18,650 INFO L480 AbstractCegarLoop]: Abstraction has 148241 states and 466166 transitions. [2018-12-09 19:45:18,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:45:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 148241 states and 466166 transitions. [2018-12-09 19:45:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:45:18,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:18,685 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:45:18,685 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:18,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2020643424, now seen corresponding path program 1 times [2018-12-09 19:45:18,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:18,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:18,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:18,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:18,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:18,730 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:45:18,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:18,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:45:18,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:18,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:45:18,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:45:18,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:45:18,731 INFO L87 Difference]: Start difference. First operand 148241 states and 466166 transitions. Second operand 5 states. [2018-12-09 19:45:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:19,625 INFO L93 Difference]: Finished difference Result 177929 states and 555113 transitions. [2018-12-09 19:45:19,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:45:19,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 19:45:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:19,906 INFO L225 Difference]: With dead ends: 177929 [2018-12-09 19:45:19,906 INFO L226 Difference]: Without dead ends: 177929 [2018-12-09 19:45:19,906 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:45:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177929 states. [2018-12-09 19:45:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177929 to 167311. [2018-12-09 19:45:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167311 states. [2018-12-09 19:45:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167311 states to 167311 states and 524219 transitions. [2018-12-09 19:45:23,925 INFO L78 Accepts]: Start accepts. Automaton has 167311 states and 524219 transitions. Word has length 82 [2018-12-09 19:45:23,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:23,925 INFO L480 AbstractCegarLoop]: Abstraction has 167311 states and 524219 transitions. [2018-12-09 19:45:23,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:45:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 167311 states and 524219 transitions. [2018-12-09 19:45:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:45:23,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:23,971 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:45:23,972 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:23,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:23,972 INFO L82 PathProgramCache]: Analyzing trace with hash -56565919, now seen corresponding path program 1 times [2018-12-09 19:45:23,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:23,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:23,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:23,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:23,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:45:24,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:24,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:45:24,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:24,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:45:24,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:45:24,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:45:24,000 INFO L87 Difference]: Start difference. First operand 167311 states and 524219 transitions. Second operand 4 states. [2018-12-09 19:45:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:25,169 INFO L93 Difference]: Finished difference Result 233999 states and 731439 transitions. [2018-12-09 19:45:25,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:45:25,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-09 19:45:25,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:25,548 INFO L225 Difference]: With dead ends: 233999 [2018-12-09 19:45:25,548 INFO L226 Difference]: Without dead ends: 233767 [2018-12-09 19:45:25,548 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:45:26,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233767 states. [2018-12-09 19:45:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233767 to 204343. [2018-12-09 19:45:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204343 states. [2018-12-09 19:45:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204343 states to 204343 states and 641541 transitions. [2018-12-09 19:45:28,528 INFO L78 Accepts]: Start accepts. Automaton has 204343 states and 641541 transitions. Word has length 82 [2018-12-09 19:45:28,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:28,529 INFO L480 AbstractCegarLoop]: Abstraction has 204343 states and 641541 transitions. [2018-12-09 19:45:28,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:45:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 204343 states and 641541 transitions. [2018-12-09 19:45:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:45:28,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:28,594 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:45:28,595 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:28,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:28,595 INFO L82 PathProgramCache]: Analyzing trace with hash 905048098, now seen corresponding path program 1 times [2018-12-09 19:45:28,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:28,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:28,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:28,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:28,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:28,641 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:45:28,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:28,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:45:28,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:28,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:45:28,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:45:28,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:45:28,642 INFO L87 Difference]: Start difference. First operand 204343 states and 641541 transitions. Second operand 5 states. [2018-12-09 19:45:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:29,629 INFO L93 Difference]: Finished difference Result 219711 states and 678043 transitions. [2018-12-09 19:45:29,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:45:29,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 19:45:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:30,364 INFO L225 Difference]: With dead ends: 219711 [2018-12-09 19:45:30,364 INFO L226 Difference]: Without dead ends: 219535 [2018-12-09 19:45:30,364 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:45:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219535 states. [2018-12-09 19:45:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219535 to 181816. [2018-12-09 19:45:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181816 states. [2018-12-09 19:45:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181816 states to 181816 states and 565629 transitions. [2018-12-09 19:45:35,307 INFO L78 Accepts]: Start accepts. Automaton has 181816 states and 565629 transitions. Word has length 82 [2018-12-09 19:45:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:35,307 INFO L480 AbstractCegarLoop]: Abstraction has 181816 states and 565629 transitions. [2018-12-09 19:45:35,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:45:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 181816 states and 565629 transitions. [2018-12-09 19:45:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:45:35,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:35,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:45:35,346 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:35,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:35,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2145154717, now seen corresponding path program 1 times [2018-12-09 19:45:35,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:35,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:35,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:35,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:35,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:35,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:45:35,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:35,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:45:35,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:35,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:45:35,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:45:35,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:45:35,375 INFO L87 Difference]: Start difference. First operand 181816 states and 565629 transitions. Second operand 5 states. [2018-12-09 19:45:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:35,423 INFO L93 Difference]: Finished difference Result 18256 states and 44415 transitions. [2018-12-09 19:45:35,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:45:35,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 19:45:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:35,434 INFO L225 Difference]: With dead ends: 18256 [2018-12-09 19:45:35,434 INFO L226 Difference]: Without dead ends: 15627 [2018-12-09 19:45:35,435 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:45:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15627 states. [2018-12-09 19:45:35,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15627 to 14310. [2018-12-09 19:45:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14310 states. [2018-12-09 19:45:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14310 states to 14310 states and 33903 transitions. [2018-12-09 19:45:35,550 INFO L78 Accepts]: Start accepts. Automaton has 14310 states and 33903 transitions. Word has length 82 [2018-12-09 19:45:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:35,550 INFO L480 AbstractCegarLoop]: Abstraction has 14310 states and 33903 transitions. [2018-12-09 19:45:35,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:45:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 14310 states and 33903 transitions. [2018-12-09 19:45:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 19:45:35,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:35,558 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:45:35,558 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:35,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1849176376, now seen corresponding path program 1 times [2018-12-09 19:45:35,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:35,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:35,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:35,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:35,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:45:35,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:35,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:45:35,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:35,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:45:35,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:45:35,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:45:35,595 INFO L87 Difference]: Start difference. First operand 14310 states and 33903 transitions. Second operand 6 states. [2018-12-09 19:45:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:35,783 INFO L93 Difference]: Finished difference Result 18366 states and 43448 transitions. [2018-12-09 19:45:35,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:45:35,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-12-09 19:45:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:35,797 INFO L225 Difference]: With dead ends: 18366 [2018-12-09 19:45:35,797 INFO L226 Difference]: Without dead ends: 18366 [2018-12-09 19:45:35,797 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:45:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18366 states. [2018-12-09 19:45:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18366 to 16694. [2018-12-09 19:45:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16694 states. [2018-12-09 19:45:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16694 states to 16694 states and 39650 transitions. [2018-12-09 19:45:35,934 INFO L78 Accepts]: Start accepts. Automaton has 16694 states and 39650 transitions. Word has length 88 [2018-12-09 19:45:35,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:35,934 INFO L480 AbstractCegarLoop]: Abstraction has 16694 states and 39650 transitions. [2018-12-09 19:45:35,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:45:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16694 states and 39650 transitions. [2018-12-09 19:45:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 19:45:35,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:35,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:35,944 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:35,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash -106366041, now seen corresponding path program 1 times [2018-12-09 19:45:35,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:35,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:35,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:35,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:35,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:45:36,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:36,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:45:36,004 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:36,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:45:36,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:45:36,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:45:36,004 INFO L87 Difference]: Start difference. First operand 16694 states and 39650 transitions. Second operand 8 states. [2018-12-09 19:45:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:36,430 INFO L93 Difference]: Finished difference Result 28303 states and 67333 transitions. [2018-12-09 19:45:36,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:45:36,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-12-09 19:45:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:36,450 INFO L225 Difference]: With dead ends: 28303 [2018-12-09 19:45:36,450 INFO L226 Difference]: Without dead ends: 28189 [2018-12-09 19:45:36,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-12-09 19:45:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28189 states. [2018-12-09 19:45:36,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28189 to 17809. [2018-12-09 19:45:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17809 states. [2018-12-09 19:45:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17809 states to 17809 states and 42023 transitions. [2018-12-09 19:45:36,634 INFO L78 Accepts]: Start accepts. Automaton has 17809 states and 42023 transitions. Word has length 88 [2018-12-09 19:45:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:36,634 INFO L480 AbstractCegarLoop]: Abstraction has 17809 states and 42023 transitions. [2018-12-09 19:45:36,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:45:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 17809 states and 42023 transitions. [2018-12-09 19:45:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 19:45:36,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:36,645 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:45:36,645 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:36,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:36,646 INFO L82 PathProgramCache]: Analyzing trace with hash -594830456, now seen corresponding path program 1 times [2018-12-09 19:45:36,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:36,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:36,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:36,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:36,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:36,684 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:45:36,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:36,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:45:36,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:36,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:45:36,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:45:36,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:45:36,685 INFO L87 Difference]: Start difference. First operand 17809 states and 42023 transitions. Second operand 6 states. [2018-12-09 19:45:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:36,848 INFO L93 Difference]: Finished difference Result 22682 states and 53302 transitions. [2018-12-09 19:45:36,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:45:36,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-12-09 19:45:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:36,865 INFO L225 Difference]: With dead ends: 22682 [2018-12-09 19:45:36,865 INFO L226 Difference]: Without dead ends: 22682 [2018-12-09 19:45:36,865 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:45:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22682 states. [2018-12-09 19:45:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22682 to 17804. [2018-12-09 19:45:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17804 states. [2018-12-09 19:45:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17804 states to 17804 states and 42001 transitions. [2018-12-09 19:45:37,022 INFO L78 Accepts]: Start accepts. Automaton has 17804 states and 42001 transitions. Word has length 88 [2018-12-09 19:45:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:37,023 INFO L480 AbstractCegarLoop]: Abstraction has 17804 states and 42001 transitions. [2018-12-09 19:45:37,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:45:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 17804 states and 42001 transitions. [2018-12-09 19:45:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 19:45:37,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:37,034 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:45:37,034 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:37,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:37,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1147979879, now seen corresponding path program 1 times [2018-12-09 19:45:37,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:37,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:37,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:37,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:37,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:37,112 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:45:37,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:37,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:45:37,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:37,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:45:37,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:45:37,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:45:37,113 INFO L87 Difference]: Start difference. First operand 17804 states and 42001 transitions. Second operand 10 states. [2018-12-09 19:45:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:37,814 INFO L93 Difference]: Finished difference Result 20835 states and 48650 transitions. [2018-12-09 19:45:37,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 19:45:37,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-12-09 19:45:37,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:37,829 INFO L225 Difference]: With dead ends: 20835 [2018-12-09 19:45:37,829 INFO L226 Difference]: Without dead ends: 20749 [2018-12-09 19:45:37,829 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:45:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20749 states. [2018-12-09 19:45:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20749 to 17590. [2018-12-09 19:45:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17590 states. [2018-12-09 19:45:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17590 states to 17590 states and 41562 transitions. [2018-12-09 19:45:37,981 INFO L78 Accepts]: Start accepts. Automaton has 17590 states and 41562 transitions. Word has length 88 [2018-12-09 19:45:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:37,982 INFO L480 AbstractCegarLoop]: Abstraction has 17590 states and 41562 transitions. [2018-12-09 19:45:37,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:45:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 17590 states and 41562 transitions. [2018-12-09 19:45:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:45:37,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:37,993 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:45:37,994 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:37,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash -968928213, now seen corresponding path program 1 times [2018-12-09 19:45:37,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:37,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:37,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:37,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:37,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:38,061 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:45:38,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:38,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:45:38,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:38,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:45:38,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:45:38,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:45:38,062 INFO L87 Difference]: Start difference. First operand 17590 states and 41562 transitions. Second operand 7 states. [2018-12-09 19:45:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:38,308 INFO L93 Difference]: Finished difference Result 22434 states and 52977 transitions. [2018-12-09 19:45:38,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:45:38,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 19:45:38,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:38,324 INFO L225 Difference]: With dead ends: 22434 [2018-12-09 19:45:38,324 INFO L226 Difference]: Without dead ends: 22434 [2018-12-09 19:45:38,324 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:45:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2018-12-09 19:45:38,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 18153. [2018-12-09 19:45:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18153 states. [2018-12-09 19:45:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18153 states to 18153 states and 42901 transitions. [2018-12-09 19:45:38,475 INFO L78 Accepts]: Start accepts. Automaton has 18153 states and 42901 transitions. Word has length 100 [2018-12-09 19:45:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:38,475 INFO L480 AbstractCegarLoop]: Abstraction has 18153 states and 42901 transitions. [2018-12-09 19:45:38,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:45:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 18153 states and 42901 transitions. [2018-12-09 19:45:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:45:38,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:38,486 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:45:38,487 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:38,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:38,487 INFO L82 PathProgramCache]: Analyzing trace with hash 773882122, now seen corresponding path program 1 times [2018-12-09 19:45:38,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:38,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:38,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:38,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:38,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:38,653 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:45:38,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:38,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:45:38,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:38,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:45:38,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:45:38,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:45:38,654 INFO L87 Difference]: Start difference. First operand 18153 states and 42901 transitions. Second operand 11 states. [2018-12-09 19:45:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:39,439 INFO L93 Difference]: Finished difference Result 21139 states and 49475 transitions. [2018-12-09 19:45:39,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 19:45:39,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2018-12-09 19:45:39,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:39,454 INFO L225 Difference]: With dead ends: 21139 [2018-12-09 19:45:39,454 INFO L226 Difference]: Without dead ends: 21009 [2018-12-09 19:45:39,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 19:45:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21009 states. [2018-12-09 19:45:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21009 to 16774. [2018-12-09 19:45:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16774 states. [2018-12-09 19:45:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16774 states to 16774 states and 39914 transitions. [2018-12-09 19:45:39,607 INFO L78 Accepts]: Start accepts. Automaton has 16774 states and 39914 transitions. Word has length 100 [2018-12-09 19:45:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:39,607 INFO L480 AbstractCegarLoop]: Abstraction has 16774 states and 39914 transitions. [2018-12-09 19:45:39,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:45:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 16774 states and 39914 transitions. [2018-12-09 19:45:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 19:45:39,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:39,619 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:45:39,620 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:39,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:39,620 INFO L82 PathProgramCache]: Analyzing trace with hash -906257866, now seen corresponding path program 1 times [2018-12-09 19:45:39,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:39,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:39,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:39,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:39,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:45:39,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:39,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:45:39,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:39,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:45:39,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:45:39,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:45:39,688 INFO L87 Difference]: Start difference. First operand 16774 states and 39914 transitions. Second operand 7 states. [2018-12-09 19:45:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:40,220 INFO L93 Difference]: Finished difference Result 20448 states and 48334 transitions. [2018-12-09 19:45:40,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:45:40,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-12-09 19:45:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:40,234 INFO L225 Difference]: With dead ends: 20448 [2018-12-09 19:45:40,234 INFO L226 Difference]: Without dead ends: 20448 [2018-12-09 19:45:40,234 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:45:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20448 states. [2018-12-09 19:45:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20448 to 17150. [2018-12-09 19:45:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17150 states. [2018-12-09 19:45:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17150 states to 17150 states and 40983 transitions. [2018-12-09 19:45:40,383 INFO L78 Accepts]: Start accepts. Automaton has 17150 states and 40983 transitions. Word has length 125 [2018-12-09 19:45:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:40,384 INFO L480 AbstractCegarLoop]: Abstraction has 17150 states and 40983 transitions. [2018-12-09 19:45:40,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:45:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 17150 states and 40983 transitions. [2018-12-09 19:45:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 19:45:40,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:40,397 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:45:40,397 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:40,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash 295243193, now seen corresponding path program 1 times [2018-12-09 19:45:40,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:40,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:40,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:40,437 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:45:40,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:40,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:45:40,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:40,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:45:40,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:45:40,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:45:40,438 INFO L87 Difference]: Start difference. First operand 17150 states and 40983 transitions. Second operand 5 states. [2018-12-09 19:45:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:40,608 INFO L93 Difference]: Finished difference Result 26994 states and 63376 transitions. [2018-12-09 19:45:40,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:45:40,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2018-12-09 19:45:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:40,628 INFO L225 Difference]: With dead ends: 26994 [2018-12-09 19:45:40,628 INFO L226 Difference]: Without dead ends: 26994 [2018-12-09 19:45:40,628 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:45:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26994 states. [2018-12-09 19:45:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26994 to 24454. [2018-12-09 19:45:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24454 states. [2018-12-09 19:45:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24454 states to 24454 states and 57989 transitions. [2018-12-09 19:45:40,843 INFO L78 Accepts]: Start accepts. Automaton has 24454 states and 57989 transitions. Word has length 125 [2018-12-09 19:45:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:40,844 INFO L480 AbstractCegarLoop]: Abstraction has 24454 states and 57989 transitions. [2018-12-09 19:45:40,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:45:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 24454 states and 57989 transitions. [2018-12-09 19:45:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:45:40,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:40,862 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:45:40,862 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:40,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:40,862 INFO L82 PathProgramCache]: Analyzing trace with hash 25931487, now seen corresponding path program 1 times [2018-12-09 19:45:40,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:40,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:40,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:40,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:40,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:40,910 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:45:40,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:40,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:45:40,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:40,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:45:40,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:45:40,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:45:40,911 INFO L87 Difference]: Start difference. First operand 24454 states and 57989 transitions. Second operand 6 states. [2018-12-09 19:45:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:41,080 INFO L93 Difference]: Finished difference Result 37692 states and 89177 transitions. [2018-12-09 19:45:41,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:45:41,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-09 19:45:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:41,109 INFO L225 Difference]: With dead ends: 37692 [2018-12-09 19:45:41,109 INFO L226 Difference]: Without dead ends: 37692 [2018-12-09 19:45:41,110 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:45:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37692 states. [2018-12-09 19:45:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37692 to 24305. [2018-12-09 19:45:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24305 states. [2018-12-09 19:45:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24305 states to 24305 states and 57756 transitions. [2018-12-09 19:45:41,364 INFO L78 Accepts]: Start accepts. Automaton has 24305 states and 57756 transitions. Word has length 127 [2018-12-09 19:45:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:41,365 INFO L480 AbstractCegarLoop]: Abstraction has 24305 states and 57756 transitions. [2018-12-09 19:45:41,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:45:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 24305 states and 57756 transitions. [2018-12-09 19:45:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:45:41,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:41,384 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:45:41,384 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:41,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:41,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1157415810, now seen corresponding path program 1 times [2018-12-09 19:45:41,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:41,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:41,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:41,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:41,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:41,425 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:45:41,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:41,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:45:41,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:41,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:45:41,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:45:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:45:41,426 INFO L87 Difference]: Start difference. First operand 24305 states and 57756 transitions. Second operand 4 states. [2018-12-09 19:45:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:41,681 INFO L93 Difference]: Finished difference Result 30698 states and 71631 transitions. [2018-12-09 19:45:41,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:45:41,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-09 19:45:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:41,703 INFO L225 Difference]: With dead ends: 30698 [2018-12-09 19:45:41,703 INFO L226 Difference]: Without dead ends: 30631 [2018-12-09 19:45:41,703 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:45:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30631 states. [2018-12-09 19:45:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30631 to 28665. [2018-12-09 19:45:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28665 states. [2018-12-09 19:45:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28665 states to 28665 states and 67379 transitions. [2018-12-09 19:45:41,956 INFO L78 Accepts]: Start accepts. Automaton has 28665 states and 67379 transitions. Word has length 127 [2018-12-09 19:45:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:41,956 INFO L480 AbstractCegarLoop]: Abstraction has 28665 states and 67379 transitions. [2018-12-09 19:45:41,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:45:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 28665 states and 67379 transitions. [2018-12-09 19:45:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:45:41,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:41,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:41,979 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:41,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:41,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1201891199, now seen corresponding path program 1 times [2018-12-09 19:45:41,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:41,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:41,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:41,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:41,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:42,070 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:45:42,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:42,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:45:42,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:42,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:45:42,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:45:42,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:45:42,071 INFO L87 Difference]: Start difference. First operand 28665 states and 67379 transitions. Second operand 11 states. [2018-12-09 19:45:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:43,930 INFO L93 Difference]: Finished difference Result 75448 states and 177106 transitions. [2018-12-09 19:45:43,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 19:45:43,931 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2018-12-09 19:45:43,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:43,979 INFO L225 Difference]: With dead ends: 75448 [2018-12-09 19:45:43,979 INFO L226 Difference]: Without dead ends: 57405 [2018-12-09 19:45:43,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2018-12-09 19:45:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57405 states. [2018-12-09 19:45:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57405 to 27910. [2018-12-09 19:45:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27910 states. [2018-12-09 19:45:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27910 states to 27910 states and 65707 transitions. [2018-12-09 19:45:44,349 INFO L78 Accepts]: Start accepts. Automaton has 27910 states and 65707 transitions. Word has length 127 [2018-12-09 19:45:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:44,349 INFO L480 AbstractCegarLoop]: Abstraction has 27910 states and 65707 transitions. [2018-12-09 19:45:44,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:45:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 27910 states and 65707 transitions. [2018-12-09 19:45:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:45:44,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:44,371 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:45:44,371 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:44,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash -60439278, now seen corresponding path program 1 times [2018-12-09 19:45:44,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:44,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:44,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:44,446 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:45:44,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:44,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:45:44,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:44,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:45:44,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:45:44,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:45:44,447 INFO L87 Difference]: Start difference. First operand 27910 states and 65707 transitions. Second operand 6 states. [2018-12-09 19:45:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:44,645 INFO L93 Difference]: Finished difference Result 30652 states and 71268 transitions. [2018-12-09 19:45:44,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:45:44,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-09 19:45:44,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:44,668 INFO L225 Difference]: With dead ends: 30652 [2018-12-09 19:45:44,668 INFO L226 Difference]: Without dead ends: 30610 [2018-12-09 19:45:44,669 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:45:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30610 states. [2018-12-09 19:45:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30610 to 27193. [2018-12-09 19:45:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27193 states. [2018-12-09 19:45:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27193 states to 27193 states and 63382 transitions. [2018-12-09 19:45:44,925 INFO L78 Accepts]: Start accepts. Automaton has 27193 states and 63382 transitions. Word has length 127 [2018-12-09 19:45:44,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:44,925 INFO L480 AbstractCegarLoop]: Abstraction has 27193 states and 63382 transitions. [2018-12-09 19:45:44,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:45:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 27193 states and 63382 transitions. [2018-12-09 19:45:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:45:44,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:44,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:44,946 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:44,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:44,947 INFO L82 PathProgramCache]: Analyzing trace with hash 577542988, now seen corresponding path program 1 times [2018-12-09 19:45:44,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:44,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:44,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:44,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:44,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:44,989 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:45:44,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:44,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:45:44,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:44,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:45:44,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:45:44,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:45:44,989 INFO L87 Difference]: Start difference. First operand 27193 states and 63382 transitions. Second operand 5 states. [2018-12-09 19:45:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:45,204 INFO L93 Difference]: Finished difference Result 28839 states and 66769 transitions. [2018-12-09 19:45:45,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:45:45,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-09 19:45:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:45,224 INFO L225 Difference]: With dead ends: 28839 [2018-12-09 19:45:45,224 INFO L226 Difference]: Without dead ends: 28839 [2018-12-09 19:45:45,225 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:45:45,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28839 states. [2018-12-09 19:45:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28839 to 27412. [2018-12-09 19:45:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27412 states. [2018-12-09 19:45:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27412 states to 27412 states and 63848 transitions. [2018-12-09 19:45:45,468 INFO L78 Accepts]: Start accepts. Automaton has 27412 states and 63848 transitions. Word has length 127 [2018-12-09 19:45:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:45,468 INFO L480 AbstractCegarLoop]: Abstraction has 27412 states and 63848 transitions. [2018-12-09 19:45:45,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:45:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 27412 states and 63848 transitions. [2018-12-09 19:45:45,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:45:45,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:45,490 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:45:45,491 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:45,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:45,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1488351502, now seen corresponding path program 2 times [2018-12-09 19:45:45,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:45,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:45,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:45,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:45,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:45,534 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:45:45,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:45,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:45:45,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:45,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:45:45,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:45:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:45:45,535 INFO L87 Difference]: Start difference. First operand 27412 states and 63848 transitions. Second operand 6 states. [2018-12-09 19:45:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:45,743 INFO L93 Difference]: Finished difference Result 27526 states and 63909 transitions. [2018-12-09 19:45:45,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:45:45,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-09 19:45:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:45,764 INFO L225 Difference]: With dead ends: 27526 [2018-12-09 19:45:45,765 INFO L226 Difference]: Without dead ends: 27526 [2018-12-09 19:45:45,765 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:45:45,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27526 states. [2018-12-09 19:45:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27526 to 24870. [2018-12-09 19:45:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24870 states. [2018-12-09 19:45:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24870 states to 24870 states and 57768 transitions. [2018-12-09 19:45:45,990 INFO L78 Accepts]: Start accepts. Automaton has 24870 states and 57768 transitions. Word has length 127 [2018-12-09 19:45:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:45,990 INFO L480 AbstractCegarLoop]: Abstraction has 24870 states and 57768 transitions. [2018-12-09 19:45:45,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:45:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 24870 states and 57768 transitions. [2018-12-09 19:45:46,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:45:46,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:46,011 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:45:46,011 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:46,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:46,011 INFO L82 PathProgramCache]: Analyzing trace with hash 893789617, now seen corresponding path program 2 times [2018-12-09 19:45:46,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:46,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:46,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:45:46,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:46,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:46,083 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:45:46,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:46,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:45:46,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:46,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:45:46,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:45:46,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:45:46,083 INFO L87 Difference]: Start difference. First operand 24870 states and 57768 transitions. Second operand 7 states. [2018-12-09 19:45:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:46,630 INFO L93 Difference]: Finished difference Result 39862 states and 92923 transitions. [2018-12-09 19:45:46,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:45:46,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-12-09 19:45:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:46,638 INFO L225 Difference]: With dead ends: 39862 [2018-12-09 19:45:46,638 INFO L226 Difference]: Without dead ends: 12503 [2018-12-09 19:45:46,638 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:45:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2018-12-09 19:45:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 12503. [2018-12-09 19:45:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12503 states. [2018-12-09 19:45:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12503 states to 12503 states and 29534 transitions. [2018-12-09 19:45:46,730 INFO L78 Accepts]: Start accepts. Automaton has 12503 states and 29534 transitions. Word has length 127 [2018-12-09 19:45:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:46,730 INFO L480 AbstractCegarLoop]: Abstraction has 12503 states and 29534 transitions. [2018-12-09 19:45:46,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:45:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 12503 states and 29534 transitions. [2018-12-09 19:45:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:45:46,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:46,739 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:45:46,739 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:46,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:46,739 INFO L82 PathProgramCache]: Analyzing trace with hash 528390363, now seen corresponding path program 3 times [2018-12-09 19:45:46,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:46,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:46,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:45:46,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:46,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:46,869 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:45:46,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:46,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 19:45:46,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:46,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 19:45:46,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 19:45:46,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:45:46,870 INFO L87 Difference]: Start difference. First operand 12503 states and 29534 transitions. Second operand 15 states. [2018-12-09 19:45:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:47,415 INFO L93 Difference]: Finished difference Result 27006 states and 64211 transitions. [2018-12-09 19:45:47,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:45:47,416 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 127 [2018-12-09 19:45:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:47,433 INFO L225 Difference]: With dead ends: 27006 [2018-12-09 19:45:47,433 INFO L226 Difference]: Without dead ends: 25346 [2018-12-09 19:45:47,433 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:45:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2018-12-09 19:45:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 20915. [2018-12-09 19:45:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20915 states. [2018-12-09 19:45:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20915 states to 20915 states and 49002 transitions. [2018-12-09 19:45:47,619 INFO L78 Accepts]: Start accepts. Automaton has 20915 states and 49002 transitions. Word has length 127 [2018-12-09 19:45:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:47,620 INFO L480 AbstractCegarLoop]: Abstraction has 20915 states and 49002 transitions. [2018-12-09 19:45:47,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 19:45:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 20915 states and 49002 transitions. [2018-12-09 19:45:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:45:47,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:47,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:47,634 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:47,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:47,634 INFO L82 PathProgramCache]: Analyzing trace with hash 520631004, now seen corresponding path program 1 times [2018-12-09 19:45:47,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:47,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:47,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:45:47,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:47,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:47,701 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:45:47,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:47,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:45:47,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:47,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:45:47,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:45:47,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:45:47,702 INFO L87 Difference]: Start difference. First operand 20915 states and 49002 transitions. Second operand 5 states. [2018-12-09 19:45:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:47,783 INFO L93 Difference]: Finished difference Result 17074 states and 39845 transitions. [2018-12-09 19:45:47,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:45:47,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-09 19:45:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:47,795 INFO L225 Difference]: With dead ends: 17074 [2018-12-09 19:45:47,795 INFO L226 Difference]: Without dead ends: 17074 [2018-12-09 19:45:47,795 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:45:47,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17074 states. [2018-12-09 19:45:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17074 to 16940. [2018-12-09 19:45:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16940 states. [2018-12-09 19:45:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16940 states to 16940 states and 39561 transitions. [2018-12-09 19:45:47,927 INFO L78 Accepts]: Start accepts. Automaton has 16940 states and 39561 transitions. Word has length 127 [2018-12-09 19:45:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:47,928 INFO L480 AbstractCegarLoop]: Abstraction has 16940 states and 39561 transitions. [2018-12-09 19:45:47,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:45:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 16940 states and 39561 transitions. [2018-12-09 19:45:47,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:45:47,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:47,941 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:45:47,941 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:47,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:47,941 INFO L82 PathProgramCache]: Analyzing trace with hash -42610214, now seen corresponding path program 2 times [2018-12-09 19:45:47,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:47,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:47,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:45:47,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:47,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:45:48,026 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:45:48,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:45:48,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:45:48,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:45:48,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:45:48,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:45:48,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:45:48,027 INFO L87 Difference]: Start difference. First operand 16940 states and 39561 transitions. Second operand 8 states. [2018-12-09 19:45:48,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:45:48,616 INFO L93 Difference]: Finished difference Result 19482 states and 45243 transitions. [2018-12-09 19:45:48,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:45:48,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-12-09 19:45:48,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:45:48,635 INFO L225 Difference]: With dead ends: 19482 [2018-12-09 19:45:48,635 INFO L226 Difference]: Without dead ends: 19482 [2018-12-09 19:45:48,636 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:45:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19482 states. [2018-12-09 19:45:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19482 to 18409. [2018-12-09 19:45:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18409 states. [2018-12-09 19:45:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18409 states to 18409 states and 42940 transitions. [2018-12-09 19:45:48,784 INFO L78 Accepts]: Start accepts. Automaton has 18409 states and 42940 transitions. Word has length 127 [2018-12-09 19:45:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:45:48,784 INFO L480 AbstractCegarLoop]: Abstraction has 18409 states and 42940 transitions. [2018-12-09 19:45:48,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:45:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 18409 states and 42940 transitions. [2018-12-09 19:45:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:45:48,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:45:48,798 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:45:48,798 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:45:48,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:45:48,798 INFO L82 PathProgramCache]: Analyzing trace with hash 198779015, now seen corresponding path program 4 times [2018-12-09 19:45:48,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:45:48,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:48,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:45:48,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:45:48,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:45:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:45:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:45:48,843 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:45:48,929 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 19:45:48,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:45:48 BasicIcfg [2018-12-09 19:45:48,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:45:48,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:45:48,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:45:48,930 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:45:48,931 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:44:16" (3/4) ... [2018-12-09 19:45:48,932 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:45:49,018 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0b1f8563-19fe-4710-a797-8212bfb27527/bin-2019/utaipan/witness.graphml [2018-12-09 19:45:49,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:45:49,019 INFO L168 Benchmark]: Toolchain (without parser) took 93086.76 ms. Allocated memory was 1.0 GB in the beginning and 7.0 GB in the end (delta: 5.9 GB). Free memory was 947.0 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-09 19:45:49,020 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:45:49,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:45:49,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.22 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:45:49,020 INFO L168 Benchmark]: Boogie Preprocessor took 25.13 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:45:49,020 INFO L168 Benchmark]: RCFGBuilder took 430.08 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: 77.7 MB). Peak memory consumption was 77.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:45:49,021 INFO L168 Benchmark]: TraceAbstraction took 92156.33 ms. Allocated memory was 1.2 GB in the beginning and 7.0 GB in the end (delta: 5.8 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-12-09 19:45:49,021 INFO L168 Benchmark]: Witness Printer took 88.18 ms. Allocated memory is still 7.0 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:45:49,022 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.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.22 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.13 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 430.08 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: 77.7 MB). Peak memory consumption was 77.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 92156.33 ms. Allocated memory was 1.2 GB in the beginning and 7.0 GB in the end (delta: 5.8 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 88.18 ms. Allocated memory is still 7.0 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 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 t1587; 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(&t1587, ((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 t1588; 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(&t1588, ((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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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.0s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 32.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22354 SDtfs, 22092 SDslu, 67099 SDs, 0 SdLazy, 26027 SolverSat, 996 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 538 GetRequests, 124 SyntacticMatches, 29 SemanticMatches, 385 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 2.4s 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: 42.5s AutomataMinimizationTime, 38 MinimizatonAttempts, 565573 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3593 NumberOfCodeBlocks, 3593 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3428 ConstructedInterpolants, 0 QuantifiedInterpolants, 800152 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...