./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/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 08836ca71f49a12a892546f2d51ead1fad9c3f07 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-07 13:15:14,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:15:14,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:15:14,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:15:14,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:15:14,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:15:14,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:15:14,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:15:14,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:15:14,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:15:14,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:15:14,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:15:14,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:15:14,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:15:14,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:15:14,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:15:14,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:15:14,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:15:14,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:15:14,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:15:14,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:15:14,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:15:14,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:15:14,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:15:14,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:15:14,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:15:14,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:15:14,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:15:14,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:15:14,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:15:14,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:15:14,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:15:14,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:15:14,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:15:14,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:15:14,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:15:14,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:15:14,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:15:14,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:15:14,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:15:14,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:15:14,988 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:15:14,998 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:15:14,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:15:14,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:15:14,999 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:15:14,999 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:15:15,000 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:15:15,000 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:15:15,000 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:15:15,000 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:15:15,000 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:15:15,000 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:15:15,000 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:15:15,001 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:15:15,001 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:15:15,001 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:15:15,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:15:15,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:15:15,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:15:15,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:15:15,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:15:15,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:15:15,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:15:15,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:15:15,003 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:15:15,003 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:15:15,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:15:15,003 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:15:15,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:15:15,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:15:15,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:15:15,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:15:15,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:15:15,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:15:15,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:15:15,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:15:15,004 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:15:15,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:15:15,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:15:15,005 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:15:15,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:15:15,005 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_d459dbc7-93c4-407f-a1f6-0413b9e89077/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 -> 08836ca71f49a12a892546f2d51ead1fad9c3f07 [2019-12-07 13:15:15,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:15:15,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:15:15,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:15:15,135 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:15:15,136 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:15:15,136 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix000_rmo.opt.i [2019-12-07 13:15:15,180 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/bin/utaipan/data/0c617a033/06f1534a60754fc68425a2c987ddb872/FLAG982a71914 [2019-12-07 13:15:15,552 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:15:15,552 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/sv-benchmarks/c/pthread-wmm/mix000_rmo.opt.i [2019-12-07 13:15:15,564 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/bin/utaipan/data/0c617a033/06f1534a60754fc68425a2c987ddb872/FLAG982a71914 [2019-12-07 13:15:15,574 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/bin/utaipan/data/0c617a033/06f1534a60754fc68425a2c987ddb872 [2019-12-07 13:15:15,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:15:15,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:15:15,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:15:15,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:15:15,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:15:15,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:15:15" (1/1) ... [2019-12-07 13:15:15,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15, skipping insertion in model container [2019-12-07 13:15:15,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:15:15" (1/1) ... [2019-12-07 13:15:15,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:15:15,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:15:15,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:15:15,885 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:15:15,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:15:15,978 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:15:15,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15 WrapperNode [2019-12-07 13:15:15,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:15:15,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:15:15,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:15:15,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:15:15,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15" (1/1) ... [2019-12-07 13:15:16,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15" (1/1) ... [2019-12-07 13:15:16,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:15:16,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:15:16,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:15:16,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:15:16,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15" (1/1) ... [2019-12-07 13:15:16,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15" (1/1) ... [2019-12-07 13:15:16,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15" (1/1) ... [2019-12-07 13:15:16,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15" (1/1) ... [2019-12-07 13:15:16,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15" (1/1) ... [2019-12-07 13:15:16,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15" (1/1) ... [2019-12-07 13:15:16,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15" (1/1) ... [2019-12-07 13:15:16,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:15:16,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:15:16,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:15:16,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:15:16,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/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-12-07 13:15:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:15:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:15:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:15:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:15:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:15:16,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:15:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:15:16,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:15:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:15:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:15:16,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:15:16,109 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 13:15:16,500 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:15:16,500 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:15:16,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:15:16 BoogieIcfgContainer [2019-12-07 13:15:16,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:15:16,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:15:16,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:15:16,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:15:16,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:15:15" (1/3) ... [2019-12-07 13:15:16,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfbc5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:15:16, skipping insertion in model container [2019-12-07 13:15:16,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:15" (2/3) ... [2019-12-07 13:15:16,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfbc5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:15:16, skipping insertion in model container [2019-12-07 13:15:16,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:15:16" (3/3) ... [2019-12-07 13:15:16,506 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_rmo.opt.i [2019-12-07 13:15:16,512 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:15:16,512 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:15:16,517 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:15:16,517 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:15:16,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,543 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,562 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:16,593 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 13:15:16,605 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:15:16,605 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:15:16,606 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:15:16,606 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:15:16,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:15:16,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:15:16,606 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:15:16,606 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:15:16,617 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-07 13:15:16,618 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 13:15:16,689 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 13:15:16,689 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:15:16,701 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 918 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 13:15:16,722 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 13:15:16,761 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 13:15:16,761 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:15:16,768 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 918 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 13:15:16,789 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-07 13:15:16,789 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:15:19,594 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 13:15:19,775 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 13:15:19,868 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123043 [2019-12-07 13:15:19,868 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 13:15:19,871 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 128 transitions [2019-12-07 13:15:20,998 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 23592 states. [2019-12-07 13:15:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 23592 states. [2019-12-07 13:15:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:15:21,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:21,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:15:21,005 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:21,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:21,009 INFO L82 PathProgramCache]: Analyzing trace with hash 962357028, now seen corresponding path program 1 times [2019-12-07 13:15:21,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:21,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108185792] [2019-12-07 13:15:21,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:21,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108185792] [2019-12-07 13:15:21,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:21,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:15:21,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414412459] [2019-12-07 13:15:21,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:15:21,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:21,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:15:21,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:15:21,167 INFO L87 Difference]: Start difference. First operand 23592 states. Second operand 3 states. [2019-12-07 13:15:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:21,431 INFO L93 Difference]: Finished difference Result 23438 states and 83922 transitions. [2019-12-07 13:15:21,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:15:21,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:15:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:21,572 INFO L225 Difference]: With dead ends: 23438 [2019-12-07 13:15:21,572 INFO L226 Difference]: Without dead ends: 21828 [2019-12-07 13:15:21,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 13:15:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21828 states. [2019-12-07 13:15:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21828 to 21828. [2019-12-07 13:15:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21828 states. [2019-12-07 13:15:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21828 states to 21828 states and 78096 transitions. [2019-12-07 13:15:22,437 INFO L78 Accepts]: Start accepts. Automaton has 21828 states and 78096 transitions. Word has length 5 [2019-12-07 13:15:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:22,437 INFO L462 AbstractCegarLoop]: Abstraction has 21828 states and 78096 transitions. [2019-12-07 13:15:22,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:15:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 21828 states and 78096 transitions. [2019-12-07 13:15:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:15:22,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:22,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:15:22,440 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:22,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:22,440 INFO L82 PathProgramCache]: Analyzing trace with hash -549370662, now seen corresponding path program 1 times [2019-12-07 13:15:22,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:22,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817710759] [2019-12-07 13:15:22,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:22,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817710759] [2019-12-07 13:15:22,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:22,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:15:22,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95705462] [2019-12-07 13:15:22,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:15:22,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:22,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:15:22,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:15:22,501 INFO L87 Difference]: Start difference. First operand 21828 states and 78096 transitions. Second operand 4 states. [2019-12-07 13:15:23,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:23,091 INFO L93 Difference]: Finished difference Result 34804 states and 119015 transitions. [2019-12-07 13:15:23,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:15:23,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:15:23,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:23,233 INFO L225 Difference]: With dead ends: 34804 [2019-12-07 13:15:23,233 INFO L226 Difference]: Without dead ends: 34788 [2019-12-07 13:15:23,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 13:15:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-07 13:15:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 33965. [2019-12-07 13:15:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33965 states. [2019-12-07 13:15:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33965 states to 33965 states and 116837 transitions. [2019-12-07 13:15:24,179 INFO L78 Accepts]: Start accepts. Automaton has 33965 states and 116837 transitions. Word has length 11 [2019-12-07 13:15:24,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:24,179 INFO L462 AbstractCegarLoop]: Abstraction has 33965 states and 116837 transitions. [2019-12-07 13:15:24,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:15:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 33965 states and 116837 transitions. [2019-12-07 13:15:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:15:24,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:24,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:15:24,184 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:24,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:24,184 INFO L82 PathProgramCache]: Analyzing trace with hash -779218677, now seen corresponding path program 1 times [2019-12-07 13:15:24,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:24,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913106364] [2019-12-07 13:15:24,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:24,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913106364] [2019-12-07 13:15:24,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:24,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:15:24,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767399438] [2019-12-07 13:15:24,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:15:24,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:24,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:15:24,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:15:24,229 INFO L87 Difference]: Start difference. First operand 33965 states and 116837 transitions. Second operand 4 states. [2019-12-07 13:15:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:24,504 INFO L93 Difference]: Finished difference Result 44062 states and 148933 transitions. [2019-12-07 13:15:24,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:15:24,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 13:15:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:24,591 INFO L225 Difference]: With dead ends: 44062 [2019-12-07 13:15:24,591 INFO L226 Difference]: Without dead ends: 44047 [2019-12-07 13:15:24,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 13:15:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44047 states. [2019-12-07 13:15:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44047 to 39221. [2019-12-07 13:15:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39221 states. [2019-12-07 13:15:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39221 states to 39221 states and 134004 transitions. [2019-12-07 13:15:25,560 INFO L78 Accepts]: Start accepts. Automaton has 39221 states and 134004 transitions. Word has length 14 [2019-12-07 13:15:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:25,561 INFO L462 AbstractCegarLoop]: Abstraction has 39221 states and 134004 transitions. [2019-12-07 13:15:25,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:15:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 39221 states and 134004 transitions. [2019-12-07 13:15:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:15:25,564 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:25,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:15:25,564 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:25,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:25,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1614053436, now seen corresponding path program 1 times [2019-12-07 13:15:25,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:25,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618151737] [2019-12-07 13:15:25,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:25,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618151737] [2019-12-07 13:15:25,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:25,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:15:25,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782551445] [2019-12-07 13:15:25,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:15:25,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:25,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:15:25,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:15:25,602 INFO L87 Difference]: Start difference. First operand 39221 states and 134004 transitions. Second operand 3 states. [2019-12-07 13:15:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:25,845 INFO L93 Difference]: Finished difference Result 64200 states and 209661 transitions. [2019-12-07 13:15:25,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:15:25,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 13:15:25,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:25,952 INFO L225 Difference]: With dead ends: 64200 [2019-12-07 13:15:25,953 INFO L226 Difference]: Without dead ends: 64200 [2019-12-07 13:15:25,953 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-12-07 13:15:26,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64200 states. [2019-12-07 13:15:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64200 to 57180. [2019-12-07 13:15:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57180 states. [2019-12-07 13:15:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57180 states to 57180 states and 189699 transitions. [2019-12-07 13:15:27,427 INFO L78 Accepts]: Start accepts. Automaton has 57180 states and 189699 transitions. Word has length 15 [2019-12-07 13:15:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:27,428 INFO L462 AbstractCegarLoop]: Abstraction has 57180 states and 189699 transitions. [2019-12-07 13:15:27,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:15:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 57180 states and 189699 transitions. [2019-12-07 13:15:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:15:27,433 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:27,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:15:27,433 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:27,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:27,433 INFO L82 PathProgramCache]: Analyzing trace with hash -223387027, now seen corresponding path program 1 times [2019-12-07 13:15:27,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:27,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135765601] [2019-12-07 13:15:27,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:27,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135765601] [2019-12-07 13:15:27,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:27,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:15:27,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088914433] [2019-12-07 13:15:27,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:15:27,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:15:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:15:27,506 INFO L87 Difference]: Start difference. First operand 57180 states and 189699 transitions. Second operand 3 states. [2019-12-07 13:15:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:27,713 INFO L93 Difference]: Finished difference Result 57157 states and 189533 transitions. [2019-12-07 13:15:27,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:15:27,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 13:15:27,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:27,818 INFO L225 Difference]: With dead ends: 57157 [2019-12-07 13:15:27,818 INFO L226 Difference]: Without dead ends: 57157 [2019-12-07 13:15:27,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 13:15:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57157 states. [2019-12-07 13:15:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57157 to 57103. [2019-12-07 13:15:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57103 states. [2019-12-07 13:15:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57103 states to 57103 states and 189449 transitions. [2019-12-07 13:15:29,116 INFO L78 Accepts]: Start accepts. Automaton has 57103 states and 189449 transitions. Word has length 16 [2019-12-07 13:15:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:29,116 INFO L462 AbstractCegarLoop]: Abstraction has 57103 states and 189449 transitions. [2019-12-07 13:15:29,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:15:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 57103 states and 189449 transitions. [2019-12-07 13:15:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:15:29,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:29,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:15:29,121 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:29,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1852908680, now seen corresponding path program 1 times [2019-12-07 13:15:29,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:29,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802601915] [2019-12-07 13:15:29,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:29,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802601915] [2019-12-07 13:15:29,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:29,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:15:29,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785114828] [2019-12-07 13:15:29,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:15:29,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:29,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:15:29,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:15:29,159 INFO L87 Difference]: Start difference. First operand 57103 states and 189449 transitions. Second operand 4 states. [2019-12-07 13:15:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:29,549 INFO L93 Difference]: Finished difference Result 70801 states and 231389 transitions. [2019-12-07 13:15:29,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:15:29,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 13:15:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:29,671 INFO L225 Difference]: With dead ends: 70801 [2019-12-07 13:15:29,671 INFO L226 Difference]: Without dead ends: 70784 [2019-12-07 13:15:29,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 13:15:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70784 states. [2019-12-07 13:15:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70784 to 57908. [2019-12-07 13:15:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57908 states. [2019-12-07 13:15:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57908 states to 57908 states and 192089 transitions. [2019-12-07 13:15:31,142 INFO L78 Accepts]: Start accepts. Automaton has 57908 states and 192089 transitions. Word has length 17 [2019-12-07 13:15:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:31,142 INFO L462 AbstractCegarLoop]: Abstraction has 57908 states and 192089 transitions. [2019-12-07 13:15:31,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:15:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 57908 states and 192089 transitions. [2019-12-07 13:15:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:15:31,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:31,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:15:31,147 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:31,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:31,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1561020631, now seen corresponding path program 1 times [2019-12-07 13:15:31,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:31,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090789999] [2019-12-07 13:15:31,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:31,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090789999] [2019-12-07 13:15:31,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:31,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:15:31,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968726846] [2019-12-07 13:15:31,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:15:31,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:31,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:15:31,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:15:31,204 INFO L87 Difference]: Start difference. First operand 57908 states and 192089 transitions. Second operand 4 states. [2019-12-07 13:15:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:31,408 INFO L93 Difference]: Finished difference Result 54524 states and 180597 transitions. [2019-12-07 13:15:31,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:15:31,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 13:15:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:31,501 INFO L225 Difference]: With dead ends: 54524 [2019-12-07 13:15:31,501 INFO L226 Difference]: Without dead ends: 54524 [2019-12-07 13:15:31,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:15:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54524 states. [2019-12-07 13:15:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54524 to 54524. [2019-12-07 13:15:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54524 states. [2019-12-07 13:15:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54524 states to 54524 states and 180597 transitions. [2019-12-07 13:15:32,878 INFO L78 Accepts]: Start accepts. Automaton has 54524 states and 180597 transitions. Word has length 17 [2019-12-07 13:15:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:32,878 INFO L462 AbstractCegarLoop]: Abstraction has 54524 states and 180597 transitions. [2019-12-07 13:15:32,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:15:32,878 INFO L276 IsEmpty]: Start isEmpty. Operand 54524 states and 180597 transitions. [2019-12-07 13:15:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:15:32,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:32,886 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] [2019-12-07 13:15:32,886 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:32,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:32,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1536984533, now seen corresponding path program 1 times [2019-12-07 13:15:32,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:32,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290676695] [2019-12-07 13:15:32,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:32,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290676695] [2019-12-07 13:15:32,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:32,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:15:32,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919946638] [2019-12-07 13:15:32,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:15:32,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:32,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:15:32,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:15:32,930 INFO L87 Difference]: Start difference. First operand 54524 states and 180597 transitions. Second operand 5 states. [2019-12-07 13:15:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:33,507 INFO L93 Difference]: Finished difference Result 77321 states and 249603 transitions. [2019-12-07 13:15:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:15:33,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 13:15:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:33,631 INFO L225 Difference]: With dead ends: 77321 [2019-12-07 13:15:33,631 INFO L226 Difference]: Without dead ends: 77307 [2019-12-07 13:15:33,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:15:34,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77307 states. [2019-12-07 13:15:34,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77307 to 59256. [2019-12-07 13:15:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59256 states. [2019-12-07 13:15:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59256 states to 59256 states and 195309 transitions. [2019-12-07 13:15:36,256 INFO L78 Accepts]: Start accepts. Automaton has 59256 states and 195309 transitions. Word has length 20 [2019-12-07 13:15:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:36,257 INFO L462 AbstractCegarLoop]: Abstraction has 59256 states and 195309 transitions. [2019-12-07 13:15:36,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:15:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 59256 states and 195309 transitions. [2019-12-07 13:15:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:15:36,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:36,269 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] [2019-12-07 13:15:36,269 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1507310190, now seen corresponding path program 1 times [2019-12-07 13:15:36,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:36,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911958507] [2019-12-07 13:15:36,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:36,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911958507] [2019-12-07 13:15:36,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:36,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:15:36,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511061706] [2019-12-07 13:15:36,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:15:36,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:36,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:15:36,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:15:36,315 INFO L87 Difference]: Start difference. First operand 59256 states and 195309 transitions. Second operand 4 states. [2019-12-07 13:15:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:36,364 INFO L93 Difference]: Finished difference Result 11646 states and 31144 transitions. [2019-12-07 13:15:36,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:15:36,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 13:15:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:36,372 INFO L225 Difference]: With dead ends: 11646 [2019-12-07 13:15:36,372 INFO L226 Difference]: Without dead ends: 7170 [2019-12-07 13:15:36,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 13:15:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-12-07 13:15:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7134. [2019-12-07 13:15:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2019-12-07 13:15:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 16503 transitions. [2019-12-07 13:15:36,444 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 16503 transitions. Word has length 23 [2019-12-07 13:15:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:36,444 INFO L462 AbstractCegarLoop]: Abstraction has 7134 states and 16503 transitions. [2019-12-07 13:15:36,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:15:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 16503 transitions. [2019-12-07 13:15:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 13:15:36,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:36,448 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] [2019-12-07 13:15:36,449 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:36,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1044355322, now seen corresponding path program 1 times [2019-12-07 13:15:36,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:36,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455121055] [2019-12-07 13:15:36,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:36,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455121055] [2019-12-07 13:15:36,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:36,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:15:36,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126013711] [2019-12-07 13:15:36,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:15:36,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:36,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:15:36,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:15:36,470 INFO L87 Difference]: Start difference. First operand 7134 states and 16503 transitions. Second operand 3 states. [2019-12-07 13:15:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:36,523 INFO L93 Difference]: Finished difference Result 7632 states and 16713 transitions. [2019-12-07 13:15:36,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:15:36,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 13:15:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:36,528 INFO L225 Difference]: With dead ends: 7632 [2019-12-07 13:15:36,529 INFO L226 Difference]: Without dead ends: 7632 [2019-12-07 13:15:36,529 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-12-07 13:15:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7632 states. [2019-12-07 13:15:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7632 to 7105. [2019-12-07 13:15:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2019-12-07 13:15:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 15616 transitions. [2019-12-07 13:15:36,601 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 15616 transitions. Word has length 31 [2019-12-07 13:15:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:36,601 INFO L462 AbstractCegarLoop]: Abstraction has 7105 states and 15616 transitions. [2019-12-07 13:15:36,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:15:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 15616 transitions. [2019-12-07 13:15:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 13:15:36,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:36,607 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] [2019-12-07 13:15:36,607 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:36,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1333269799, now seen corresponding path program 1 times [2019-12-07 13:15:36,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:36,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741567393] [2019-12-07 13:15:36,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:36,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741567393] [2019-12-07 13:15:36,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:36,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:15:36,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056898252] [2019-12-07 13:15:36,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:15:36,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:36,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:15:36,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:15:36,654 INFO L87 Difference]: Start difference. First operand 7105 states and 15616 transitions. Second operand 5 states. [2019-12-07 13:15:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:36,892 INFO L93 Difference]: Finished difference Result 7988 states and 17297 transitions. [2019-12-07 13:15:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:15:36,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 13:15:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:36,898 INFO L225 Difference]: With dead ends: 7988 [2019-12-07 13:15:36,898 INFO L226 Difference]: Without dead ends: 7987 [2019-12-07 13:15:36,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:15:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7987 states. [2019-12-07 13:15:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7987 to 6266. [2019-12-07 13:15:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6266 states. [2019-12-07 13:15:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 13920 transitions. [2019-12-07 13:15:36,960 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 13920 transitions. Word has length 34 [2019-12-07 13:15:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:36,960 INFO L462 AbstractCegarLoop]: Abstraction has 6266 states and 13920 transitions. [2019-12-07 13:15:36,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:15:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 13920 transitions. [2019-12-07 13:15:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 13:15:36,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:36,966 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] [2019-12-07 13:15:36,966 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:36,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:36,966 INFO L82 PathProgramCache]: Analyzing trace with hash 135630366, now seen corresponding path program 1 times [2019-12-07 13:15:36,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:36,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659298584] [2019-12-07 13:15:36,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:37,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659298584] [2019-12-07 13:15:37,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:37,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:15:37,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900357951] [2019-12-07 13:15:37,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:15:37,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:37,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:15:37,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:15:37,014 INFO L87 Difference]: Start difference. First operand 6266 states and 13920 transitions. Second operand 5 states. [2019-12-07 13:15:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:37,274 INFO L93 Difference]: Finished difference Result 7418 states and 16257 transitions. [2019-12-07 13:15:37,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:15:37,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 13:15:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:37,280 INFO L225 Difference]: With dead ends: 7418 [2019-12-07 13:15:37,280 INFO L226 Difference]: Without dead ends: 7418 [2019-12-07 13:15:37,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:15:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7418 states. [2019-12-07 13:15:37,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7418 to 7084. [2019-12-07 13:15:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7084 states. [2019-12-07 13:15:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7084 states to 7084 states and 15609 transitions. [2019-12-07 13:15:37,345 INFO L78 Accepts]: Start accepts. Automaton has 7084 states and 15609 transitions. Word has length 41 [2019-12-07 13:15:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:37,345 INFO L462 AbstractCegarLoop]: Abstraction has 7084 states and 15609 transitions. [2019-12-07 13:15:37,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:15:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 7084 states and 15609 transitions. [2019-12-07 13:15:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 13:15:37,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:37,352 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-12-07 13:15:37,352 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:37,352 INFO L82 PathProgramCache]: Analyzing trace with hash -73517057, now seen corresponding path program 1 times [2019-12-07 13:15:37,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:37,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527441617] [2019-12-07 13:15:37,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:37,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527441617] [2019-12-07 13:15:37,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:37,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:15:37,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631636080] [2019-12-07 13:15:37,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:15:37,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:15:37,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:15:37,411 INFO L87 Difference]: Start difference. First operand 7084 states and 15609 transitions. Second operand 6 states. [2019-12-07 13:15:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:37,503 INFO L93 Difference]: Finished difference Result 10645 states and 23530 transitions. [2019-12-07 13:15:37,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:15:37,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 13:15:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:37,510 INFO L225 Difference]: With dead ends: 10645 [2019-12-07 13:15:37,510 INFO L226 Difference]: Without dead ends: 8267 [2019-12-07 13:15:37,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:15:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8267 states. [2019-12-07 13:15:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8267 to 8267. [2019-12-07 13:15:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8267 states. [2019-12-07 13:15:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8267 states to 8267 states and 18342 transitions. [2019-12-07 13:15:37,584 INFO L78 Accepts]: Start accepts. Automaton has 8267 states and 18342 transitions. Word has length 42 [2019-12-07 13:15:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:37,584 INFO L462 AbstractCegarLoop]: Abstraction has 8267 states and 18342 transitions. [2019-12-07 13:15:37,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:15:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 8267 states and 18342 transitions. [2019-12-07 13:15:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 13:15:37,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:37,593 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] [2019-12-07 13:15:37,593 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:37,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:37,593 INFO L82 PathProgramCache]: Analyzing trace with hash -915744505, now seen corresponding path program 1 times [2019-12-07 13:15:37,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:37,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371455977] [2019-12-07 13:15:37,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:37,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371455977] [2019-12-07 13:15:37,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:37,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:15:37,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491996804] [2019-12-07 13:15:37,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:15:37,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:37,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:15:37,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:15:37,641 INFO L87 Difference]: Start difference. First operand 8267 states and 18342 transitions. Second operand 5 states. [2019-12-07 13:15:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:37,680 INFO L93 Difference]: Finished difference Result 5927 states and 13008 transitions. [2019-12-07 13:15:37,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:15:37,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-07 13:15:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:37,684 INFO L225 Difference]: With dead ends: 5927 [2019-12-07 13:15:37,684 INFO L226 Difference]: Without dead ends: 5562 [2019-12-07 13:15:37,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12-07 13:15:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2019-12-07 13:15:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 5243. [2019-12-07 13:15:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2019-12-07 13:15:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 11686 transitions. [2019-12-07 13:15:37,731 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 11686 transitions. Word has length 43 [2019-12-07 13:15:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:37,731 INFO L462 AbstractCegarLoop]: Abstraction has 5243 states and 11686 transitions. [2019-12-07 13:15:37,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:15:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 11686 transitions. [2019-12-07 13:15:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 13:15:37,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:37,737 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] [2019-12-07 13:15:37,737 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:37,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:37,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1172304105, now seen corresponding path program 1 times [2019-12-07 13:15:37,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:37,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100781750] [2019-12-07 13:15:37,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:37,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100781750] [2019-12-07 13:15:37,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:37,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:15:37,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063157836] [2019-12-07 13:15:37,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:15:37,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:15:37,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:15:37,802 INFO L87 Difference]: Start difference. First operand 5243 states and 11686 transitions. Second operand 3 states. [2019-12-07 13:15:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:37,818 INFO L93 Difference]: Finished difference Result 5243 states and 11685 transitions. [2019-12-07 13:15:37,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:15:37,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 13:15:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:37,822 INFO L225 Difference]: With dead ends: 5243 [2019-12-07 13:15:37,822 INFO L226 Difference]: Without dead ends: 5243 [2019-12-07 13:15:37,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:15:37,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2019-12-07 13:15:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 5048. [2019-12-07 13:15:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5048 states. [2019-12-07 13:15:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5048 states to 5048 states and 11320 transitions. [2019-12-07 13:15:37,871 INFO L78 Accepts]: Start accepts. Automaton has 5048 states and 11320 transitions. Word has length 58 [2019-12-07 13:15:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:37,871 INFO L462 AbstractCegarLoop]: Abstraction has 5048 states and 11320 transitions. [2019-12-07 13:15:37,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:15:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 5048 states and 11320 transitions. [2019-12-07 13:15:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:15:37,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:37,877 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] [2019-12-07 13:15:37,877 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:37,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:37,877 INFO L82 PathProgramCache]: Analyzing trace with hash 879996346, now seen corresponding path program 1 times [2019-12-07 13:15:37,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:37,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771840063] [2019-12-07 13:15:37,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:38,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771840063] [2019-12-07 13:15:38,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:38,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:15:38,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712306813] [2019-12-07 13:15:38,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:15:38,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:38,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:15:38,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:15:38,096 INFO L87 Difference]: Start difference. First operand 5048 states and 11320 transitions. Second operand 9 states. [2019-12-07 13:15:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:38,762 INFO L93 Difference]: Finished difference Result 9736 states and 21359 transitions. [2019-12-07 13:15:38,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 13:15:38,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-12-07 13:15:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:38,768 INFO L225 Difference]: With dead ends: 9736 [2019-12-07 13:15:38,768 INFO L226 Difference]: Without dead ends: 7586 [2019-12-07 13:15:38,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:15:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7586 states. [2019-12-07 13:15:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7586 to 4975. [2019-12-07 13:15:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4975 states. [2019-12-07 13:15:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4975 states to 4975 states and 11346 transitions. [2019-12-07 13:15:38,825 INFO L78 Accepts]: Start accepts. Automaton has 4975 states and 11346 transitions. Word has length 59 [2019-12-07 13:15:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:38,825 INFO L462 AbstractCegarLoop]: Abstraction has 4975 states and 11346 transitions. [2019-12-07 13:15:38,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:15:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 4975 states and 11346 transitions. [2019-12-07 13:15:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:15:38,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:38,831 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] [2019-12-07 13:15:38,831 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:38,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:38,831 INFO L82 PathProgramCache]: Analyzing trace with hash 30677052, now seen corresponding path program 2 times [2019-12-07 13:15:38,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:38,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158389904] [2019-12-07 13:15:38,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:39,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158389904] [2019-12-07 13:15:39,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:39,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:15:39,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370305197] [2019-12-07 13:15:39,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:15:39,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:39,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:15:39,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:15:39,014 INFO L87 Difference]: Start difference. First operand 4975 states and 11346 transitions. Second operand 13 states. [2019-12-07 13:15:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:39,883 INFO L93 Difference]: Finished difference Result 12072 states and 27360 transitions. [2019-12-07 13:15:39,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 13:15:39,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-07 13:15:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:39,891 INFO L225 Difference]: With dead ends: 12072 [2019-12-07 13:15:39,891 INFO L226 Difference]: Without dead ends: 11525 [2019-12-07 13:15:39,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2019-12-07 13:15:39,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11525 states. [2019-12-07 13:15:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11525 to 6185. [2019-12-07 13:15:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2019-12-07 13:15:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 14013 transitions. [2019-12-07 13:15:39,971 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 14013 transitions. Word has length 59 [2019-12-07 13:15:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:39,971 INFO L462 AbstractCegarLoop]: Abstraction has 6185 states and 14013 transitions. [2019-12-07 13:15:39,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:15:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 14013 transitions. [2019-12-07 13:15:39,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:15:39,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:39,976 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] [2019-12-07 13:15:39,976 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:39,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:39,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1998597780, now seen corresponding path program 3 times [2019-12-07 13:15:39,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:39,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679711014] [2019-12-07 13:15:39,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:40,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679711014] [2019-12-07 13:15:40,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:40,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:15:40,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48760341] [2019-12-07 13:15:40,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:15:40,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:40,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:15:40,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:15:40,044 INFO L87 Difference]: Start difference. First operand 6185 states and 14013 transitions. Second operand 4 states. [2019-12-07 13:15:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:40,168 INFO L93 Difference]: Finished difference Result 6076 states and 13410 transitions. [2019-12-07 13:15:40,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:15:40,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 13:15:40,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:40,173 INFO L225 Difference]: With dead ends: 6076 [2019-12-07 13:15:40,173 INFO L226 Difference]: Without dead ends: 6076 [2019-12-07 13:15:40,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:15:40,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2019-12-07 13:15:40,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 5970. [2019-12-07 13:15:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5970 states. [2019-12-07 13:15:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5970 states to 5970 states and 13201 transitions. [2019-12-07 13:15:40,223 INFO L78 Accepts]: Start accepts. Automaton has 5970 states and 13201 transitions. Word has length 59 [2019-12-07 13:15:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:40,223 INFO L462 AbstractCegarLoop]: Abstraction has 5970 states and 13201 transitions. [2019-12-07 13:15:40,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:15:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 5970 states and 13201 transitions. [2019-12-07 13:15:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:15:40,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:40,229 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] [2019-12-07 13:15:40,229 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:40,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash 610981762, now seen corresponding path program 4 times [2019-12-07 13:15:40,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:40,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770412554] [2019-12-07 13:15:40,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:40,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770412554] [2019-12-07 13:15:40,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:40,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:15:40,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018442238] [2019-12-07 13:15:40,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:15:40,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:40,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:15:40,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:15:40,304 INFO L87 Difference]: Start difference. First operand 5970 states and 13201 transitions. Second operand 8 states. [2019-12-07 13:15:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:40,568 INFO L93 Difference]: Finished difference Result 10326 states and 22625 transitions. [2019-12-07 13:15:40,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:15:40,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-07 13:15:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:40,576 INFO L225 Difference]: With dead ends: 10326 [2019-12-07 13:15:40,576 INFO L226 Difference]: Without dead ends: 9523 [2019-12-07 13:15:40,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:15:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9523 states. [2019-12-07 13:15:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9523 to 7966. [2019-12-07 13:15:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7966 states. [2019-12-07 13:15:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7966 states to 7966 states and 17853 transitions. [2019-12-07 13:15:40,665 INFO L78 Accepts]: Start accepts. Automaton has 7966 states and 17853 transitions. Word has length 59 [2019-12-07 13:15:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:40,665 INFO L462 AbstractCegarLoop]: Abstraction has 7966 states and 17853 transitions. [2019-12-07 13:15:40,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:15:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 7966 states and 17853 transitions. [2019-12-07 13:15:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:15:40,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:40,671 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] [2019-12-07 13:15:40,671 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:40,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:40,671 INFO L82 PathProgramCache]: Analyzing trace with hash -366616322, now seen corresponding path program 5 times [2019-12-07 13:15:40,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:40,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386483428] [2019-12-07 13:15:40,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:40,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386483428] [2019-12-07 13:15:40,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:40,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 13:15:40,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010251759] [2019-12-07 13:15:40,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 13:15:40,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:40,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 13:15:40,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:15:40,928 INFO L87 Difference]: Start difference. First operand 7966 states and 17853 transitions. Second operand 14 states. [2019-12-07 13:15:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:43,559 INFO L93 Difference]: Finished difference Result 11655 states and 25785 transitions. [2019-12-07 13:15:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 13:15:43,559 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-12-07 13:15:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:43,567 INFO L225 Difference]: With dead ends: 11655 [2019-12-07 13:15:43,567 INFO L226 Difference]: Without dead ends: 11218 [2019-12-07 13:15:43,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:15:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11218 states. [2019-12-07 13:15:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11218 to 8366. [2019-12-07 13:15:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8366 states. [2019-12-07 13:15:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8366 states to 8366 states and 18749 transitions. [2019-12-07 13:15:43,660 INFO L78 Accepts]: Start accepts. Automaton has 8366 states and 18749 transitions. Word has length 59 [2019-12-07 13:15:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:43,660 INFO L462 AbstractCegarLoop]: Abstraction has 8366 states and 18749 transitions. [2019-12-07 13:15:43,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 13:15:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 8366 states and 18749 transitions. [2019-12-07 13:15:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 13:15:43,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:43,667 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] [2019-12-07 13:15:43,667 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:43,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1432451734, now seen corresponding path program 1 times [2019-12-07 13:15:43,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:43,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823629852] [2019-12-07 13:15:43,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:43,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823629852] [2019-12-07 13:15:43,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:43,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:15:43,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180741009] [2019-12-07 13:15:43,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:15:43,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:43,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:15:43,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:15:43,723 INFO L87 Difference]: Start difference. First operand 8366 states and 18749 transitions. Second operand 5 states. [2019-12-07 13:15:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:43,763 INFO L93 Difference]: Finished difference Result 9104 states and 20302 transitions. [2019-12-07 13:15:43,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:15:43,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-07 13:15:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:43,764 INFO L225 Difference]: With dead ends: 9104 [2019-12-07 13:15:43,765 INFO L226 Difference]: Without dead ends: 807 [2019-12-07 13:15:43,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:15:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-12-07 13:15:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2019-12-07 13:15:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-12-07 13:15:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1648 transitions. [2019-12-07 13:15:43,771 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1648 transitions. Word has length 60 [2019-12-07 13:15:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:43,771 INFO L462 AbstractCegarLoop]: Abstraction has 807 states and 1648 transitions. [2019-12-07 13:15:43,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:15:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1648 transitions. [2019-12-07 13:15:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 13:15:43,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:43,772 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] [2019-12-07 13:15:43,772 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:43,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:43,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1561092922, now seen corresponding path program 2 times [2019-12-07 13:15:43,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:43,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101514746] [2019-12-07 13:15:43,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:15:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:15:43,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101514746] [2019-12-07 13:15:43,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:15:43,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:15:43,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299329045] [2019-12-07 13:15:43,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:15:43,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:15:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:15:43,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:15:43,833 INFO L87 Difference]: Start difference. First operand 807 states and 1648 transitions. Second operand 8 states. [2019-12-07 13:15:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:15:43,998 INFO L93 Difference]: Finished difference Result 1407 states and 2800 transitions. [2019-12-07 13:15:43,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:15:43,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-07 13:15:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:15:43,999 INFO L225 Difference]: With dead ends: 1407 [2019-12-07 13:15:43,999 INFO L226 Difference]: Without dead ends: 1025 [2019-12-07 13:15:43,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:15:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-12-07 13:15:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 811. [2019-12-07 13:15:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 13:15:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1654 transitions. [2019-12-07 13:15:44,006 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1654 transitions. Word has length 60 [2019-12-07 13:15:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:15:44,006 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1654 transitions. [2019-12-07 13:15:44,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:15:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1654 transitions. [2019-12-07 13:15:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 13:15:44,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:15:44,007 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] [2019-12-07 13:15:44,007 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:15:44,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:15:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash -328419130, now seen corresponding path program 3 times [2019-12-07 13:15:44,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:15:44,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871449804] [2019-12-07 13:15:44,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:15:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:15:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:15:44,090 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:15:44,090 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:15:44,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_264 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t8~0.base_34|) 0) (= 0 v_~x$w_buff0~0_204) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t8~0.base_34| 1)) (= v_~main$tmp_guard1~0_44 0) (= v_~__unbuffered_p1_EBX~0_50 0) (= 0 v_~weak$$choice0~0_151) (= 0 v_~x$mem_tmp~0_161) (= 0 v_~x$w_buff1~0_194) (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~x$w_buff1_used~0_447) (= 0 v_~x$w_buff0_used~0_844) (= 0 v_~x$r_buff1_thd2~0_308) (= v_~y~0_47 0) (= 0 v_~x~0_246) (= v_~x$r_buff1_thd0~0_211 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p0_EAX~0_71) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$flush_delayed~0_185 0) (= 0 |v_#NULL.base_4|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t8~0.base_34| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t8~0.base_34|) |v_ULTIMATE.start_main_~#t8~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p1_EAX~0_69) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_438) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t8~0.base_34|) (= v_~weak$$choice2~0_232 0) (= 0 v_~x$r_buff0_thd0~0_98) (= v_~x$r_buff0_thd1~0_297 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t8~0.base_34| 4) |v_#length_19|) (= 0 |v_ULTIMATE.start_main_~#t8~0.offset_24|) (= 0 v_~__unbuffered_cnt~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_204, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_297, ~x$flush_delayed~0=v_~x$flush_delayed~0_185, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_16|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t8~0.base=|v_ULTIMATE.start_main_~#t8~0.base_34|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~x$mem_tmp~0=v_~x$mem_tmp~0_161, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, #length=|v_#length_19|, ~y~0=v_~y~0_47, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_194, ULTIMATE.start_main_~#t8~0.offset=|v_ULTIMATE.start_main_~#t8~0.offset_24|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_97|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_308, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_153|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_211, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_438, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_844, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_91|, ~weak$$choice0~0=v_~weak$$choice0~0_151, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_117|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_31|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t9~0.offset=|v_ULTIMATE.start_main_~#t9~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ULTIMATE.start_main_~#t9~0.base=|v_ULTIMATE.start_main_~#t9~0.base_23|, ~weak$$choice2~0=v_~weak$$choice2~0_232, ~x~0=v_~x~0_246, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ULTIMATE.start_main_~#t8~0.base, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_~#t8~0.offset, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t9~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t9~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 13:15:44,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t9~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t9~0.base_12|) |v_ULTIMATE.start_main_~#t9~0.offset_10| 1))) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t9~0.base_12| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t9~0.base_12| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t9~0.base_12|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t9~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t9~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t9~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t9~0.offset=|v_ULTIMATE.start_main_~#t9~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t9~0.base=|v_ULTIMATE.start_main_~#t9~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t9~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t9~0.base] because there is no mapped edge [2019-12-07 13:15:44,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= 1 v_~x$w_buff0_used~0_158) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_158 256))))) 1 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0~0_35) (= v_~x$w_buff1_used~0_84 v_~x$w_buff0_used~0_159) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_~x$w_buff0~0_36 v_~x$w_buff1~0_51) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_159} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_84, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 13:15:44,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2056156460 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2056156460 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out2056156460| ~x$w_buff1~0_In2056156460)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out2056156460| ~x$w_buff0~0_In2056156460)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In2056156460, ~x$w_buff1~0=~x$w_buff1~0_In2056156460, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2056156460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2056156460} OutVars{~x$w_buff0~0=~x$w_buff0~0_In2056156460, ~x$w_buff1~0=~x$w_buff1~0_In2056156460, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2056156460, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out2056156460|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2056156460} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 13:15:44,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_72 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~x~0=v_~x~0_72, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 13:15:44,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~x$r_buff0_thd2~0_86 v_~x$r_buff0_thd2~0_85)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 13:15:44,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-1513595281 256) 0))) (or (and .cse0 (= ~x~0_In-1513595281 |P1Thread1of1ForFork1_#t~ite48_Out-1513595281|)) (and (= ~x$mem_tmp~0_In-1513595281 |P1Thread1of1ForFork1_#t~ite48_Out-1513595281|) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1513595281, ~x$mem_tmp~0=~x$mem_tmp~0_In-1513595281, ~x~0=~x~0_In-1513595281} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1513595281, ~x$mem_tmp~0=~x$mem_tmp~0_In-1513595281, ~x~0=~x~0_In-1513595281, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1513595281|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 13:15:44,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1635193727 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1635193727 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-1635193727|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1635193727 |P1Thread1of1ForFork1_#t~ite51_Out-1635193727|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1635193727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1635193727} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1635193727|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1635193727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1635193727} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 13:15:44,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-705984096 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-705984096 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-705984096 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-705984096 256) 0))) (or (and (= ~x$w_buff1_used~0_In-705984096 |P1Thread1of1ForFork1_#t~ite52_Out-705984096|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-705984096|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-705984096, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-705984096, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-705984096, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-705984096} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-705984096|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-705984096, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-705984096, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-705984096, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-705984096} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 13:15:44,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1341852741 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_Out-1341852741 ~x$r_buff0_thd2~0_In-1341852741)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1341852741 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1341852741 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1341852741, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1341852741} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1341852741|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1341852741, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1341852741} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 13:15:44,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In537948404 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In537948404 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In537948404 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In537948404 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite54_Out537948404| 0)) (and (= ~x$r_buff1_thd2~0_In537948404 |P1Thread1of1ForFork1_#t~ite54_Out537948404|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In537948404, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In537948404, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In537948404, ~x$w_buff0_used~0=~x$w_buff0_used~0_In537948404} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In537948404, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In537948404, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out537948404|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In537948404, ~x$w_buff0_used~0=~x$w_buff0_used~0_In537948404} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 13:15:44,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_117 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 13:15:44,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In1521994871 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out1521994871| ~x$mem_tmp~0_In1521994871) (not .cse0)) (and .cse0 (= ~x~0_In1521994871 |P0Thread1of1ForFork0_#t~ite25_Out1521994871|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1521994871, ~x$mem_tmp~0=~x$mem_tmp~0_In1521994871, ~x~0=~x~0_In1521994871} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1521994871|, ~x$flush_delayed~0=~x$flush_delayed~0_In1521994871, ~x$mem_tmp~0=~x$mem_tmp~0_In1521994871, ~x~0=~x~0_In1521994871} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 13:15:44,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$flush_delayed~0_78 0) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= |v_P0Thread1of1ForFork0_#t~ite25_18| v_~x~0_123)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 13:15:44,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_30 256)) (= (mod v_~x$w_buff0_used~0_209 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:15:44,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In255471035 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out255471035| |ULTIMATE.start_main_#t~ite57_Out255471035|)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In255471035 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite57_Out255471035| ~x~0_In255471035) .cse2) (and (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite57_Out255471035| ~x$w_buff1~0_In255471035) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In255471035, ~x$w_buff1_used~0=~x$w_buff1_used~0_In255471035, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In255471035, ~x~0=~x~0_In255471035} OutVars{~x$w_buff1~0=~x$w_buff1~0_In255471035, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out255471035|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out255471035|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In255471035, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In255471035, ~x~0=~x~0_In255471035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 13:15:44,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2144762710 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2144762710 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-2144762710| ~x$w_buff0_used~0_In-2144762710)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out-2144762710|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2144762710, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144762710} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2144762710, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2144762710|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144762710} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:15:44,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-1628040140 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1628040140 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1628040140 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1628040140 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1628040140|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-1628040140 |ULTIMATE.start_main_#t~ite60_Out-1628040140|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1628040140, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1628040140, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1628040140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1628040140} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1628040140, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1628040140|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1628040140, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1628040140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1628040140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 13:15:44,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1420490113 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1420490113 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1420490113| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In1420490113 |ULTIMATE.start_main_#t~ite61_Out1420490113|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1420490113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1420490113} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1420490113, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1420490113|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1420490113} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:15:44,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1692310087 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1692310087 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1692310087 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1692310087 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1692310087| ~x$r_buff1_thd0~0_In1692310087) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite62_Out1692310087| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1692310087, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1692310087, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1692310087, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1692310087} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1692310087|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1692310087, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1692310087, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1692310087, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1692310087} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:15:44,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite62_50|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_38) (= v_~__unbuffered_p0_EBX~0_31 0))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_49|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:15:44,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:15:44 BasicIcfg [2019-12-07 13:15:44,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:15:44,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:15:44,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:15:44,172 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:15:44,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:15:16" (3/4) ... [2019-12-07 13:15:44,175 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:15:44,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_264 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t8~0.base_34|) 0) (= 0 v_~x$w_buff0~0_204) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t8~0.base_34| 1)) (= v_~main$tmp_guard1~0_44 0) (= v_~__unbuffered_p1_EBX~0_50 0) (= 0 v_~weak$$choice0~0_151) (= 0 v_~x$mem_tmp~0_161) (= 0 v_~x$w_buff1~0_194) (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~x$w_buff1_used~0_447) (= 0 v_~x$w_buff0_used~0_844) (= 0 v_~x$r_buff1_thd2~0_308) (= v_~y~0_47 0) (= 0 v_~x~0_246) (= v_~x$r_buff1_thd0~0_211 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p0_EAX~0_71) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$flush_delayed~0_185 0) (= 0 |v_#NULL.base_4|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t8~0.base_34| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t8~0.base_34|) |v_ULTIMATE.start_main_~#t8~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p1_EAX~0_69) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_438) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t8~0.base_34|) (= v_~weak$$choice2~0_232 0) (= 0 v_~x$r_buff0_thd0~0_98) (= v_~x$r_buff0_thd1~0_297 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t8~0.base_34| 4) |v_#length_19|) (= 0 |v_ULTIMATE.start_main_~#t8~0.offset_24|) (= 0 v_~__unbuffered_cnt~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_204, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_297, ~x$flush_delayed~0=v_~x$flush_delayed~0_185, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_16|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t8~0.base=|v_ULTIMATE.start_main_~#t8~0.base_34|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~x$mem_tmp~0=v_~x$mem_tmp~0_161, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, #length=|v_#length_19|, ~y~0=v_~y~0_47, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_194, ULTIMATE.start_main_~#t8~0.offset=|v_ULTIMATE.start_main_~#t8~0.offset_24|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_97|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_308, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_153|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_211, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_438, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_844, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_91|, ~weak$$choice0~0=v_~weak$$choice0~0_151, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_117|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_31|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t9~0.offset=|v_ULTIMATE.start_main_~#t9~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ULTIMATE.start_main_~#t9~0.base=|v_ULTIMATE.start_main_~#t9~0.base_23|, ~weak$$choice2~0=v_~weak$$choice2~0_232, ~x~0=v_~x~0_246, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ULTIMATE.start_main_~#t8~0.base, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_~#t8~0.offset, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t9~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t9~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 13:15:44,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t9~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t9~0.base_12|) |v_ULTIMATE.start_main_~#t9~0.offset_10| 1))) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t9~0.base_12| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t9~0.base_12| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t9~0.base_12|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t9~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t9~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t9~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t9~0.offset=|v_ULTIMATE.start_main_~#t9~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t9~0.base=|v_ULTIMATE.start_main_~#t9~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t9~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t9~0.base] because there is no mapped edge [2019-12-07 13:15:44,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= 1 v_~x$w_buff0_used~0_158) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_158 256))))) 1 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0~0_35) (= v_~x$w_buff1_used~0_84 v_~x$w_buff0_used~0_159) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_~x$w_buff0~0_36 v_~x$w_buff1~0_51) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_159} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_84, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 13:15:44,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2056156460 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2056156460 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out2056156460| ~x$w_buff1~0_In2056156460)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out2056156460| ~x$w_buff0~0_In2056156460)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In2056156460, ~x$w_buff1~0=~x$w_buff1~0_In2056156460, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2056156460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2056156460} OutVars{~x$w_buff0~0=~x$w_buff0~0_In2056156460, ~x$w_buff1~0=~x$w_buff1~0_In2056156460, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2056156460, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out2056156460|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2056156460} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 13:15:44,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_72 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~x~0=v_~x~0_72, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 13:15:44,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~x$r_buff0_thd2~0_86 v_~x$r_buff0_thd2~0_85)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 13:15:44,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-1513595281 256) 0))) (or (and .cse0 (= ~x~0_In-1513595281 |P1Thread1of1ForFork1_#t~ite48_Out-1513595281|)) (and (= ~x$mem_tmp~0_In-1513595281 |P1Thread1of1ForFork1_#t~ite48_Out-1513595281|) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1513595281, ~x$mem_tmp~0=~x$mem_tmp~0_In-1513595281, ~x~0=~x~0_In-1513595281} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1513595281, ~x$mem_tmp~0=~x$mem_tmp~0_In-1513595281, ~x~0=~x~0_In-1513595281, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1513595281|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 13:15:44,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1635193727 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1635193727 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-1635193727|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1635193727 |P1Thread1of1ForFork1_#t~ite51_Out-1635193727|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1635193727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1635193727} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1635193727|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1635193727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1635193727} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 13:15:44,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-705984096 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-705984096 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-705984096 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-705984096 256) 0))) (or (and (= ~x$w_buff1_used~0_In-705984096 |P1Thread1of1ForFork1_#t~ite52_Out-705984096|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-705984096|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-705984096, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-705984096, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-705984096, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-705984096} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-705984096|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-705984096, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-705984096, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-705984096, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-705984096} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 13:15:44,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1341852741 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_Out-1341852741 ~x$r_buff0_thd2~0_In-1341852741)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1341852741 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1341852741 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1341852741, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1341852741} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1341852741|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1341852741, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1341852741} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 13:15:44,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In537948404 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In537948404 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In537948404 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In537948404 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite54_Out537948404| 0)) (and (= ~x$r_buff1_thd2~0_In537948404 |P1Thread1of1ForFork1_#t~ite54_Out537948404|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In537948404, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In537948404, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In537948404, ~x$w_buff0_used~0=~x$w_buff0_used~0_In537948404} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In537948404, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In537948404, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out537948404|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In537948404, ~x$w_buff0_used~0=~x$w_buff0_used~0_In537948404} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 13:15:44,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_117 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 13:15:44,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In1521994871 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out1521994871| ~x$mem_tmp~0_In1521994871) (not .cse0)) (and .cse0 (= ~x~0_In1521994871 |P0Thread1of1ForFork0_#t~ite25_Out1521994871|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1521994871, ~x$mem_tmp~0=~x$mem_tmp~0_In1521994871, ~x~0=~x~0_In1521994871} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1521994871|, ~x$flush_delayed~0=~x$flush_delayed~0_In1521994871, ~x$mem_tmp~0=~x$mem_tmp~0_In1521994871, ~x~0=~x~0_In1521994871} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 13:15:44,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$flush_delayed~0_78 0) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= |v_P0Thread1of1ForFork0_#t~ite25_18| v_~x~0_123)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 13:15:44,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_30 256)) (= (mod v_~x$w_buff0_used~0_209 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:15:44,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In255471035 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out255471035| |ULTIMATE.start_main_#t~ite57_Out255471035|)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In255471035 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite57_Out255471035| ~x~0_In255471035) .cse2) (and (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite57_Out255471035| ~x$w_buff1~0_In255471035) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In255471035, ~x$w_buff1_used~0=~x$w_buff1_used~0_In255471035, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In255471035, ~x~0=~x~0_In255471035} OutVars{~x$w_buff1~0=~x$w_buff1~0_In255471035, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out255471035|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out255471035|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In255471035, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In255471035, ~x~0=~x~0_In255471035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 13:15:44,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2144762710 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2144762710 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-2144762710| ~x$w_buff0_used~0_In-2144762710)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out-2144762710|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2144762710, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144762710} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2144762710, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2144762710|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144762710} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:15:44,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-1628040140 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1628040140 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1628040140 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1628040140 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1628040140|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-1628040140 |ULTIMATE.start_main_#t~ite60_Out-1628040140|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1628040140, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1628040140, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1628040140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1628040140} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1628040140, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1628040140|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1628040140, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1628040140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1628040140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 13:15:44,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1420490113 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1420490113 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1420490113| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In1420490113 |ULTIMATE.start_main_#t~ite61_Out1420490113|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1420490113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1420490113} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1420490113, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1420490113|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1420490113} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:15:44,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1692310087 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1692310087 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1692310087 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1692310087 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1692310087| ~x$r_buff1_thd0~0_In1692310087) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite62_Out1692310087| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1692310087, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1692310087, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1692310087, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1692310087} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1692310087|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1692310087, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1692310087, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1692310087, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1692310087} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:15:44,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite62_50|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_38) (= v_~__unbuffered_p0_EBX~0_31 0))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_49|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:15:44,258 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d459dbc7-93c4-407f-a1f6-0413b9e89077/bin/utaipan/witness.graphml [2019-12-07 13:15:44,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:15:44,259 INFO L168 Benchmark]: Toolchain (without parser) took 28682.97 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 938.2 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 13:15:44,260 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:15:44,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:15:44,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.25 ms. Allocated memory is still 1.1 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-12-07 13:15:44,261 INFO L168 Benchmark]: Boogie Preprocessor took 30.60 ms. Allocated memory is still 1.1 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-12-07 13:15:44,261 INFO L168 Benchmark]: RCFGBuilder took 444.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:15:44,261 INFO L168 Benchmark]: TraceAbstraction took 27669.95 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 13:15:44,262 INFO L168 Benchmark]: Witness Printer took 86.27 ms. Allocated memory is still 3.8 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:15:44,264 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.25 ms. Allocated memory is still 1.1 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 30.60 ms. Allocated memory is still 1.1 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. * RCFGBuilder took 444.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27669.95 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 86.27 ms. Allocated memory is still 3.8 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 179 ProgramPointsBefore, 104 ProgramPointsAfterwards, 228 TransitionsBefore, 128 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9002 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 297 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 123043 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t8, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] FCALL, FORK 0 pthread_create(&t9, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 y = 1 [L732] 1 __unbuffered_p0_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.4s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5014 SDtfs, 6351 SDslu, 12208 SDs, 0 SdLazy, 6173 SolverSat, 336 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59256occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 59462 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 862 NumberOfCodeBlocks, 862 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 780 ConstructedInterpolants, 0 QuantifiedInterpolants, 276182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...