./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_pso.opt_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_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/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 2c8bd5173f7a5071741d35a00d4948a15adec514 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-02 12:59:01,034 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:59:01,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:59:01,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:59:01,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:59:01,041 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:59:01,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:59:01,043 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:59:01,044 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:59:01,044 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:59:01,045 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:59:01,045 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:59:01,045 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:59:01,046 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:59:01,047 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:59:01,047 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:59:01,048 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:59:01,048 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:59:01,049 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:59:01,050 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:59:01,051 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:59:01,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:59:01,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:59:01,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:59:01,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:59:01,053 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:59:01,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:59:01,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:59:01,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:59:01,055 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:59:01,055 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:59:01,056 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:59:01,056 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:59:01,056 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:59:01,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:59:01,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:59:01,057 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 12:59:01,064 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:59:01,064 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:59:01,065 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:59:01,065 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:59:01,065 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:59:01,065 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:59:01,065 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:59:01,065 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 12:59:01,066 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:59:01,066 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:59:01,066 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 12:59:01,066 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 12:59:01,066 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:59:01,066 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:59:01,067 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:59:01,067 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:59:01,067 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:59:01,067 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:59:01,067 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 12:59:01,067 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:59:01,067 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 12:59:01,067 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:59:01,068 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:59:01,068 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 12:59:01,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:59:01,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:59:01,068 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:59:01,068 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:59:01,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:59:01,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:59:01,069 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:59:01,069 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 12:59:01,069 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 12:59:01,069 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:59:01,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:59:01,069 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 12:59:01,069 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_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/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 -> 2c8bd5173f7a5071741d35a00d4948a15adec514 [2018-12-02 12:59:01,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:59:01,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:59:01,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:59:01,096 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:59:01,096 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:59:01,096 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix011_pso.opt_false-unreach-call.i [2018-12-02 12:59:01,135 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/bin-2019/utaipan/data/c2aad4a2b/ec1806090b364bb9b45cea0de982b6d8/FLAG22d5be807 [2018-12-02 12:59:01,575 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:59:01,576 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/sv-benchmarks/c/pthread-wmm/mix011_pso.opt_false-unreach-call.i [2018-12-02 12:59:01,583 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/bin-2019/utaipan/data/c2aad4a2b/ec1806090b364bb9b45cea0de982b6d8/FLAG22d5be807 [2018-12-02 12:59:01,591 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/bin-2019/utaipan/data/c2aad4a2b/ec1806090b364bb9b45cea0de982b6d8 [2018-12-02 12:59:01,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:59:01,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:59:01,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:59:01,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:59:01,597 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:59:01,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:59:01" (1/1) ... [2018-12-02 12:59:01,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4599fb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01, skipping insertion in model container [2018-12-02 12:59:01,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:59:01" (1/1) ... [2018-12-02 12:59:01,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:59:01,624 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:59:01,808 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:59:01,816 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:59:01,892 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:59:01,922 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:59:01,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01 WrapperNode [2018-12-02 12:59:01,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:59:01,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:59:01,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:59:01,923 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:59:01,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01" (1/1) ... [2018-12-02 12:59:01,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01" (1/1) ... [2018-12-02 12:59:01,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:59:01,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:59:01,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:59:01,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:59:01,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01" (1/1) ... [2018-12-02 12:59:01,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01" (1/1) ... [2018-12-02 12:59:01,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01" (1/1) ... [2018-12-02 12:59:01,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01" (1/1) ... [2018-12-02 12:59:01,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01" (1/1) ... [2018-12-02 12:59:01,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01" (1/1) ... [2018-12-02 12:59:01,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01" (1/1) ... [2018-12-02 12:59:01,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:59:01,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:59:01,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:59:01,981 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:59:01,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/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-02 12:59:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:59:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 12:59:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 12:59:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:59:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 12:59:02,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 12:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 12:59:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 12:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 12:59:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 12:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 12:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:59:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:59:02,025 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 12:59:02,372 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:59:02,372 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 12:59:02,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:59:02 BoogieIcfgContainer [2018-12-02 12:59:02,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:59:02,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:59:02,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:59:02,374 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:59:02,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:59:01" (1/3) ... [2018-12-02 12:59:02,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238bcc51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:59:02, skipping insertion in model container [2018-12-02 12:59:02,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:01" (2/3) ... [2018-12-02 12:59:02,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238bcc51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:59:02, skipping insertion in model container [2018-12-02 12:59:02,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:59:02" (3/3) ... [2018-12-02 12:59:02,376 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_pso.opt_false-unreach-call.i [2018-12-02 12:59:02,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,402 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,402 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,404 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,404 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,404 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,404 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,404 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,405 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,405 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,405 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,405 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,405 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,405 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,405 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,405 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,410 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,410 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,410 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,410 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,410 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,410 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,410 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,410 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,410 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,419 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,419 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,419 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:59:02,439 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 12:59:02,439 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:59:02,445 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 12:59:02,454 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 12:59:02,470 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:59:02,471 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 12:59:02,471 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:59:02,471 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:59:02,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:59:02,471 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:59:02,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:59:02,471 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:59:02,479 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 189places, 241 transitions [2018-12-02 13:01:36,638 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 445146 states. [2018-12-02 13:01:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 445146 states. [2018-12-02 13:01:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 13:01:36,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:01:36,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:01:36,650 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:01:36,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:01:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1446185373, now seen corresponding path program 1 times [2018-12-02 13:01:36,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:01:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:01:36,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:01:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:01:36,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:01:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:01:36,813 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-02 13:01:36,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:01:36,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:01:36,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:01:36,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:01:36,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:01:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:01:36,827 INFO L87 Difference]: Start difference. First operand 445146 states. Second operand 4 states. [2018-12-02 13:01:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:01:43,682 INFO L93 Difference]: Finished difference Result 810626 states and 3886643 transitions. [2018-12-02 13:01:43,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:01:43,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-02 13:01:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:01:45,469 INFO L225 Difference]: With dead ends: 810626 [2018-12-02 13:01:45,469 INFO L226 Difference]: Without dead ends: 530976 [2018-12-02 13:01:45,470 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-02 13:01:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530976 states. [2018-12-02 13:02:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530976 to 307956. [2018-12-02 13:02:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307956 states. [2018-12-02 13:02:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307956 states to 307956 states and 1493657 transitions. [2018-12-02 13:02:06,727 INFO L78 Accepts]: Start accepts. Automaton has 307956 states and 1493657 transitions. Word has length 47 [2018-12-02 13:02:06,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:06,728 INFO L480 AbstractCegarLoop]: Abstraction has 307956 states and 1493657 transitions. [2018-12-02 13:02:06,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:02:06,728 INFO L276 IsEmpty]: Start isEmpty. Operand 307956 states and 1493657 transitions. [2018-12-02 13:02:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 13:02:06,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:06,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:02:06,738 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:06,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1064613016, now seen corresponding path program 1 times [2018-12-02 13:02:06,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:06,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:06,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:02:06,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:06,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:06,785 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-02 13:02:06,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:06,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:02:06,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:06,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:02:06,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:02:06,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:02:06,787 INFO L87 Difference]: Start difference. First operand 307956 states and 1493657 transitions. Second operand 3 states. [2018-12-02 13:02:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:12,188 INFO L93 Difference]: Finished difference Result 307956 states and 1492632 transitions. [2018-12-02 13:02:12,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:02:12,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-02 13:02:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:13,148 INFO L225 Difference]: With dead ends: 307956 [2018-12-02 13:02:13,149 INFO L226 Difference]: Without dead ends: 307956 [2018-12-02 13:02:13,149 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-02 13:02:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307956 states. [2018-12-02 13:02:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307956 to 307956. [2018-12-02 13:02:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307956 states. [2018-12-02 13:02:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307956 states to 307956 states and 1492632 transitions. [2018-12-02 13:02:23,913 INFO L78 Accepts]: Start accepts. Automaton has 307956 states and 1492632 transitions. Word has length 55 [2018-12-02 13:02:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:23,913 INFO L480 AbstractCegarLoop]: Abstraction has 307956 states and 1492632 transitions. [2018-12-02 13:02:23,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:02:23,913 INFO L276 IsEmpty]: Start isEmpty. Operand 307956 states and 1492632 transitions. [2018-12-02 13:02:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 13:02:23,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:23,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:02:23,920 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:23,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash 678197319, now seen corresponding path program 1 times [2018-12-02 13:02:23,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:23,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:02:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:23,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:23,963 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-02 13:02:23,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:23,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:02:23,963 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:23,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:02:23,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:02:23,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:02:23,964 INFO L87 Difference]: Start difference. First operand 307956 states and 1492632 transitions. Second operand 4 states. [2018-12-02 13:02:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:25,829 INFO L93 Difference]: Finished difference Result 272410 states and 1286587 transitions. [2018-12-02 13:02:25,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 13:02:25,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-02 13:02:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:26,596 INFO L225 Difference]: With dead ends: 272410 [2018-12-02 13:02:26,596 INFO L226 Difference]: Without dead ends: 258310 [2018-12-02 13:02:26,597 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-02 13:02:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258310 states. [2018-12-02 13:02:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258310 to 258310. [2018-12-02 13:02:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258310 states. [2018-12-02 13:02:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258310 states to 258310 states and 1232394 transitions. [2018-12-02 13:02:39,193 INFO L78 Accepts]: Start accepts. Automaton has 258310 states and 1232394 transitions. Word has length 55 [2018-12-02 13:02:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:39,194 INFO L480 AbstractCegarLoop]: Abstraction has 258310 states and 1232394 transitions. [2018-12-02 13:02:39,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:02:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 258310 states and 1232394 transitions. [2018-12-02 13:02:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 13:02:39,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:39,200 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] [2018-12-02 13:02:39,200 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:39,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:39,200 INFO L82 PathProgramCache]: Analyzing trace with hash -801855287, now seen corresponding path program 1 times [2018-12-02 13:02:39,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:39,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:39,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:02:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:39,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:39,250 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-02 13:02:39,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:39,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:02:39,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:39,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:02:39,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:02:39,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:02:39,251 INFO L87 Difference]: Start difference. First operand 258310 states and 1232394 transitions. Second operand 5 states. [2018-12-02 13:02:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:39,503 INFO L93 Difference]: Finished difference Result 61670 states and 252910 transitions. [2018-12-02 13:02:39,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:02:39,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-02 13:02:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:39,610 INFO L225 Difference]: With dead ends: 61670 [2018-12-02 13:02:39,610 INFO L226 Difference]: Without dead ends: 49978 [2018-12-02 13:02:39,610 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-02 13:02:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49978 states. [2018-12-02 13:02:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49978 to 49518. [2018-12-02 13:02:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49518 states. [2018-12-02 13:02:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49518 states to 49518 states and 199432 transitions. [2018-12-02 13:02:40,351 INFO L78 Accepts]: Start accepts. Automaton has 49518 states and 199432 transitions. Word has length 56 [2018-12-02 13:02:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:40,351 INFO L480 AbstractCegarLoop]: Abstraction has 49518 states and 199432 transitions. [2018-12-02 13:02:40,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:02:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 49518 states and 199432 transitions. [2018-12-02 13:02:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 13:02:40,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:40,353 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] [2018-12-02 13:02:40,354 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:40,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash 866289402, now seen corresponding path program 1 times [2018-12-02 13:02:40,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:40,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:40,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:02:40,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:40,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:40,419 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-02 13:02:40,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:40,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:02:40,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:40,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:02:40,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:02:40,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:02:40,420 INFO L87 Difference]: Start difference. First operand 49518 states and 199432 transitions. Second operand 5 states. [2018-12-02 13:02:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:41,441 INFO L93 Difference]: Finished difference Result 100164 states and 398361 transitions. [2018-12-02 13:02:41,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:02:41,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-02 13:02:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:41,657 INFO L225 Difference]: With dead ends: 100164 [2018-12-02 13:02:41,657 INFO L226 Difference]: Without dead ends: 99789 [2018-12-02 13:02:41,657 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-02 13:02:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99789 states. [2018-12-02 13:02:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99789 to 66557. [2018-12-02 13:02:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66557 states. [2018-12-02 13:02:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66557 states to 66557 states and 261440 transitions. [2018-12-02 13:02:42,851 INFO L78 Accepts]: Start accepts. Automaton has 66557 states and 261440 transitions. Word has length 56 [2018-12-02 13:02:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:42,851 INFO L480 AbstractCegarLoop]: Abstraction has 66557 states and 261440 transitions. [2018-12-02 13:02:42,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:02:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 66557 states and 261440 transitions. [2018-12-02 13:02:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 13:02:42,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:42,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:02:42,855 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:42,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1282795552, now seen corresponding path program 1 times [2018-12-02 13:02:42,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:42,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:42,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:02:42,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:42,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:02:42,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:42,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:02:42,877 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:42,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:02:42,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:02:42,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:02:42,878 INFO L87 Difference]: Start difference. First operand 66557 states and 261440 transitions. Second operand 3 states. [2018-12-02 13:02:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:43,517 INFO L93 Difference]: Finished difference Result 122933 states and 477435 transitions. [2018-12-02 13:02:43,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:02:43,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-02 13:02:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:43,790 INFO L225 Difference]: With dead ends: 122933 [2018-12-02 13:02:43,791 INFO L226 Difference]: Without dead ends: 122913 [2018-12-02 13:02:43,791 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-02 13:02:44,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122913 states. [2018-12-02 13:02:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122913 to 103768. [2018-12-02 13:02:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103768 states. [2018-12-02 13:02:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103768 states to 103768 states and 403302 transitions. [2018-12-02 13:02:45,791 INFO L78 Accepts]: Start accepts. Automaton has 103768 states and 403302 transitions. Word has length 58 [2018-12-02 13:02:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:45,792 INFO L480 AbstractCegarLoop]: Abstraction has 103768 states and 403302 transitions. [2018-12-02 13:02:45,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:02:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 103768 states and 403302 transitions. [2018-12-02 13:02:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 13:02:45,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:45,799 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-02 13:02:45,799 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:45,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:45,799 INFO L82 PathProgramCache]: Analyzing trace with hash 263556651, now seen corresponding path program 1 times [2018-12-02 13:02:45,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:45,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:45,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:02:45,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:45,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:45,892 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-02 13:02:45,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:45,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 13:02:45,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:45,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 13:02:45,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 13:02:45,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:02:45,893 INFO L87 Difference]: Start difference. First operand 103768 states and 403302 transitions. Second operand 8 states. [2018-12-02 13:02:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:46,971 INFO L93 Difference]: Finished difference Result 140478 states and 532645 transitions. [2018-12-02 13:02:46,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 13:02:46,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-12-02 13:02:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:47,269 INFO L225 Difference]: With dead ends: 140478 [2018-12-02 13:02:47,269 INFO L226 Difference]: Without dead ends: 140013 [2018-12-02 13:02:47,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-12-02 13:02:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140013 states. [2018-12-02 13:02:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140013 to 105817. [2018-12-02 13:02:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105817 states. [2018-12-02 13:02:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105817 states to 105817 states and 410087 transitions. [2018-12-02 13:02:51,034 INFO L78 Accepts]: Start accepts. Automaton has 105817 states and 410087 transitions. Word has length 62 [2018-12-02 13:02:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:51,034 INFO L480 AbstractCegarLoop]: Abstraction has 105817 states and 410087 transitions. [2018-12-02 13:02:51,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 13:02:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 105817 states and 410087 transitions. [2018-12-02 13:02:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 13:02:51,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:51,062 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] [2018-12-02 13:02:51,062 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:51,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:51,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1798885662, now seen corresponding path program 1 times [2018-12-02 13:02:51,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:51,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:51,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:02:51,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:51,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:51,117 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-02 13:02:51,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:51,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:02:51,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:51,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:02:51,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:02:51,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:02:51,119 INFO L87 Difference]: Start difference. First operand 105817 states and 410087 transitions. Second operand 6 states. [2018-12-02 13:02:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:51,298 INFO L93 Difference]: Finished difference Result 40569 states and 137847 transitions. [2018-12-02 13:02:51,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:02:51,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-02 13:02:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:51,351 INFO L225 Difference]: With dead ends: 40569 [2018-12-02 13:02:51,351 INFO L226 Difference]: Without dead ends: 35641 [2018-12-02 13:02:51,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 13:02:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35641 states. [2018-12-02 13:02:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35641 to 34576. [2018-12-02 13:02:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34576 states. [2018-12-02 13:02:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34576 states to 34576 states and 116385 transitions. [2018-12-02 13:02:51,965 INFO L78 Accepts]: Start accepts. Automaton has 34576 states and 116385 transitions. Word has length 73 [2018-12-02 13:02:51,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:51,965 INFO L480 AbstractCegarLoop]: Abstraction has 34576 states and 116385 transitions. [2018-12-02 13:02:51,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:02:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 34576 states and 116385 transitions. [2018-12-02 13:02:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 13:02:52,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:52,006 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] [2018-12-02 13:02:52,006 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:52,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:52,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1783314676, now seen corresponding path program 1 times [2018-12-02 13:02:52,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:52,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:52,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:02:52,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:52,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:52,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-02 13:02:52,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:52,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:02:52,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:52,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:02:52,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:02:52,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:02:52,062 INFO L87 Difference]: Start difference. First operand 34576 states and 116385 transitions. Second operand 4 states. [2018-12-02 13:02:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:52,330 INFO L93 Difference]: Finished difference Result 39804 states and 132258 transitions. [2018-12-02 13:02:52,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:02:52,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-02 13:02:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:52,387 INFO L225 Difference]: With dead ends: 39804 [2018-12-02 13:02:52,387 INFO L226 Difference]: Without dead ends: 39804 [2018-12-02 13:02:52,387 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-02 13:02:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39804 states. [2018-12-02 13:02:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39804 to 37471. [2018-12-02 13:02:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37471 states. [2018-12-02 13:02:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37471 states to 37471 states and 125131 transitions. [2018-12-02 13:02:52,864 INFO L78 Accepts]: Start accepts. Automaton has 37471 states and 125131 transitions. Word has length 108 [2018-12-02 13:02:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:52,864 INFO L480 AbstractCegarLoop]: Abstraction has 37471 states and 125131 transitions. [2018-12-02 13:02:52,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:02:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 37471 states and 125131 transitions. [2018-12-02 13:02:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 13:02:52,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:52,904 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] [2018-12-02 13:02:52,905 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:52,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:52,905 INFO L82 PathProgramCache]: Analyzing trace with hash 434443277, now seen corresponding path program 1 times [2018-12-02 13:02:52,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:52,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:52,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:02:52,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:52,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:52,954 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-02 13:02:52,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:52,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:02:52,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:52,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:02:52,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:02:52,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:02:52,955 INFO L87 Difference]: Start difference. First operand 37471 states and 125131 transitions. Second operand 3 states. [2018-12-02 13:02:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:53,223 INFO L93 Difference]: Finished difference Result 51166 states and 169197 transitions. [2018-12-02 13:02:53,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:02:53,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-12-02 13:02:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:53,301 INFO L225 Difference]: With dead ends: 51166 [2018-12-02 13:02:53,301 INFO L226 Difference]: Without dead ends: 51166 [2018-12-02 13:02:53,301 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-02 13:02:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51166 states. [2018-12-02 13:02:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51166 to 46396. [2018-12-02 13:02:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46396 states. [2018-12-02 13:02:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46396 states to 46396 states and 154616 transitions. [2018-12-02 13:02:54,131 INFO L78 Accepts]: Start accepts. Automaton has 46396 states and 154616 transitions. Word has length 108 [2018-12-02 13:02:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:54,132 INFO L480 AbstractCegarLoop]: Abstraction has 46396 states and 154616 transitions. [2018-12-02 13:02:54,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:02:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 46396 states and 154616 transitions. [2018-12-02 13:02:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 13:02:54,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:54,180 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] [2018-12-02 13:02:54,180 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:54,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash -856881961, now seen corresponding path program 2 times [2018-12-02 13:02:54,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:54,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:54,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:02:54,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:54,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:54,254 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-02 13:02:54,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:54,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:02:54,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:54,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:02:54,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:02:54,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:02:54,256 INFO L87 Difference]: Start difference. First operand 46396 states and 154616 transitions. Second operand 5 states. [2018-12-02 13:02:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:54,643 INFO L93 Difference]: Finished difference Result 60078 states and 195971 transitions. [2018-12-02 13:02:54,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:02:54,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-12-02 13:02:54,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:54,728 INFO L225 Difference]: With dead ends: 60078 [2018-12-02 13:02:54,728 INFO L226 Difference]: Without dead ends: 60078 [2018-12-02 13:02:54,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:02:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60078 states. [2018-12-02 13:02:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60078 to 50831. [2018-12-02 13:02:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50831 states. [2018-12-02 13:02:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50831 states to 50831 states and 168114 transitions. [2018-12-02 13:02:55,446 INFO L78 Accepts]: Start accepts. Automaton has 50831 states and 168114 transitions. Word has length 108 [2018-12-02 13:02:55,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:55,446 INFO L480 AbstractCegarLoop]: Abstraction has 50831 states and 168114 transitions. [2018-12-02 13:02:55,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:02:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 50831 states and 168114 transitions. [2018-12-02 13:02:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 13:02:55,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:55,504 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] [2018-12-02 13:02:55,504 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:55,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:55,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1527840843, now seen corresponding path program 3 times [2018-12-02 13:02:55,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:55,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:55,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:02:55,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:55,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:55,559 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-02 13:02:55,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:55,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:02:55,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:55,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:02:55,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:02:55,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:02:55,561 INFO L87 Difference]: Start difference. First operand 50831 states and 168114 transitions. Second operand 4 states. [2018-12-02 13:02:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:55,794 INFO L93 Difference]: Finished difference Result 51663 states and 170882 transitions. [2018-12-02 13:02:55,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:02:55,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-02 13:02:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:55,866 INFO L225 Difference]: With dead ends: 51663 [2018-12-02 13:02:55,866 INFO L226 Difference]: Without dead ends: 51663 [2018-12-02 13:02:55,866 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-02 13:02:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51663 states. [2018-12-02 13:02:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51663 to 51087. [2018-12-02 13:02:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51087 states. [2018-12-02 13:02:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51087 states to 51087 states and 169010 transitions. [2018-12-02 13:02:56,561 INFO L78 Accepts]: Start accepts. Automaton has 51087 states and 169010 transitions. Word has length 108 [2018-12-02 13:02:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:56,561 INFO L480 AbstractCegarLoop]: Abstraction has 51087 states and 169010 transitions. [2018-12-02 13:02:56,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:02:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 51087 states and 169010 transitions. [2018-12-02 13:02:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 13:02:56,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:56,620 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] [2018-12-02 13:02:56,620 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:56,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:56,620 INFO L82 PathProgramCache]: Analyzing trace with hash -279613620, now seen corresponding path program 1 times [2018-12-02 13:02:56,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:56,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:56,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:02:56,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:56,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:02:56,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:56,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:02:56,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:56,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:02:56,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:02:56,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:02:56,698 INFO L87 Difference]: Start difference. First operand 51087 states and 169010 transitions. Second operand 6 states. [2018-12-02 13:02:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:56,877 INFO L93 Difference]: Finished difference Result 50895 states and 167938 transitions. [2018-12-02 13:02:56,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:02:56,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-12-02 13:02:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:56,951 INFO L225 Difference]: With dead ends: 50895 [2018-12-02 13:02:56,951 INFO L226 Difference]: Without dead ends: 50895 [2018-12-02 13:02:56,952 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-02 13:02:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50895 states. [2018-12-02 13:02:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50895 to 49362. [2018-12-02 13:02:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49362 states. [2018-12-02 13:02:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49362 states to 49362 states and 163380 transitions. [2018-12-02 13:02:57,603 INFO L78 Accepts]: Start accepts. Automaton has 49362 states and 163380 transitions. Word has length 108 [2018-12-02 13:02:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:02:57,604 INFO L480 AbstractCegarLoop]: Abstraction has 49362 states and 163380 transitions. [2018-12-02 13:02:57,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:02:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 49362 states and 163380 transitions. [2018-12-02 13:02:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 13:02:57,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:02:57,654 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] [2018-12-02 13:02:57,655 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:02:57,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:02:57,655 INFO L82 PathProgramCache]: Analyzing trace with hash -65923686, now seen corresponding path program 1 times [2018-12-02 13:02:57,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:02:57,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:57,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:02:57,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:02:57,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:02:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:02:57,726 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-02 13:02:57,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:02:57,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 13:02:57,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:02:57,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 13:02:57,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 13:02:57,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:02:57,727 INFO L87 Difference]: Start difference. First operand 49362 states and 163380 transitions. Second operand 8 states. [2018-12-02 13:02:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:02:58,970 INFO L93 Difference]: Finished difference Result 96500 states and 314072 transitions. [2018-12-02 13:02:58,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 13:02:58,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2018-12-02 13:02:58,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:02:59,117 INFO L225 Difference]: With dead ends: 96500 [2018-12-02 13:02:59,117 INFO L226 Difference]: Without dead ends: 96045 [2018-12-02 13:02:59,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-12-02 13:02:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96045 states. [2018-12-02 13:03:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96045 to 71737. [2018-12-02 13:03:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71737 states. [2018-12-02 13:03:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71737 states to 71737 states and 237370 transitions. [2018-12-02 13:03:00,233 INFO L78 Accepts]: Start accepts. Automaton has 71737 states and 237370 transitions. Word has length 110 [2018-12-02 13:03:00,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:03:00,233 INFO L480 AbstractCegarLoop]: Abstraction has 71737 states and 237370 transitions. [2018-12-02 13:03:00,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 13:03:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 71737 states and 237370 transitions. [2018-12-02 13:03:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 13:03:00,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:03:00,320 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] [2018-12-02 13:03:00,320 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:03:00,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:03:00,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2143133029, now seen corresponding path program 1 times [2018-12-02 13:03:00,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:03:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:00,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:03:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:00,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:03:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:03:00,400 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-02 13:03:00,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:03:00,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:03:00,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:03:00,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:03:00,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:03:00,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:03:00,400 INFO L87 Difference]: Start difference. First operand 71737 states and 237370 transitions. Second operand 7 states. [2018-12-02 13:03:01,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:03:01,204 INFO L93 Difference]: Finished difference Result 112397 states and 360818 transitions. [2018-12-02 13:03:01,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 13:03:01,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-12-02 13:03:01,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:03:01,379 INFO L225 Difference]: With dead ends: 112397 [2018-12-02 13:03:01,380 INFO L226 Difference]: Without dead ends: 112397 [2018-12-02 13:03:01,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-02 13:03:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112397 states. [2018-12-02 13:03:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112397 to 92207. [2018-12-02 13:03:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92207 states. [2018-12-02 13:03:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92207 states to 92207 states and 300141 transitions. [2018-12-02 13:03:02,796 INFO L78 Accepts]: Start accepts. Automaton has 92207 states and 300141 transitions. Word has length 110 [2018-12-02 13:03:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:03:02,796 INFO L480 AbstractCegarLoop]: Abstraction has 92207 states and 300141 transitions. [2018-12-02 13:03:02,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:03:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 92207 states and 300141 transitions. [2018-12-02 13:03:03,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 13:03:03,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:03:03,099 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] [2018-12-02 13:03:03,100 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:03:03,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:03:03,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1931782116, now seen corresponding path program 1 times [2018-12-02 13:03:03,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:03:03,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:03,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:03:03,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:03,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:03:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:03:03,184 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-02 13:03:03,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:03:03,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:03:03,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:03:03,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:03:03,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:03:03,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:03:03,185 INFO L87 Difference]: Start difference. First operand 92207 states and 300141 transitions. Second operand 7 states. [2018-12-02 13:03:03,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:03:03,675 INFO L93 Difference]: Finished difference Result 95869 states and 311098 transitions. [2018-12-02 13:03:03,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 13:03:03,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-12-02 13:03:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:03:03,822 INFO L225 Difference]: With dead ends: 95869 [2018-12-02 13:03:03,822 INFO L226 Difference]: Without dead ends: 95869 [2018-12-02 13:03:03,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-02 13:03:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95869 states. [2018-12-02 13:03:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95869 to 95060. [2018-12-02 13:03:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95060 states. [2018-12-02 13:03:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95060 states to 95060 states and 308849 transitions. [2018-12-02 13:03:05,120 INFO L78 Accepts]: Start accepts. Automaton has 95060 states and 308849 transitions. Word has length 110 [2018-12-02 13:03:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:03:05,120 INFO L480 AbstractCegarLoop]: Abstraction has 95060 states and 308849 transitions. [2018-12-02 13:03:05,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:03:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 95060 states and 308849 transitions. [2018-12-02 13:03:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 13:03:05,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:03:05,422 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] [2018-12-02 13:03:05,422 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:03:05,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:03:05,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1044278435, now seen corresponding path program 1 times [2018-12-02 13:03:05,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:03:05,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:05,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:03:05,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:05,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:03:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:03:05,475 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-02 13:03:05,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:03:05,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:03:05,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:03:05,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:03:05,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:03:05,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:03:05,476 INFO L87 Difference]: Start difference. First operand 95060 states and 308849 transitions. Second operand 4 states. [2018-12-02 13:03:05,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:03:05,892 INFO L93 Difference]: Finished difference Result 96320 states and 312572 transitions. [2018-12-02 13:03:05,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:03:05,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-02 13:03:05,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:03:06,049 INFO L225 Difference]: With dead ends: 96320 [2018-12-02 13:03:06,049 INFO L226 Difference]: Without dead ends: 96320 [2018-12-02 13:03:06,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:03:06,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96320 states. [2018-12-02 13:03:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96320 to 91655. [2018-12-02 13:03:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91655 states. [2018-12-02 13:03:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91655 states to 91655 states and 297900 transitions. [2018-12-02 13:03:07,251 INFO L78 Accepts]: Start accepts. Automaton has 91655 states and 297900 transitions. Word has length 110 [2018-12-02 13:03:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:03:07,251 INFO L480 AbstractCegarLoop]: Abstraction has 91655 states and 297900 transitions. [2018-12-02 13:03:07,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:03:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 91655 states and 297900 transitions. [2018-12-02 13:03:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 13:03:07,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:03:07,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:03:07,550 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:03:07,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:03:07,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1542570689, now seen corresponding path program 2 times [2018-12-02 13:03:07,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:03:07,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:07,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:03:07,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:07,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:03:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:03:07,597 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-02 13:03:07,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:03:07,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:03:07,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:03:07,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:03:07,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:03:07,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:03:07,598 INFO L87 Difference]: Start difference. First operand 91655 states and 297900 transitions. Second operand 5 states. [2018-12-02 13:03:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:03:08,105 INFO L93 Difference]: Finished difference Result 100873 states and 325271 transitions. [2018-12-02 13:03:08,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:03:08,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-12-02 13:03:08,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:03:08,267 INFO L225 Difference]: With dead ends: 100873 [2018-12-02 13:03:08,267 INFO L226 Difference]: Without dead ends: 100873 [2018-12-02 13:03:08,268 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-02 13:03:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100873 states. [2018-12-02 13:03:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100873 to 94670. [2018-12-02 13:03:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94670 states. [2018-12-02 13:03:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94670 states to 94670 states and 306972 transitions. [2018-12-02 13:03:09,552 INFO L78 Accepts]: Start accepts. Automaton has 94670 states and 306972 transitions. Word has length 110 [2018-12-02 13:03:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:03:09,552 INFO L480 AbstractCegarLoop]: Abstraction has 94670 states and 306972 transitions. [2018-12-02 13:03:09,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:03:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 94670 states and 306972 transitions. [2018-12-02 13:03:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 13:03:09,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:03:09,835 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] [2018-12-02 13:03:09,835 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:03:09,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:03:09,836 INFO L82 PathProgramCache]: Analyzing trace with hash 958475187, now seen corresponding path program 3 times [2018-12-02 13:03:09,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:03:09,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:09,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:03:09,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:09,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:03:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:03:09,920 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-02 13:03:09,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:03:09,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:03:09,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:03:09,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:03:09,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:03:09,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:03:09,920 INFO L87 Difference]: Start difference. First operand 94670 states and 306972 transitions. Second operand 6 states. [2018-12-02 13:03:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:03:10,596 INFO L93 Difference]: Finished difference Result 114648 states and 371631 transitions. [2018-12-02 13:03:10,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:03:10,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-12-02 13:03:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:03:10,783 INFO L225 Difference]: With dead ends: 114648 [2018-12-02 13:03:10,783 INFO L226 Difference]: Without dead ends: 114648 [2018-12-02 13:03:10,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 13:03:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114648 states. [2018-12-02 13:03:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114648 to 94845. [2018-12-02 13:03:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94845 states. [2018-12-02 13:03:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94845 states to 94845 states and 307487 transitions. [2018-12-02 13:03:12,389 INFO L78 Accepts]: Start accepts. Automaton has 94845 states and 307487 transitions. Word has length 110 [2018-12-02 13:03:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:03:12,390 INFO L480 AbstractCegarLoop]: Abstraction has 94845 states and 307487 transitions. [2018-12-02 13:03:12,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:03:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 94845 states and 307487 transitions. [2018-12-02 13:03:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 13:03:12,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:03:12,504 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] [2018-12-02 13:03:12,504 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:03:12,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:03:12,505 INFO L82 PathProgramCache]: Analyzing trace with hash -187687262, now seen corresponding path program 1 times [2018-12-02 13:03:12,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:03:12,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:12,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:03:12,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:12,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:03:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:03:12,614 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-02 13:03:12,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:03:12,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 13:03:12,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:03:12,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 13:03:12,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 13:03:12,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 13:03:12,615 INFO L87 Difference]: Start difference. First operand 94845 states and 307487 transitions. Second operand 10 states. [2018-12-02 13:03:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:03:13,515 INFO L93 Difference]: Finished difference Result 135481 states and 436912 transitions. [2018-12-02 13:03:13,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:03:13,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2018-12-02 13:03:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:03:13,582 INFO L225 Difference]: With dead ends: 135481 [2018-12-02 13:03:13,582 INFO L226 Difference]: Without dead ends: 49025 [2018-12-02 13:03:13,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-02 13:03:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49025 states. [2018-12-02 13:03:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49025 to 49025. [2018-12-02 13:03:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49025 states. [2018-12-02 13:03:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49025 states to 49025 states and 149863 transitions. [2018-12-02 13:03:14,119 INFO L78 Accepts]: Start accepts. Automaton has 49025 states and 149863 transitions. Word has length 112 [2018-12-02 13:03:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:03:14,119 INFO L480 AbstractCegarLoop]: Abstraction has 49025 states and 149863 transitions. [2018-12-02 13:03:14,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 13:03:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 49025 states and 149863 transitions. [2018-12-02 13:03:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 13:03:14,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:03:14,167 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] [2018-12-02 13:03:14,167 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:03:14,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:03:14,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1874011366, now seen corresponding path program 2 times [2018-12-02 13:03:14,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:03:14,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:14,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:03:14,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:14,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:03:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:03:14,238 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-02 13:03:14,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:03:14,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:03:14,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:03:14,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:03:14,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:03:14,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:03:14,239 INFO L87 Difference]: Start difference. First operand 49025 states and 149863 transitions. Second operand 7 states. [2018-12-02 13:03:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:03:14,643 INFO L93 Difference]: Finished difference Result 66303 states and 205375 transitions. [2018-12-02 13:03:14,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:03:14,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-02 13:03:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:03:14,664 INFO L225 Difference]: With dead ends: 66303 [2018-12-02 13:03:14,664 INFO L226 Difference]: Without dead ends: 17031 [2018-12-02 13:03:14,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 13:03:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17031 states. [2018-12-02 13:03:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17031 to 17029. [2018-12-02 13:03:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17029 states. [2018-12-02 13:03:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17029 states to 17029 states and 55039 transitions. [2018-12-02 13:03:14,926 INFO L78 Accepts]: Start accepts. Automaton has 17029 states and 55039 transitions. Word has length 112 [2018-12-02 13:03:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:03:14,926 INFO L480 AbstractCegarLoop]: Abstraction has 17029 states and 55039 transitions. [2018-12-02 13:03:14,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:03:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 17029 states and 55039 transitions. [2018-12-02 13:03:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 13:03:14,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:03:14,942 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] [2018-12-02 13:03:14,943 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:03:14,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:03:14,943 INFO L82 PathProgramCache]: Analyzing trace with hash 816097090, now seen corresponding path program 1 times [2018-12-02 13:03:14,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:03:14,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:14,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:03:14,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:14,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:03:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:03:15,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-02 13:03:15,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:03:15,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 13:03:15,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:03:15,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 13:03:15,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 13:03:15,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-02 13:03:15,027 INFO L87 Difference]: Start difference. First operand 17029 states and 55039 transitions. Second operand 11 states. [2018-12-02 13:03:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:03:15,407 INFO L93 Difference]: Finished difference Result 23024 states and 73119 transitions. [2018-12-02 13:03:15,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 13:03:15,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-12-02 13:03:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:03:15,433 INFO L225 Difference]: With dead ends: 23024 [2018-12-02 13:03:15,433 INFO L226 Difference]: Without dead ends: 23024 [2018-12-02 13:03:15,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-02 13:03:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23024 states. [2018-12-02 13:03:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23024 to 16907. [2018-12-02 13:03:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16907 states. [2018-12-02 13:03:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16907 states to 16907 states and 54681 transitions. [2018-12-02 13:03:15,645 INFO L78 Accepts]: Start accepts. Automaton has 16907 states and 54681 transitions. Word has length 112 [2018-12-02 13:03:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:03:15,645 INFO L480 AbstractCegarLoop]: Abstraction has 16907 states and 54681 transitions. [2018-12-02 13:03:15,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 13:03:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 54681 transitions. [2018-12-02 13:03:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 13:03:15,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:03:15,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:03:15,662 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:03:15,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:03:15,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1129786526, now seen corresponding path program 3 times [2018-12-02 13:03:15,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:03:15,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:15,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:03:15,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:15,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:03:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:03:15,771 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-02 13:03:15,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:03:15,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 13:03:15,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:03:15,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 13:03:15,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 13:03:15,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-02 13:03:15,772 INFO L87 Difference]: Start difference. First operand 16907 states and 54681 transitions. Second operand 13 states. [2018-12-02 13:03:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:03:16,276 INFO L93 Difference]: Finished difference Result 26916 states and 85550 transitions. [2018-12-02 13:03:16,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 13:03:16,276 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2018-12-02 13:03:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:03:16,300 INFO L225 Difference]: With dead ends: 26916 [2018-12-02 13:03:16,300 INFO L226 Difference]: Without dead ends: 20138 [2018-12-02 13:03:16,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-02 13:03:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20138 states. [2018-12-02 13:03:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20138 to 17254. [2018-12-02 13:03:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17254 states. [2018-12-02 13:03:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17254 states to 17254 states and 55530 transitions. [2018-12-02 13:03:16,498 INFO L78 Accepts]: Start accepts. Automaton has 17254 states and 55530 transitions. Word has length 112 [2018-12-02 13:03:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:03:16,498 INFO L480 AbstractCegarLoop]: Abstraction has 17254 states and 55530 transitions. [2018-12-02 13:03:16,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 13:03:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 17254 states and 55530 transitions. [2018-12-02 13:03:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 13:03:16,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:03:16,516 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] [2018-12-02 13:03:16,516 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:03:16,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:03:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1172321924, now seen corresponding path program 4 times [2018-12-02 13:03:16,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:03:16,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:16,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:03:16,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:03:16,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:03:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:03:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:03:16,572 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 13:03:16,684 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 13:03:16,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:03:16 BasicIcfg [2018-12-02 13:03:16,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 13:03:16,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 13:03:16,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 13:03:16,686 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 13:03:16,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:59:02" (3/4) ... [2018-12-02 13:03:16,688 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 13:03:16,798 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_77c3e1c1-bb4d-4156-bad0-d7e7f354a954/bin-2019/utaipan/witness.graphml [2018-12-02 13:03:16,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 13:03:16,799 INFO L168 Benchmark]: Toolchain (without parser) took 255205.52 ms. Allocated memory was 1.0 GB in the beginning and 7.8 GB in the end (delta: 6.8 GB). Free memory was 948.1 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-12-02 13:03:16,800 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:03:16,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-12-02 13:03:16,801 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.56 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-02 13:03:16,801 INFO L168 Benchmark]: Boogie Preprocessor took 22.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:03:16,801 INFO L168 Benchmark]: RCFGBuilder took 391.87 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: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2018-12-02 13:03:16,801 INFO L168 Benchmark]: TraceAbstraction took 254312.66 ms. Allocated memory was 1.2 GB in the beginning and 7.8 GB in the end (delta: 6.6 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-12-02 13:03:16,802 INFO L168 Benchmark]: Witness Printer took 112.73 ms. Allocated memory is still 7.8 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 11.5 GB. [2018-12-02 13:03:16,803 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.56 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 391.87 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: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 254312.66 ms. Allocated memory was 1.2 GB in the beginning and 7.8 GB in the end (delta: 6.6 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 112.73 ms. Allocated memory is still 7.8 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L690] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L691] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L692] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L693] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L694] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L695] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L696] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L697] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L698] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L699] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L700] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L701] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L702] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L703] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L704] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L705] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L706] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L707] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L708] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] -1 pthread_t t292; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] FCALL, FORK -1 pthread_create(&t292, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] -1 pthread_t t293; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK -1 pthread_create(&t293, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] -1 pthread_t t294; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK -1 pthread_create(&t294, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 0 z$w_buff1 = z$w_buff0 [L762] 0 z$w_buff0 = 1 [L763] 0 z$w_buff1_used = z$w_buff0_used [L764] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L767] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L768] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L769] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L770] 0 z$r_buff0_thd3 = (_Bool)1 [L773] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L774] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L775] 0 z$flush_delayed = weak$$choice2 [L776] 0 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 0 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 0 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 0 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L783] EXPR 0 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 0 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 0 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 0 z = z$flush_delayed ? z$mem_tmp : z [L786] 0 z$flush_delayed = (_Bool)0 [L789] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L712] 1 a = 1 [L715] 1 x = 1 [L720] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L727] 2 x = 2 [L730] 2 y = 1 [L733] 2 __unbuffered_p1_EAX = y [L736] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L737] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L738] 2 z$flush_delayed = weak$$choice2 [L739] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L793] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L794] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L740] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L741] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L742] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L743] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L744] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L795] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L796] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L799] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L746] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L747] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z = z$flush_delayed ? z$mem_tmp : z [L749] 2 z$flush_delayed = (_Bool)0 [L754] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L826] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L827] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L828] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L829] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L832] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 304 locations, 3 error locations. UNSAFE Result, 254.2s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 30.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8048 SDtfs, 10314 SDslu, 21733 SDs, 0 SdLazy, 7064 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 62 SyntacticMatches, 21 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445146occurred in iteration=0, 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: 65.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 414558 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2222 NumberOfCodeBlocks, 2222 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2087 ConstructedInterpolants, 0 QuantifiedInterpolants, 474749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...