./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/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 5673c8fc999c6c2aa4e3139a5db49468705e6072 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-6b5699a [2019-11-26 02:40:38,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:40:38,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:40:38,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:40:38,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:40:38,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:40:38,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:40:38,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:40:38,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:40:38,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:40:38,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:40:38,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:40:38,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:40:38,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:40:38,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:40:38,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:40:38,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:40:38,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:40:38,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:40:38,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:40:38,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:40:38,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:40:38,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:40:38,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:40:38,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:40:38,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:40:38,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:40:38,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:40:38,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:40:38,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:40:38,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:40:38,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:40:38,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:40:38,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:40:38,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:40:38,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:40:38,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:40:38,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:40:38,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:40:38,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:40:38,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:40:38,962 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:40:38,987 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:40:38,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:40:38,988 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:40:38,988 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:40:38,988 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:40:38,988 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:40:38,988 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:40:38,988 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:40:38,989 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:40:38,989 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:40:38,989 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:40:38,989 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:40:38,989 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:40:38,990 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:40:38,990 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:40:38,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:40:38,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:40:38,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:40:38,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:40:38,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:40:38,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:40:38,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:40:38,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:40:38,992 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:40:38,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:40:38,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:40:38,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:40:38,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:40:38,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:40:38,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:40:38,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:40:38,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:40:38,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:40:39,003 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:40:39,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:40:39,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:40:39,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:40:39,004 INFO L138 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/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/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 -> 5673c8fc999c6c2aa4e3139a5db49468705e6072 [2019-11-26 02:40:39,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:40:39,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:40:39,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:40:39,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:40:39,189 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:40:39,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i [2019-11-26 02:40:39,268 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/utaipan/data/88d6e7947/015b7f317cae43ff986099aa0f907a52/FLAG592668681 [2019-11-26 02:40:39,765 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:40:39,766 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i [2019-11-26 02:40:39,786 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/utaipan/data/88d6e7947/015b7f317cae43ff986099aa0f907a52/FLAG592668681 [2019-11-26 02:40:40,113 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/utaipan/data/88d6e7947/015b7f317cae43ff986099aa0f907a52 [2019-11-26 02:40:40,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:40:40,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:40:40,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:40:40,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:40:40,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:40:40,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:40:40" (1/1) ... [2019-11-26 02:40:40,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4b141d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40, skipping insertion in model container [2019-11-26 02:40:40,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:40:40" (1/1) ... [2019-11-26 02:40:40,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:40:40,178 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:40:40,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:40:40,722 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:40:40,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:40:40,863 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:40:40,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40 WrapperNode [2019-11-26 02:40:40,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:40:40,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:40:40,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:40:40,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:40:40,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40" (1/1) ... [2019-11-26 02:40:40,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40" (1/1) ... [2019-11-26 02:40:40,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:40:40,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:40:40,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:40:40,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:40:40,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40" (1/1) ... [2019-11-26 02:40:40,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40" (1/1) ... [2019-11-26 02:40:40,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40" (1/1) ... [2019-11-26 02:40:40,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40" (1/1) ... [2019-11-26 02:40:40,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40" (1/1) ... [2019-11-26 02:40:40,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40" (1/1) ... [2019-11-26 02:40:40,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40" (1/1) ... [2019-11-26 02:40:40,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:40:40,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:40:40,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:40:40,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:40:40,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/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 [2019-11-26 02:40:41,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:40:41,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-26 02:40:41,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:40:41,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:40:41,036 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-26 02:40:41,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-26 02:40:41,037 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-26 02:40:41,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-26 02:40:41,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-26 02:40:41,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:40:41,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:40:41,039 WARN L202 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-26 02:40:41,626 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:40:41,626 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-26 02:40:41,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:40:41 BoogieIcfgContainer [2019-11-26 02:40:41,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:40:41,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:40:41,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:40:41,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:40:41,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:40:40" (1/3) ... [2019-11-26 02:40:41,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d88aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:40:41, skipping insertion in model container [2019-11-26 02:40:41,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:40" (2/3) ... [2019-11-26 02:40:41,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d88aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:40:41, skipping insertion in model container [2019-11-26 02:40:41,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:40:41" (3/3) ... [2019-11-26 02:40:41,636 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.opt.i [2019-11-26 02:40:41,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,713 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,713 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,738 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,739 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,765 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,791 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,791 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,791 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,791 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,791 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,796 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,796 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,797 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,797 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,797 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,803 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,804 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,804 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,804 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,804 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:40:41,827 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-26 02:40:41,827 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:40:41,835 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-26 02:40:41,845 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-26 02:40:41,866 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:40:41,866 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:40:41,866 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:40:41,866 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:40:41,867 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:40:41,867 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:40:41,867 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:40:41,867 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:40:41,897 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 277 places, 353 transitions [2019-11-26 02:40:43,558 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25979 states. [2019-11-26 02:40:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 25979 states. [2019-11-26 02:40:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-26 02:40:43,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:43,569 INFO L410 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] [2019-11-26 02:40:43,569 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash -870107987, now seen corresponding path program 1 times [2019-11-26 02:40:43,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:43,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164225216] [2019-11-26 02:40:43,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:43,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164225216] [2019-11-26 02:40:43,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:43,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:43,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079177562] [2019-11-26 02:40:43,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:43,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:43,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:43,902 INFO L87 Difference]: Start difference. First operand 25979 states. Second operand 4 states. [2019-11-26 02:40:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:44,425 INFO L93 Difference]: Finished difference Result 26619 states and 102124 transitions. [2019-11-26 02:40:44,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:44,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-26 02:40:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:44,632 INFO L225 Difference]: With dead ends: 26619 [2019-11-26 02:40:44,632 INFO L226 Difference]: Without dead ends: 20363 [2019-11-26 02:40:44,634 INFO L630 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 [2019-11-26 02:40:45,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20363 states. [2019-11-26 02:40:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20363 to 20363. [2019-11-26 02:40:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20363 states. [2019-11-26 02:40:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20363 states to 20363 states and 78428 transitions. [2019-11-26 02:40:45,935 INFO L78 Accepts]: Start accepts. Automaton has 20363 states and 78428 transitions. Word has length 42 [2019-11-26 02:40:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:45,936 INFO L462 AbstractCegarLoop]: Abstraction has 20363 states and 78428 transitions. [2019-11-26 02:40:45,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 20363 states and 78428 transitions. [2019-11-26 02:40:45,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:40:45,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:45,943 INFO L410 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] [2019-11-26 02:40:45,944 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:45,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1372959301, now seen corresponding path program 1 times [2019-11-26 02:40:45,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:45,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719698283] [2019-11-26 02:40:45,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:46,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719698283] [2019-11-26 02:40:46,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:46,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:40:46,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566208152] [2019-11-26 02:40:46,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:40:46,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:46,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:40:46,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:40:46,066 INFO L87 Difference]: Start difference. First operand 20363 states and 78428 transitions. Second operand 5 states. [2019-11-26 02:40:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:46,921 INFO L93 Difference]: Finished difference Result 31841 states and 116045 transitions. [2019-11-26 02:40:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:40:46,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-26 02:40:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:47,014 INFO L225 Difference]: With dead ends: 31841 [2019-11-26 02:40:47,014 INFO L226 Difference]: Without dead ends: 31289 [2019-11-26 02:40:47,015 INFO L630 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 [2019-11-26 02:40:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31289 states. [2019-11-26 02:40:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31289 to 29708. [2019-11-26 02:40:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29708 states. [2019-11-26 02:40:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29708 states to 29708 states and 109522 transitions. [2019-11-26 02:40:47,956 INFO L78 Accepts]: Start accepts. Automaton has 29708 states and 109522 transitions. Word has length 50 [2019-11-26 02:40:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:47,957 INFO L462 AbstractCegarLoop]: Abstraction has 29708 states and 109522 transitions. [2019-11-26 02:40:47,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:40:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 29708 states and 109522 transitions. [2019-11-26 02:40:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:40:47,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:47,964 INFO L410 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] [2019-11-26 02:40:47,964 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:47,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:47,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1695795612, now seen corresponding path program 1 times [2019-11-26 02:40:47,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:47,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892220427] [2019-11-26 02:40:47,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:48,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892220427] [2019-11-26 02:40:48,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:48,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:40:48,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550311653] [2019-11-26 02:40:48,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:40:48,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:48,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:40:48,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:40:48,077 INFO L87 Difference]: Start difference. First operand 29708 states and 109522 transitions. Second operand 5 states. [2019-11-26 02:40:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:48,826 INFO L93 Difference]: Finished difference Result 38699 states and 139694 transitions. [2019-11-26 02:40:48,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:40:48,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-26 02:40:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:48,932 INFO L225 Difference]: With dead ends: 38699 [2019-11-26 02:40:48,933 INFO L226 Difference]: Without dead ends: 38251 [2019-11-26 02:40:48,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:40:49,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38251 states. [2019-11-26 02:40:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38251 to 32954. [2019-11-26 02:40:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32954 states. [2019-11-26 02:40:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32954 states to 32954 states and 120531 transitions. [2019-11-26 02:40:50,257 INFO L78 Accepts]: Start accepts. Automaton has 32954 states and 120531 transitions. Word has length 51 [2019-11-26 02:40:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:50,257 INFO L462 AbstractCegarLoop]: Abstraction has 32954 states and 120531 transitions. [2019-11-26 02:40:50,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:40:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 32954 states and 120531 transitions. [2019-11-26 02:40:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 02:40:50,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:50,266 INFO L410 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] [2019-11-26 02:40:50,267 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:50,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:50,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1134070006, now seen corresponding path program 1 times [2019-11-26 02:40:50,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:50,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425016892] [2019-11-26 02:40:50,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:50,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425016892] [2019-11-26 02:40:50,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:50,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:40:50,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654750848] [2019-11-26 02:40:50,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:40:50,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:50,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:40:50,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:40:50,319 INFO L87 Difference]: Start difference. First operand 32954 states and 120531 transitions. Second operand 3 states. [2019-11-26 02:40:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:50,529 INFO L93 Difference]: Finished difference Result 42415 states and 152022 transitions. [2019-11-26 02:40:50,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:40:50,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-26 02:40:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:50,641 INFO L225 Difference]: With dead ends: 42415 [2019-11-26 02:40:50,642 INFO L226 Difference]: Without dead ends: 42415 [2019-11-26 02:40:50,642 INFO L630 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 [2019-11-26 02:40:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42415 states. [2019-11-26 02:40:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42415 to 37668. [2019-11-26 02:40:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37668 states. [2019-11-26 02:40:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37668 states to 37668 states and 136335 transitions. [2019-11-26 02:40:51,486 INFO L78 Accepts]: Start accepts. Automaton has 37668 states and 136335 transitions. Word has length 53 [2019-11-26 02:40:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:51,486 INFO L462 AbstractCegarLoop]: Abstraction has 37668 states and 136335 transitions. [2019-11-26 02:40:51,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:40:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 37668 states and 136335 transitions. [2019-11-26 02:40:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 02:40:51,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:51,504 INFO L410 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] [2019-11-26 02:40:51,504 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash 125714386, now seen corresponding path program 1 times [2019-11-26 02:40:51,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:51,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629531584] [2019-11-26 02:40:51,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:51,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629531584] [2019-11-26 02:40:51,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:51,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:40:51,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298750798] [2019-11-26 02:40:51,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:40:51,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:51,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:40:51,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:40:51,620 INFO L87 Difference]: Start difference. First operand 37668 states and 136335 transitions. Second operand 6 states. [2019-11-26 02:40:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:52,884 INFO L93 Difference]: Finished difference Result 51814 states and 185563 transitions. [2019-11-26 02:40:52,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:40:52,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-26 02:40:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:53,002 INFO L225 Difference]: With dead ends: 51814 [2019-11-26 02:40:53,002 INFO L226 Difference]: Without dead ends: 51014 [2019-11-26 02:40:53,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:40:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51014 states. [2019-11-26 02:40:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51014 to 47936. [2019-11-26 02:40:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47936 states. [2019-11-26 02:40:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47936 states to 47936 states and 172264 transitions. [2019-11-26 02:40:54,005 INFO L78 Accepts]: Start accepts. Automaton has 47936 states and 172264 transitions. Word has length 57 [2019-11-26 02:40:54,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:54,005 INFO L462 AbstractCegarLoop]: Abstraction has 47936 states and 172264 transitions. [2019-11-26 02:40:54,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:40:54,005 INFO L276 IsEmpty]: Start isEmpty. Operand 47936 states and 172264 transitions. [2019-11-26 02:40:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 02:40:54,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:54,024 INFO L410 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] [2019-11-26 02:40:54,024 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:54,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:54,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1671236973, now seen corresponding path program 1 times [2019-11-26 02:40:54,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:54,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967799509] [2019-11-26 02:40:54,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:54,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:54,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967799509] [2019-11-26 02:40:54,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:54,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:40:54,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032989120] [2019-11-26 02:40:54,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:40:54,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:54,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:40:54,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:40:54,884 INFO L87 Difference]: Start difference. First operand 47936 states and 172264 transitions. Second operand 7 states. [2019-11-26 02:40:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:55,932 INFO L93 Difference]: Finished difference Result 68550 states and 236789 transitions. [2019-11-26 02:40:55,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:40:55,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-11-26 02:40:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:56,074 INFO L225 Difference]: With dead ends: 68550 [2019-11-26 02:40:56,074 INFO L226 Difference]: Without dead ends: 68550 [2019-11-26 02:40:56,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:40:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68550 states. [2019-11-26 02:40:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68550 to 56774. [2019-11-26 02:40:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56774 states. [2019-11-26 02:40:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56774 states to 56774 states and 199367 transitions. [2019-11-26 02:40:57,160 INFO L78 Accepts]: Start accepts. Automaton has 56774 states and 199367 transitions. Word has length 57 [2019-11-26 02:40:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:57,160 INFO L462 AbstractCegarLoop]: Abstraction has 56774 states and 199367 transitions. [2019-11-26 02:40:57,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:40:57,160 INFO L276 IsEmpty]: Start isEmpty. Operand 56774 states and 199367 transitions. [2019-11-26 02:40:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 02:40:57,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:57,174 INFO L410 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] [2019-11-26 02:40:57,174 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:57,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:57,174 INFO L82 PathProgramCache]: Analyzing trace with hash -783733292, now seen corresponding path program 1 times [2019-11-26 02:40:57,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:57,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373908884] [2019-11-26 02:40:57,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:57,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373908884] [2019-11-26 02:40:57,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:57,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:57,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223479301] [2019-11-26 02:40:57,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:57,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:57,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:57,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:57,264 INFO L87 Difference]: Start difference. First operand 56774 states and 199367 transitions. Second operand 4 states. [2019-11-26 02:40:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:57,327 INFO L93 Difference]: Finished difference Result 10469 states and 32215 transitions. [2019-11-26 02:40:57,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:40:57,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-26 02:40:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:57,339 INFO L225 Difference]: With dead ends: 10469 [2019-11-26 02:40:57,339 INFO L226 Difference]: Without dead ends: 9223 [2019-11-26 02:40:57,340 INFO L630 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 [2019-11-26 02:40:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2019-11-26 02:40:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 9175. [2019-11-26 02:40:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9175 states. [2019-11-26 02:40:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9175 states to 9175 states and 27926 transitions. [2019-11-26 02:40:57,985 INFO L78 Accepts]: Start accepts. Automaton has 9175 states and 27926 transitions. Word has length 57 [2019-11-26 02:40:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:57,985 INFO L462 AbstractCegarLoop]: Abstraction has 9175 states and 27926 transitions. [2019-11-26 02:40:57,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 9175 states and 27926 transitions. [2019-11-26 02:40:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 02:40:57,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:57,987 INFO L410 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] [2019-11-26 02:40:57,987 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:57,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:57,987 INFO L82 PathProgramCache]: Analyzing trace with hash -800467883, now seen corresponding path program 1 times [2019-11-26 02:40:57,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:57,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531959442] [2019-11-26 02:40:57,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:58,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531959442] [2019-11-26 02:40:58,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:58,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:40:58,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295091741] [2019-11-26 02:40:58,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:40:58,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:58,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:40:58,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:40:58,053 INFO L87 Difference]: Start difference. First operand 9175 states and 27926 transitions. Second operand 6 states. [2019-11-26 02:40:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:58,442 INFO L93 Difference]: Finished difference Result 11222 states and 33697 transitions. [2019-11-26 02:40:58,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:40:58,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-26 02:40:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:58,456 INFO L225 Difference]: With dead ends: 11222 [2019-11-26 02:40:58,456 INFO L226 Difference]: Without dead ends: 11135 [2019-11-26 02:40:58,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:40:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11135 states. [2019-11-26 02:40:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11135 to 9316. [2019-11-26 02:40:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2019-11-26 02:40:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 28348 transitions. [2019-11-26 02:40:58,596 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 28348 transitions. Word has length 57 [2019-11-26 02:40:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:58,596 INFO L462 AbstractCegarLoop]: Abstraction has 9316 states and 28348 transitions. [2019-11-26 02:40:58,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:40:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 28348 transitions. [2019-11-26 02:40:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:40:58,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:58,601 INFO L410 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] [2019-11-26 02:40:58,602 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:58,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:58,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1357400536, now seen corresponding path program 1 times [2019-11-26 02:40:58,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:58,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898811983] [2019-11-26 02:40:58,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:58,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898811983] [2019-11-26 02:40:58,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:58,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:58,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850534795] [2019-11-26 02:40:58,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:58,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:58,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:58,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:58,669 INFO L87 Difference]: Start difference. First operand 9316 states and 28348 transitions. Second operand 4 states. [2019-11-26 02:40:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:58,838 INFO L93 Difference]: Finished difference Result 10891 states and 33040 transitions. [2019-11-26 02:40:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:40:58,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-26 02:40:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:58,855 INFO L225 Difference]: With dead ends: 10891 [2019-11-26 02:40:58,855 INFO L226 Difference]: Without dead ends: 10891 [2019-11-26 02:40:58,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:40:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10891 states. [2019-11-26 02:40:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10891 to 9883. [2019-11-26 02:40:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9883 states. [2019-11-26 02:40:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 30019 transitions. [2019-11-26 02:40:58,984 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 30019 transitions. Word has length 67 [2019-11-26 02:40:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:58,984 INFO L462 AbstractCegarLoop]: Abstraction has 9883 states and 30019 transitions. [2019-11-26 02:40:58,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 30019 transitions. [2019-11-26 02:40:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:40:58,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:58,990 INFO L410 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] [2019-11-26 02:40:58,990 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:58,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:58,990 INFO L82 PathProgramCache]: Analyzing trace with hash 385409799, now seen corresponding path program 1 times [2019-11-26 02:40:58,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:58,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650340120] [2019-11-26 02:40:58,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:59,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650340120] [2019-11-26 02:40:59,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:59,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:40:59,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504884198] [2019-11-26 02:40:59,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:40:59,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:59,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:40:59,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:40:59,064 INFO L87 Difference]: Start difference. First operand 9883 states and 30019 transitions. Second operand 6 states. [2019-11-26 02:40:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:59,589 INFO L93 Difference]: Finished difference Result 12789 states and 38229 transitions. [2019-11-26 02:40:59,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 02:40:59,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-26 02:40:59,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:59,612 INFO L225 Difference]: With dead ends: 12789 [2019-11-26 02:40:59,612 INFO L226 Difference]: Without dead ends: 12741 [2019-11-26 02:40:59,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:40:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2019-11-26 02:40:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 10622. [2019-11-26 02:40:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10622 states. [2019-11-26 02:40:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 32072 transitions. [2019-11-26 02:40:59,805 INFO L78 Accepts]: Start accepts. Automaton has 10622 states and 32072 transitions. Word has length 67 [2019-11-26 02:40:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:59,805 INFO L462 AbstractCegarLoop]: Abstraction has 10622 states and 32072 transitions. [2019-11-26 02:40:59,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:40:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 10622 states and 32072 transitions. [2019-11-26 02:40:59,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-26 02:40:59,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:59,821 INFO L410 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] [2019-11-26 02:40:59,822 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:59,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:59,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2019249902, now seen corresponding path program 1 times [2019-11-26 02:40:59,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:59,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262742140] [2019-11-26 02:40:59,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:59,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262742140] [2019-11-26 02:40:59,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:59,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:59,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883898085] [2019-11-26 02:40:59,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:59,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:59,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:59,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:59,896 INFO L87 Difference]: Start difference. First operand 10622 states and 32072 transitions. Second operand 4 states. [2019-11-26 02:41:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:00,139 INFO L93 Difference]: Finished difference Result 13324 states and 39674 transitions. [2019-11-26 02:41:00,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:41:00,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-26 02:41:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:00,163 INFO L225 Difference]: With dead ends: 13324 [2019-11-26 02:41:00,163 INFO L226 Difference]: Without dead ends: 13324 [2019-11-26 02:41:00,163 INFO L630 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 [2019-11-26 02:41:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13324 states. [2019-11-26 02:41:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13324 to 12178. [2019-11-26 02:41:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12178 states. [2019-11-26 02:41:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12178 states to 12178 states and 36363 transitions. [2019-11-26 02:41:00,338 INFO L78 Accepts]: Start accepts. Automaton has 12178 states and 36363 transitions. Word has length 69 [2019-11-26 02:41:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:00,339 INFO L462 AbstractCegarLoop]: Abstraction has 12178 states and 36363 transitions. [2019-11-26 02:41:00,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:41:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 12178 states and 36363 transitions. [2019-11-26 02:41:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-26 02:41:00,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:00,350 INFO L410 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] [2019-11-26 02:41:00,350 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:00,350 INFO L82 PathProgramCache]: Analyzing trace with hash 198508051, now seen corresponding path program 1 times [2019-11-26 02:41:00,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:00,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897235861] [2019-11-26 02:41:00,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:00,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897235861] [2019-11-26 02:41:00,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:00,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:41:00,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500998021] [2019-11-26 02:41:00,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:41:00,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:00,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:41:00,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:41:00,396 INFO L87 Difference]: Start difference. First operand 12178 states and 36363 transitions. Second operand 3 states. [2019-11-26 02:41:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:00,593 INFO L93 Difference]: Finished difference Result 12704 states and 37768 transitions. [2019-11-26 02:41:00,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:41:00,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-26 02:41:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:00,611 INFO L225 Difference]: With dead ends: 12704 [2019-11-26 02:41:00,612 INFO L226 Difference]: Without dead ends: 12704 [2019-11-26 02:41:00,612 INFO L630 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 [2019-11-26 02:41:00,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2019-11-26 02:41:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 12466. [2019-11-26 02:41:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12466 states. [2019-11-26 02:41:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37127 transitions. [2019-11-26 02:41:00,773 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37127 transitions. Word has length 69 [2019-11-26 02:41:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:00,773 INFO L462 AbstractCegarLoop]: Abstraction has 12466 states and 37127 transitions. [2019-11-26 02:41:00,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:41:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37127 transitions. [2019-11-26 02:41:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:41:00,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:00,785 INFO L410 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] [2019-11-26 02:41:00,785 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:00,786 INFO L82 PathProgramCache]: Analyzing trace with hash -898304257, now seen corresponding path program 1 times [2019-11-26 02:41:00,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:00,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947143343] [2019-11-26 02:41:00,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:00,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947143343] [2019-11-26 02:41:00,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:00,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:41:00,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444683321] [2019-11-26 02:41:00,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:41:00,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:00,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:41:00,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:41:00,881 INFO L87 Difference]: Start difference. First operand 12466 states and 37127 transitions. Second operand 6 states. [2019-11-26 02:41:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:01,537 INFO L93 Difference]: Finished difference Result 13737 states and 40366 transitions. [2019-11-26 02:41:01,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:41:01,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-26 02:41:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:01,561 INFO L225 Difference]: With dead ends: 13737 [2019-11-26 02:41:01,562 INFO L226 Difference]: Without dead ends: 13737 [2019-11-26 02:41:01,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:41:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-11-26 02:41:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 13251. [2019-11-26 02:41:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-26 02:41:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 39082 transitions. [2019-11-26 02:41:01,786 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 39082 transitions. Word has length 71 [2019-11-26 02:41:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:01,786 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 39082 transitions. [2019-11-26 02:41:01,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:41:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 39082 transitions. [2019-11-26 02:41:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:41:01,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:01,803 INFO L410 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] [2019-11-26 02:41:01,803 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1319453696, now seen corresponding path program 1 times [2019-11-26 02:41:01,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:01,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221339752] [2019-11-26 02:41:01,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:01,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221339752] [2019-11-26 02:41:01,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:01,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:41:01,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643089456] [2019-11-26 02:41:01,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:41:01,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:01,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:41:01,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:41:01,926 INFO L87 Difference]: Start difference. First operand 13251 states and 39082 transitions. Second operand 6 states. [2019-11-26 02:41:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:02,363 INFO L93 Difference]: Finished difference Result 15574 states and 44592 transitions. [2019-11-26 02:41:02,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:41:02,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-26 02:41:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:02,383 INFO L225 Difference]: With dead ends: 15574 [2019-11-26 02:41:02,383 INFO L226 Difference]: Without dead ends: 15574 [2019-11-26 02:41:02,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:41:02,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15574 states. [2019-11-26 02:41:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15574 to 13825. [2019-11-26 02:41:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-11-26 02:41:02,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 39932 transitions. [2019-11-26 02:41:02,564 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 39932 transitions. Word has length 71 [2019-11-26 02:41:02,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:02,564 INFO L462 AbstractCegarLoop]: Abstraction has 13825 states and 39932 transitions. [2019-11-26 02:41:02,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:41:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 39932 transitions. [2019-11-26 02:41:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:41:02,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:02,577 INFO L410 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] [2019-11-26 02:41:02,577 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1530804609, now seen corresponding path program 1 times [2019-11-26 02:41:02,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:02,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783297536] [2019-11-26 02:41:02,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:02,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783297536] [2019-11-26 02:41:02,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:02,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:41:02,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895792865] [2019-11-26 02:41:02,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:41:02,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:02,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:41:02,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:41:02,647 INFO L87 Difference]: Start difference. First operand 13825 states and 39932 transitions. Second operand 5 states. [2019-11-26 02:41:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:02,970 INFO L93 Difference]: Finished difference Result 17386 states and 50011 transitions. [2019-11-26 02:41:02,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:41:02,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-26 02:41:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:02,993 INFO L225 Difference]: With dead ends: 17386 [2019-11-26 02:41:02,993 INFO L226 Difference]: Without dead ends: 17386 [2019-11-26 02:41:02,994 INFO L630 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 [2019-11-26 02:41:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-11-26 02:41:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 14863. [2019-11-26 02:41:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14863 states. [2019-11-26 02:41:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14863 states to 14863 states and 42564 transitions. [2019-11-26 02:41:03,174 INFO L78 Accepts]: Start accepts. Automaton has 14863 states and 42564 transitions. Word has length 71 [2019-11-26 02:41:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:03,174 INFO L462 AbstractCegarLoop]: Abstraction has 14863 states and 42564 transitions. [2019-11-26 02:41:03,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:41:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 14863 states and 42564 transitions. [2019-11-26 02:41:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:41:03,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:03,182 INFO L410 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] [2019-11-26 02:41:03,182 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1020270432, now seen corresponding path program 1 times [2019-11-26 02:41:03,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:03,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475112200] [2019-11-26 02:41:03,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:03,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475112200] [2019-11-26 02:41:03,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:03,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:41:03,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595444669] [2019-11-26 02:41:03,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:41:03,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:03,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:41:03,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:41:03,264 INFO L87 Difference]: Start difference. First operand 14863 states and 42564 transitions. Second operand 5 states. [2019-11-26 02:41:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:03,656 INFO L93 Difference]: Finished difference Result 19768 states and 56511 transitions. [2019-11-26 02:41:03,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:41:03,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-26 02:41:03,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:03,681 INFO L225 Difference]: With dead ends: 19768 [2019-11-26 02:41:03,681 INFO L226 Difference]: Without dead ends: 19768 [2019-11-26 02:41:03,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:41:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19768 states. [2019-11-26 02:41:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19768 to 15768. [2019-11-26 02:41:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15768 states. [2019-11-26 02:41:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15768 states to 15768 states and 45150 transitions. [2019-11-26 02:41:03,900 INFO L78 Accepts]: Start accepts. Automaton has 15768 states and 45150 transitions. Word has length 71 [2019-11-26 02:41:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:03,900 INFO L462 AbstractCegarLoop]: Abstraction has 15768 states and 45150 transitions. [2019-11-26 02:41:03,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:41:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 15768 states and 45150 transitions. [2019-11-26 02:41:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:41:03,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:03,908 INFO L410 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] [2019-11-26 02:41:03,908 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:03,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:03,909 INFO L82 PathProgramCache]: Analyzing trace with hash -787184031, now seen corresponding path program 1 times [2019-11-26 02:41:03,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:03,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889193980] [2019-11-26 02:41:03,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:03,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889193980] [2019-11-26 02:41:03,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:03,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:41:03,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406110274] [2019-11-26 02:41:03,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:41:03,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:03,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:41:03,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:41:03,976 INFO L87 Difference]: Start difference. First operand 15768 states and 45150 transitions. Second operand 4 states. [2019-11-26 02:41:04,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:04,421 INFO L93 Difference]: Finished difference Result 20664 states and 59358 transitions. [2019-11-26 02:41:04,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:41:04,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:41:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:04,445 INFO L225 Difference]: With dead ends: 20664 [2019-11-26 02:41:04,446 INFO L226 Difference]: Without dead ends: 20388 [2019-11-26 02:41:04,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:41:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20388 states. [2019-11-26 02:41:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20388 to 18951. [2019-11-26 02:41:04,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18951 states. [2019-11-26 02:41:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18951 states to 18951 states and 54439 transitions. [2019-11-26 02:41:04,697 INFO L78 Accepts]: Start accepts. Automaton has 18951 states and 54439 transitions. Word has length 71 [2019-11-26 02:41:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:04,697 INFO L462 AbstractCegarLoop]: Abstraction has 18951 states and 54439 transitions. [2019-11-26 02:41:04,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:41:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 18951 states and 54439 transitions. [2019-11-26 02:41:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:41:04,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:04,708 INFO L410 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] [2019-11-26 02:41:04,708 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:04,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:04,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1710831906, now seen corresponding path program 1 times [2019-11-26 02:41:04,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:04,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573772578] [2019-11-26 02:41:04,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:04,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573772578] [2019-11-26 02:41:04,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:04,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-26 02:41:04,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056404805] [2019-11-26 02:41:04,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:41:04,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:04,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:41:04,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:41:04,836 INFO L87 Difference]: Start difference. First operand 18951 states and 54439 transitions. Second operand 9 states. [2019-11-26 02:41:05,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:05,580 INFO L93 Difference]: Finished difference Result 24278 states and 69372 transitions. [2019-11-26 02:41:05,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:41:05,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-11-26 02:41:05,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:05,614 INFO L225 Difference]: With dead ends: 24278 [2019-11-26 02:41:05,614 INFO L226 Difference]: Without dead ends: 24278 [2019-11-26 02:41:05,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:41:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24278 states. [2019-11-26 02:41:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24278 to 20616. [2019-11-26 02:41:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20616 states. [2019-11-26 02:41:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20616 states to 20616 states and 59237 transitions. [2019-11-26 02:41:05,957 INFO L78 Accepts]: Start accepts. Automaton has 20616 states and 59237 transitions. Word has length 71 [2019-11-26 02:41:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:05,958 INFO L462 AbstractCegarLoop]: Abstraction has 20616 states and 59237 transitions. [2019-11-26 02:41:05,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:41:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 20616 states and 59237 transitions. [2019-11-26 02:41:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:41:05,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:05,968 INFO L410 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] [2019-11-26 02:41:05,968 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:05,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:05,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1696631709, now seen corresponding path program 1 times [2019-11-26 02:41:05,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:05,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046791852] [2019-11-26 02:41:05,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:06,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046791852] [2019-11-26 02:41:06,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:06,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:41:06,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236209936] [2019-11-26 02:41:06,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:41:06,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:06,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:41:06,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:41:06,080 INFO L87 Difference]: Start difference. First operand 20616 states and 59237 transitions. Second operand 5 states. [2019-11-26 02:41:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:06,139 INFO L93 Difference]: Finished difference Result 6192 states and 14494 transitions. [2019-11-26 02:41:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:41:06,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-26 02:41:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:06,144 INFO L225 Difference]: With dead ends: 6192 [2019-11-26 02:41:06,144 INFO L226 Difference]: Without dead ends: 5020 [2019-11-26 02:41:06,144 INFO L630 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 [2019-11-26 02:41:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2019-11-26 02:41:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 4283. [2019-11-26 02:41:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4283 states. [2019-11-26 02:41:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 9830 transitions. [2019-11-26 02:41:06,275 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 9830 transitions. Word has length 71 [2019-11-26 02:41:06,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:06,275 INFO L462 AbstractCegarLoop]: Abstraction has 4283 states and 9830 transitions. [2019-11-26 02:41:06,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:41:06,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 9830 transitions. [2019-11-26 02:41:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 02:41:06,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:06,286 INFO L410 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] [2019-11-26 02:41:06,286 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:06,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:06,286 INFO L82 PathProgramCache]: Analyzing trace with hash -704066716, now seen corresponding path program 1 times [2019-11-26 02:41:06,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:06,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142083417] [2019-11-26 02:41:06,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:06,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142083417] [2019-11-26 02:41:06,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:06,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:41:06,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552235903] [2019-11-26 02:41:06,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:41:06,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:06,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:41:06,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:41:06,360 INFO L87 Difference]: Start difference. First operand 4283 states and 9830 transitions. Second operand 5 states. [2019-11-26 02:41:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:06,590 INFO L93 Difference]: Finished difference Result 4936 states and 11181 transitions. [2019-11-26 02:41:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:41:06,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-26 02:41:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:06,595 INFO L225 Difference]: With dead ends: 4936 [2019-11-26 02:41:06,595 INFO L226 Difference]: Without dead ends: 4905 [2019-11-26 02:41:06,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:41:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-11-26 02:41:06,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4420. [2019-11-26 02:41:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4420 states. [2019-11-26 02:41:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 10099 transitions. [2019-11-26 02:41:06,637 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 10099 transitions. Word has length 86 [2019-11-26 02:41:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:06,637 INFO L462 AbstractCegarLoop]: Abstraction has 4420 states and 10099 transitions. [2019-11-26 02:41:06,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:41:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 10099 transitions. [2019-11-26 02:41:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 02:41:06,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:06,641 INFO L410 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] [2019-11-26 02:41:06,641 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:06,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:06,641 INFO L82 PathProgramCache]: Analyzing trace with hash 644532785, now seen corresponding path program 1 times [2019-11-26 02:41:06,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:06,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209283283] [2019-11-26 02:41:06,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:06,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209283283] [2019-11-26 02:41:06,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:06,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:41:06,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663960480] [2019-11-26 02:41:06,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:41:06,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:06,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:41:06,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:41:06,818 INFO L87 Difference]: Start difference. First operand 4420 states and 10099 transitions. Second operand 7 states. [2019-11-26 02:41:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:07,118 INFO L93 Difference]: Finished difference Result 5530 states and 12573 transitions. [2019-11-26 02:41:07,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:41:07,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-26 02:41:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:07,127 INFO L225 Difference]: With dead ends: 5530 [2019-11-26 02:41:07,128 INFO L226 Difference]: Without dead ends: 5512 [2019-11-26 02:41:07,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:41:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5512 states. [2019-11-26 02:41:07,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5512 to 4565. [2019-11-26 02:41:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-11-26 02:41:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 10427 transitions. [2019-11-26 02:41:07,174 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 10427 transitions. Word has length 86 [2019-11-26 02:41:07,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:07,174 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 10427 transitions. [2019-11-26 02:41:07,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:41:07,174 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 10427 transitions. [2019-11-26 02:41:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 02:41:07,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:07,180 INFO L410 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] [2019-11-26 02:41:07,180 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1152418574, now seen corresponding path program 1 times [2019-11-26 02:41:07,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:07,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908609237] [2019-11-26 02:41:07,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:07,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908609237] [2019-11-26 02:41:07,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:07,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:41:07,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531777639] [2019-11-26 02:41:07,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:41:07,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:07,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:41:07,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:41:07,270 INFO L87 Difference]: Start difference. First operand 4565 states and 10427 transitions. Second operand 6 states. [2019-11-26 02:41:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:07,408 INFO L93 Difference]: Finished difference Result 4403 states and 9941 transitions. [2019-11-26 02:41:07,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:41:07,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-26 02:41:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:07,412 INFO L225 Difference]: With dead ends: 4403 [2019-11-26 02:41:07,412 INFO L226 Difference]: Without dead ends: 4403 [2019-11-26 02:41:07,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:41:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4403 states. [2019-11-26 02:41:07,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4403 to 3069. [2019-11-26 02:41:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3069 states. [2019-11-26 02:41:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 7023 transitions. [2019-11-26 02:41:07,443 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 7023 transitions. Word has length 86 [2019-11-26 02:41:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:07,443 INFO L462 AbstractCegarLoop]: Abstraction has 3069 states and 7023 transitions. [2019-11-26 02:41:07,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:41:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 7023 transitions. [2019-11-26 02:41:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 02:41:07,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:07,446 INFO L410 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] [2019-11-26 02:41:07,446 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:07,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:07,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1161956523, now seen corresponding path program 1 times [2019-11-26 02:41:07,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:07,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474299596] [2019-11-26 02:41:07,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:07,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474299596] [2019-11-26 02:41:07,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:07,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 02:41:07,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114762496] [2019-11-26 02:41:07,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:41:07,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:07,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:41:07,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:41:07,582 INFO L87 Difference]: Start difference. First operand 3069 states and 7023 transitions. Second operand 8 states. [2019-11-26 02:41:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:08,056 INFO L93 Difference]: Finished difference Result 3569 states and 8090 transitions. [2019-11-26 02:41:08,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 02:41:08,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-26 02:41:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:08,060 INFO L225 Difference]: With dead ends: 3569 [2019-11-26 02:41:08,061 INFO L226 Difference]: Without dead ends: 3569 [2019-11-26 02:41:08,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:41:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2019-11-26 02:41:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 3168. [2019-11-26 02:41:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3168 states. [2019-11-26 02:41:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 7228 transitions. [2019-11-26 02:41:08,109 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 7228 transitions. Word has length 88 [2019-11-26 02:41:08,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:08,110 INFO L462 AbstractCegarLoop]: Abstraction has 3168 states and 7228 transitions. [2019-11-26 02:41:08,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:41:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 7228 transitions. [2019-11-26 02:41:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 02:41:08,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:08,114 INFO L410 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] [2019-11-26 02:41:08,114 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2049460204, now seen corresponding path program 1 times [2019-11-26 02:41:08,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:08,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734159259] [2019-11-26 02:41:08,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:08,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734159259] [2019-11-26 02:41:08,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:08,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:41:08,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468926154] [2019-11-26 02:41:08,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:41:08,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:41:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:41:08,257 INFO L87 Difference]: Start difference. First operand 3168 states and 7228 transitions. Second operand 7 states. [2019-11-26 02:41:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:08,360 INFO L93 Difference]: Finished difference Result 5381 states and 12355 transitions. [2019-11-26 02:41:08,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:41:08,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-11-26 02:41:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:08,362 INFO L225 Difference]: With dead ends: 5381 [2019-11-26 02:41:08,363 INFO L226 Difference]: Without dead ends: 2305 [2019-11-26 02:41:08,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:41:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2019-11-26 02:41:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2019-11-26 02:41:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-11-26 02:41:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 5276 transitions. [2019-11-26 02:41:08,383 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 5276 transitions. Word has length 88 [2019-11-26 02:41:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:08,383 INFO L462 AbstractCegarLoop]: Abstraction has 2305 states and 5276 transitions. [2019-11-26 02:41:08,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:41:08,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 5276 transitions. [2019-11-26 02:41:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 02:41:08,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:08,386 INFO L410 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] [2019-11-26 02:41:08,386 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:08,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:08,387 INFO L82 PathProgramCache]: Analyzing trace with hash 502510154, now seen corresponding path program 2 times [2019-11-26 02:41:08,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:08,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273328074] [2019-11-26 02:41:08,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:41:08,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273328074] [2019-11-26 02:41:08,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:08,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 02:41:08,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235135783] [2019-11-26 02:41:08,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:41:08,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:08,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:41:08,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:41:08,577 INFO L87 Difference]: Start difference. First operand 2305 states and 5276 transitions. Second operand 10 states. [2019-11-26 02:41:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:08,920 INFO L93 Difference]: Finished difference Result 3951 states and 9033 transitions. [2019-11-26 02:41:08,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 02:41:08,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-11-26 02:41:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:08,922 INFO L225 Difference]: With dead ends: 3951 [2019-11-26 02:41:08,922 INFO L226 Difference]: Without dead ends: 2572 [2019-11-26 02:41:08,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:41:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-11-26 02:41:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2342. [2019-11-26 02:41:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2342 states. [2019-11-26 02:41:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 5307 transitions. [2019-11-26 02:41:08,942 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 5307 transitions. Word has length 88 [2019-11-26 02:41:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:08,943 INFO L462 AbstractCegarLoop]: Abstraction has 2342 states and 5307 transitions. [2019-11-26 02:41:08,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:41:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 5307 transitions. [2019-11-26 02:41:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 02:41:08,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:08,945 INFO L410 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] [2019-11-26 02:41:08,945 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:08,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:08,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1568953738, now seen corresponding path program 3 times [2019-11-26 02:41:08,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:08,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771921509] [2019-11-26 02:41:08,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:41:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:41:09,016 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:41:09,016 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:41:09,168 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-26 02:41:09,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:41:09 BasicIcfg [2019-11-26 02:41:09,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:41:09,171 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:41:09,171 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:41:09,171 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:41:09,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:40:41" (3/4) ... [2019-11-26 02:41:09,174 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:41:09,358 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f7ed528b-dff6-4030-a801-0f87ca1ab6e2/bin/utaipan/witness.graphml [2019-11-26 02:41:09,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:41:09,361 INFO L168 Benchmark]: Toolchain (without parser) took 29243.32 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 944.7 MB in the beginning and 1.6 GB in the end (delta: -608.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-26 02:41:09,361 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:41:09,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:41:09,362 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:41:09,362 INFO L168 Benchmark]: Boogie Preprocessor took 38.10 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. [2019-11-26 02:41:09,362 INFO L168 Benchmark]: RCFGBuilder took 667.90 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:41:09,363 INFO L168 Benchmark]: TraceAbstraction took 27541.83 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -546.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-26 02:41:09,363 INFO L168 Benchmark]: Witness Printer took 187.92 ms. Allocated memory is still 3.1 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:41:09,365 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 746.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.10 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 667.90 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27541.83 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -546.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 187.92 ms. Allocated memory is still 3.1 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L809] 0 pthread_t t839; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] FCALL, FORK 0 pthread_create(&t839, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t840; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t840, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 331 locations, 5 error locations. Result: UNSAFE, OverallTime: 27.3s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6650 SDtfs, 7264 SDslu, 15474 SDs, 0 SdLazy, 5933 SolverSat, 376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56774occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 50848 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1803 NumberOfCodeBlocks, 1803 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1690 ConstructedInterpolants, 0 QuantifiedInterpolants, 311584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...