./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_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_e0ccf098-4065-4122-8337-396c1a1b2322/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/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 113feeaecf8d9417460b2edea2f8119d43f3e77a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:37:10,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:37:10,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:37:10,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:37:10,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:37:10,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:37:10,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:37:10,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:37:10,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:37:10,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:37:10,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:37:10,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:37:10,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:37:10,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:37:10,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:37:10,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:37:10,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:37:10,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:37:10,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:37:10,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:37:10,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:37:10,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:37:10,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:37:10,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:37:10,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:37:10,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:37:10,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:37:10,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:37:10,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:37:10,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:37:10,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:37:10,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:37:10,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:37:10,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:37:10,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:37:10,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:37:10,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:37:10,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:37:10,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:37:10,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:37:10,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:37:10,107 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:37:10,120 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:37:10,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:37:10,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:37:10,121 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:37:10,121 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:37:10,121 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:37:10,121 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:37:10,122 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:37:10,122 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:37:10,122 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:37:10,122 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:37:10,122 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:37:10,123 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:37:10,123 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:37:10,123 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:37:10,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:37:10,124 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:37:10,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:37:10,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:37:10,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:37:10,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:37:10,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:37:10,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:37:10,125 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:37:10,125 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:37:10,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:37:10,125 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:37:10,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:37:10,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:37:10,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:37:10,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:37:10,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:37:10,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:37:10,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:37:10,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:37:10,127 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:37:10,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:37:10,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:37:10,127 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:37:10,127 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:37:10,128 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_e0ccf098-4065-4122-8337-396c1a1b2322/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 -> 113feeaecf8d9417460b2edea2f8119d43f3e77a [2019-12-07 13:37:10,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:37:10,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:37:10,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:37:10,246 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:37:10,246 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:37:10,247 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix012_rmo.opt.i [2019-12-07 13:37:10,290 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/bin/utaipan/data/25caf23ad/6531b86a0b8a461dbb84fbcfa1c88517/FLAGde1142fde [2019-12-07 13:37:10,677 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:37:10,677 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/sv-benchmarks/c/pthread-wmm/mix012_rmo.opt.i [2019-12-07 13:37:10,689 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/bin/utaipan/data/25caf23ad/6531b86a0b8a461dbb84fbcfa1c88517/FLAGde1142fde [2019-12-07 13:37:11,054 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/bin/utaipan/data/25caf23ad/6531b86a0b8a461dbb84fbcfa1c88517 [2019-12-07 13:37:11,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:37:11,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:37:11,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:37:11,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:37:11,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:37:11,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:37:11" (1/1) ... [2019-12-07 13:37:11,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@787fdc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:11, skipping insertion in model container [2019-12-07 13:37:11,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:37:11" (1/1) ... [2019-12-07 13:37:11,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:37:11,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:37:11,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:37:11,367 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:37:11,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:37:11,459 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:37:11,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:11 WrapperNode [2019-12-07 13:37:11,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:37:11,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:37:11,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:37:11,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:37:11,468 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:37:11" (1/1) ... [2019-12-07 13:37:11,483 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:37:11" (1/1) ... [2019-12-07 13:37:11,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:37:11,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:37:11,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:37:11,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:37:11,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:11" (1/1) ... [2019-12-07 13:37:11,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:11" (1/1) ... [2019-12-07 13:37:11,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:11" (1/1) ... [2019-12-07 13:37:11,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:11" (1/1) ... [2019-12-07 13:37:11,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:11" (1/1) ... [2019-12-07 13:37:11,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:11" (1/1) ... [2019-12-07 13:37:11,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:11" (1/1) ... [2019-12-07 13:37:11,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:37:11,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:37:11,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:37:11,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:37:11,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/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:37:11,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:37:11,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:37:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:37:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:37:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:37:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:37:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:37:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:37:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:37:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:37:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:37:11,569 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:37:11,909 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:37:11,910 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:37:11,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:37:11 BoogieIcfgContainer [2019-12-07 13:37:11,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:37:11,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:37:11,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:37:11,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:37:11,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:37:11" (1/3) ... [2019-12-07 13:37:11,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62855b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:37:11, skipping insertion in model container [2019-12-07 13:37:11,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:11" (2/3) ... [2019-12-07 13:37:11,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62855b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:37:11, skipping insertion in model container [2019-12-07 13:37:11,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:37:11" (3/3) ... [2019-12-07 13:37:11,916 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_rmo.opt.i [2019-12-07 13:37:11,922 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:37:11,922 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:37:11,927 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:37:11,928 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:37:11,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,950 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,950 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:11,978 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 13:37:11,990 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:37:11,990 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:37:11,990 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:37:11,990 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:37:11,990 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:37:11,990 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:37:11,990 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:37:11,990 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:37:12,001 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-07 13:37:12,002 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 13:37:12,048 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 13:37:12,048 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:37:12,056 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 13:37:12,068 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 13:37:12,093 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 13:37:12,093 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:37:12,096 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 13:37:12,107 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 13:37:12,108 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:37:14,876 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 13:37:15,168 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-12-07 13:37:15,168 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 13:37:15,170 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 13:37:15,520 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-12-07 13:37:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-12-07 13:37:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:37:15,526 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:15,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:37:15,527 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:15,531 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-07 13:37:15,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:15,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049181250] [2019-12-07 13:37:15,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:15,692 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:37:15,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049181250] [2019-12-07 13:37:15,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:15,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:37:15,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133037599] [2019-12-07 13:37:15,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:15,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:15,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:15,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:15,712 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-12-07 13:37:15,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:15,925 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-12-07 13:37:15,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:15,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:37:15,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:15,995 INFO L225 Difference]: With dead ends: 8760 [2019-12-07 13:37:15,995 INFO L226 Difference]: Without dead ends: 7798 [2019-12-07 13:37:15,996 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:37:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-12-07 13:37:16,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-12-07 13:37:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-07 13:37:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-12-07 13:37:16,254 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-12-07 13:37:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:16,255 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-12-07 13:37:16,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-12-07 13:37:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:37:16,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:16,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:16,258 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:16,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:16,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-07 13:37:16,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:16,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108548489] [2019-12-07 13:37:16,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:16,330 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:37:16,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108548489] [2019-12-07 13:37:16,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:16,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:37:16,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142006679] [2019-12-07 13:37:16,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:37:16,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:16,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:37:16,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:37:16,333 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 4 states. [2019-12-07 13:37:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:16,599 INFO L93 Difference]: Finished difference Result 11906 states and 36801 transitions. [2019-12-07 13:37:16,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:37:16,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:37:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:16,660 INFO L225 Difference]: With dead ends: 11906 [2019-12-07 13:37:16,660 INFO L226 Difference]: Without dead ends: 11892 [2019-12-07 13:37:16,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:37:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states. [2019-12-07 13:37:16,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 10583. [2019-12-07 13:37:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10583 states. [2019-12-07 13:37:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10583 states to 10583 states and 33330 transitions. [2019-12-07 13:37:16,897 INFO L78 Accepts]: Start accepts. Automaton has 10583 states and 33330 transitions. Word has length 11 [2019-12-07 13:37:16,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:16,897 INFO L462 AbstractCegarLoop]: Abstraction has 10583 states and 33330 transitions. [2019-12-07 13:37:16,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:37:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 10583 states and 33330 transitions. [2019-12-07 13:37:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:37:16,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:16,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:16,902 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:16,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:16,902 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-07 13:37:16,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:16,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100768812] [2019-12-07 13:37:16,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:16,967 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:37:16,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100768812] [2019-12-07 13:37:16,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:16,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:37:16,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225805131] [2019-12-07 13:37:16,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:37:16,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:16,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:37:16,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:37:16,968 INFO L87 Difference]: Start difference. First operand 10583 states and 33330 transitions. Second operand 5 states. [2019-12-07 13:37:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:17,206 INFO L93 Difference]: Finished difference Result 15056 states and 46886 transitions. [2019-12-07 13:37:17,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:37:17,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 13:37:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:17,235 INFO L225 Difference]: With dead ends: 15056 [2019-12-07 13:37:17,235 INFO L226 Difference]: Without dead ends: 15056 [2019-12-07 13:37:17,235 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:37:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15056 states. [2019-12-07 13:37:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15056 to 12203. [2019-12-07 13:37:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12203 states. [2019-12-07 13:37:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12203 states to 12203 states and 38425 transitions. [2019-12-07 13:37:17,537 INFO L78 Accepts]: Start accepts. Automaton has 12203 states and 38425 transitions. Word has length 14 [2019-12-07 13:37:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:17,537 INFO L462 AbstractCegarLoop]: Abstraction has 12203 states and 38425 transitions. [2019-12-07 13:37:17,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:37:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 12203 states and 38425 transitions. [2019-12-07 13:37:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:37:17,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:17,540 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:37:17,540 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:17,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:17,540 INFO L82 PathProgramCache]: Analyzing trace with hash -191481557, now seen corresponding path program 1 times [2019-12-07 13:37:17,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:17,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065899539] [2019-12-07 13:37:17,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:17,573 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:37:17,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065899539] [2019-12-07 13:37:17,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:17,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:37:17,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065565004] [2019-12-07 13:37:17,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:17,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:17,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:17,575 INFO L87 Difference]: Start difference. First operand 12203 states and 38425 transitions. Second operand 3 states. [2019-12-07 13:37:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:17,584 INFO L93 Difference]: Finished difference Result 1592 states and 3548 transitions. [2019-12-07 13:37:17,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:17,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 13:37:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:17,587 INFO L225 Difference]: With dead ends: 1592 [2019-12-07 13:37:17,587 INFO L226 Difference]: Without dead ends: 1592 [2019-12-07 13:37:17,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:37:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-12-07 13:37:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1572. [2019-12-07 13:37:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-07 13:37:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-12-07 13:37:17,602 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 16 [2019-12-07 13:37:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:17,602 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-12-07 13:37:17,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-12-07 13:37:17,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:37:17,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:17,604 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] [2019-12-07 13:37:17,604 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:17,604 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-12-07 13:37:17,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:17,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015296511] [2019-12-07 13:37:17,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:17,688 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:37:17,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015296511] [2019-12-07 13:37:17,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:17,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:37:17,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449977331] [2019-12-07 13:37:17,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:37:17,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:17,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:37:17,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:37:17,689 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 6 states. [2019-12-07 13:37:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:17,979 INFO L93 Difference]: Finished difference Result 2337 states and 5011 transitions. [2019-12-07 13:37:17,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:37:17,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 13:37:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:17,983 INFO L225 Difference]: With dead ends: 2337 [2019-12-07 13:37:17,983 INFO L226 Difference]: Without dead ends: 2337 [2019-12-07 13:37:17,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:37:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-12-07 13:37:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1705. [2019-12-07 13:37:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-12-07 13:37:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-12-07 13:37:18,003 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-12-07 13:37:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:18,003 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-12-07 13:37:18,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:37:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-12-07 13:37:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:37:18,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:18,005 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] [2019-12-07 13:37:18,005 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:18,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:18,005 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-07 13:37:18,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:18,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593010299] [2019-12-07 13:37:18,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:18,053 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:37:18,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593010299] [2019-12-07 13:37:18,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:18,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:37:18,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487270186] [2019-12-07 13:37:18,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:37:18,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:18,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:37:18,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:37:18,054 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 5 states. [2019-12-07 13:37:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:18,312 INFO L93 Difference]: Finished difference Result 2417 states and 5251 transitions. [2019-12-07 13:37:18,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:37:18,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 13:37:18,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:18,314 INFO L225 Difference]: With dead ends: 2417 [2019-12-07 13:37:18,314 INFO L226 Difference]: Without dead ends: 2417 [2019-12-07 13:37:18,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:37:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-12-07 13:37:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2124. [2019-12-07 13:37:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2124 states. [2019-12-07 13:37:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 4675 transitions. [2019-12-07 13:37:18,336 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 4675 transitions. Word has length 26 [2019-12-07 13:37:18,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:18,336 INFO L462 AbstractCegarLoop]: Abstraction has 2124 states and 4675 transitions. [2019-12-07 13:37:18,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:37:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 4675 transitions. [2019-12-07 13:37:18,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:37:18,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:18,338 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] [2019-12-07 13:37:18,338 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:18,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1792140012, now seen corresponding path program 1 times [2019-12-07 13:37:18,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:18,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651054647] [2019-12-07 13:37:18,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:18,373 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:37:18,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651054647] [2019-12-07 13:37:18,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:18,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:37:18,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331173423] [2019-12-07 13:37:18,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:37:18,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:18,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:37:18,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:37:18,375 INFO L87 Difference]: Start difference. First operand 2124 states and 4675 transitions. Second operand 4 states. [2019-12-07 13:37:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:18,384 INFO L93 Difference]: Finished difference Result 1195 states and 2515 transitions. [2019-12-07 13:37:18,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:37:18,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 13:37:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:18,385 INFO L225 Difference]: With dead ends: 1195 [2019-12-07 13:37:18,385 INFO L226 Difference]: Without dead ends: 1195 [2019-12-07 13:37:18,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:37:18,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-12-07 13:37:18,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1099. [2019-12-07 13:37:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-12-07 13:37:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 2338 transitions. [2019-12-07 13:37:18,396 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 2338 transitions. Word has length 27 [2019-12-07 13:37:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:18,396 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 2338 transitions. [2019-12-07 13:37:18,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:37:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2338 transitions. [2019-12-07 13:37:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 13:37:18,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:18,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:18,399 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:18,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:18,399 INFO L82 PathProgramCache]: Analyzing trace with hash -306941312, now seen corresponding path program 1 times [2019-12-07 13:37:18,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:18,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332259460] [2019-12-07 13:37:18,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:18,474 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:37:18,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332259460] [2019-12-07 13:37:18,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:18,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:37:18,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201570139] [2019-12-07 13:37:18,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:37:18,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:18,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:37:18,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:37:18,475 INFO L87 Difference]: Start difference. First operand 1099 states and 2338 transitions. Second operand 7 states. [2019-12-07 13:37:18,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:18,988 INFO L93 Difference]: Finished difference Result 1596 states and 3306 transitions. [2019-12-07 13:37:18,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:37:18,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 13:37:18,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:18,990 INFO L225 Difference]: With dead ends: 1596 [2019-12-07 13:37:18,990 INFO L226 Difference]: Without dead ends: 1590 [2019-12-07 13:37:18,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:37:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-12-07 13:37:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1154. [2019-12-07 13:37:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2019-12-07 13:37:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 2439 transitions. [2019-12-07 13:37:19,001 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 2439 transitions. Word has length 50 [2019-12-07 13:37:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:19,002 INFO L462 AbstractCegarLoop]: Abstraction has 1154 states and 2439 transitions. [2019-12-07 13:37:19,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:37:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2439 transitions. [2019-12-07 13:37:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 13:37:19,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:19,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:19,004 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:19,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:19,004 INFO L82 PathProgramCache]: Analyzing trace with hash 945539546, now seen corresponding path program 2 times [2019-12-07 13:37:19,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:19,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856289692] [2019-12-07 13:37:19,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:19,057 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:37:19,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856289692] [2019-12-07 13:37:19,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:19,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:37:19,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576581310] [2019-12-07 13:37:19,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:19,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:19,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:19,058 INFO L87 Difference]: Start difference. First operand 1154 states and 2439 transitions. Second operand 3 states. [2019-12-07 13:37:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:19,095 INFO L93 Difference]: Finished difference Result 1575 states and 3323 transitions. [2019-12-07 13:37:19,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:19,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-07 13:37:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:19,096 INFO L225 Difference]: With dead ends: 1575 [2019-12-07 13:37:19,096 INFO L226 Difference]: Without dead ends: 1575 [2019-12-07 13:37:19,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:37:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-12-07 13:37:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1222. [2019-12-07 13:37:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-07 13:37:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2603 transitions. [2019-12-07 13:37:19,108 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2603 transitions. Word has length 50 [2019-12-07 13:37:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:19,108 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 2603 transitions. [2019-12-07 13:37:19,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2603 transitions. [2019-12-07 13:37:19,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:37:19,110 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:19,110 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:19,110 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1376295086, now seen corresponding path program 1 times [2019-12-07 13:37:19,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:19,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471758738] [2019-12-07 13:37:19,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:37:19,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471758738] [2019-12-07 13:37:19,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:19,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:37:19,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949257148] [2019-12-07 13:37:19,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:37:19,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:19,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:37:19,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:37:19,264 INFO L87 Difference]: Start difference. First operand 1222 states and 2603 transitions. Second operand 10 states. [2019-12-07 13:37:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:19,860 INFO L93 Difference]: Finished difference Result 1987 states and 4096 transitions. [2019-12-07 13:37:19,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 13:37:19,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-07 13:37:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:19,862 INFO L225 Difference]: With dead ends: 1987 [2019-12-07 13:37:19,862 INFO L226 Difference]: Without dead ends: 1987 [2019-12-07 13:37:19,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-12-07 13:37:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2019-12-07 13:37:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1323. [2019-12-07 13:37:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2019-12-07 13:37:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2817 transitions. [2019-12-07 13:37:19,877 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2817 transitions. Word has length 51 [2019-12-07 13:37:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:19,877 INFO L462 AbstractCegarLoop]: Abstraction has 1323 states and 2817 transitions. [2019-12-07 13:37:19,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:37:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2817 transitions. [2019-12-07 13:37:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:37:19,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:19,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:19,879 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:19,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:19,879 INFO L82 PathProgramCache]: Analyzing trace with hash 576609332, now seen corresponding path program 2 times [2019-12-07 13:37:19,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:19,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308854170] [2019-12-07 13:37:19,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:19,922 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:37:19,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308854170] [2019-12-07 13:37:19,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:19,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:37:19,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084947226] [2019-12-07 13:37:19,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:19,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:19,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:19,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:19,923 INFO L87 Difference]: Start difference. First operand 1323 states and 2817 transitions. Second operand 3 states. [2019-12-07 13:37:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:19,931 INFO L93 Difference]: Finished difference Result 1322 states and 2815 transitions. [2019-12-07 13:37:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:19,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 13:37:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:19,932 INFO L225 Difference]: With dead ends: 1322 [2019-12-07 13:37:19,932 INFO L226 Difference]: Without dead ends: 1322 [2019-12-07 13:37:19,932 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:37:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-12-07 13:37:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 970. [2019-12-07 13:37:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-12-07 13:37:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2096 transitions. [2019-12-07 13:37:19,942 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2096 transitions. Word has length 51 [2019-12-07 13:37:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:19,943 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 2096 transitions. [2019-12-07 13:37:19,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2096 transitions. [2019-12-07 13:37:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:37:19,944 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:19,944 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] [2019-12-07 13:37:19,944 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:19,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1353726900, now seen corresponding path program 1 times [2019-12-07 13:37:19,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:19,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479017147] [2019-12-07 13:37:19,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:20,014 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:37:20,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479017147] [2019-12-07 13:37:20,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:20,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:37:20,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139552138] [2019-12-07 13:37:20,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:37:20,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:20,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:37:20,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:37:20,015 INFO L87 Difference]: Start difference. First operand 970 states and 2096 transitions. Second operand 5 states. [2019-12-07 13:37:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:20,034 INFO L93 Difference]: Finished difference Result 1696 states and 3681 transitions. [2019-12-07 13:37:20,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:37:20,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 13:37:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:20,035 INFO L225 Difference]: With dead ends: 1696 [2019-12-07 13:37:20,035 INFO L226 Difference]: Without dead ends: 795 [2019-12-07 13:37:20,036 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:37:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-12-07 13:37:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2019-12-07 13:37:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-12-07 13:37:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1715 transitions. [2019-12-07 13:37:20,042 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1715 transitions. Word has length 52 [2019-12-07 13:37:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:20,043 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1715 transitions. [2019-12-07 13:37:20,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:37:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1715 transitions. [2019-12-07 13:37:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:37:20,044 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:20,044 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] [2019-12-07 13:37:20,044 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:20,044 INFO L82 PathProgramCache]: Analyzing trace with hash -673987370, now seen corresponding path program 2 times [2019-12-07 13:37:20,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:20,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202850201] [2019-12-07 13:37:20,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:20,244 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:37:20,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202850201] [2019-12-07 13:37:20,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:20,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 13:37:20,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427299318] [2019-12-07 13:37:20,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:37:20,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:20,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:37:20,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:37:20,246 INFO L87 Difference]: Start difference. First operand 795 states and 1715 transitions. Second operand 13 states. [2019-12-07 13:37:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:22,287 INFO L93 Difference]: Finished difference Result 1306 states and 2759 transitions. [2019-12-07 13:37:22,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 13:37:22,288 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-07 13:37:22,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:22,309 INFO L225 Difference]: With dead ends: 1306 [2019-12-07 13:37:22,309 INFO L226 Difference]: Without dead ends: 787 [2019-12-07 13:37:22,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-12-07 13:37:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-12-07 13:37:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 778. [2019-12-07 13:37:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-12-07 13:37:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1672 transitions. [2019-12-07 13:37:22,316 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1672 transitions. Word has length 52 [2019-12-07 13:37:22,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:22,316 INFO L462 AbstractCegarLoop]: Abstraction has 778 states and 1672 transitions. [2019-12-07 13:37:22,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:37:22,316 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1672 transitions. [2019-12-07 13:37:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:37:22,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:22,317 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] [2019-12-07 13:37:22,317 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:22,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:22,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2049440756, now seen corresponding path program 3 times [2019-12-07 13:37:22,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:22,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11591463] [2019-12-07 13:37:22,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:22,369 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:37:22,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11591463] [2019-12-07 13:37:22,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:22,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:37:22,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600122967] [2019-12-07 13:37:22,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:37:22,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:37:22,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:37:22,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:37:22,370 INFO L87 Difference]: Start difference. First operand 778 states and 1672 transitions. Second operand 7 states. [2019-12-07 13:37:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:22,476 INFO L93 Difference]: Finished difference Result 1371 states and 2869 transitions. [2019-12-07 13:37:22,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:37:22,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 13:37:22,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:22,477 INFO L225 Difference]: With dead ends: 1371 [2019-12-07 13:37:22,477 INFO L226 Difference]: Without dead ends: 945 [2019-12-07 13:37:22,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:37:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-07 13:37:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 789. [2019-12-07 13:37:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-07 13:37:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-12-07 13:37:22,485 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 52 [2019-12-07 13:37:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:22,485 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-12-07 13:37:22,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:37:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-12-07 13:37:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:37:22,486 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:22,486 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] [2019-12-07 13:37:22,486 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:22,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:22,486 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 4 times [2019-12-07 13:37:22,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:37:22,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269830979] [2019-12-07 13:37:22,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:37:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:37:22,548 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:37:22,549 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:37:22,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27|) |v_ULTIMATE.start_main_~#t315~0.offset_19| 0))) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t315~0.base_27| 4)) (< 0 |v_#StackHeapBarrier_15|) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27| 1)) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27|) 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= 0 |v_ULTIMATE.start_main_~#t315~0.offset_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t315~0.base_27|) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t315~0.offset=|v_ULTIMATE.start_main_~#t315~0.offset_19|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t315~0.base=|v_ULTIMATE.start_main_~#t315~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t315~0.offset, ULTIMATE.start_main_~#t316~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t315~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t316~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:37:22,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t316~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t316~0.base_10|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10|) |v_ULTIMATE.start_main_~#t316~0.offset_9| 1)) |v_#memory_int_5|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t316~0.base_10| 4)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t316~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t316~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t316~0.offset] because there is no mapped edge [2019-12-07 13:37:22,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~x~0_In-673495934 ~__unbuffered_p0_EAX~0_Out-673495934) (= 1 ~y$r_buff0_thd1~0_Out-673495934) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-673495934)) (= ~y$r_buff0_thd1~0_In-673495934 ~y$r_buff1_thd1~0_Out-673495934) (= ~y$r_buff1_thd0~0_Out-673495934 ~y$r_buff0_thd0~0_In-673495934) (= ~y$r_buff1_thd2~0_Out-673495934 ~y$r_buff0_thd2~0_In-673495934)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-673495934, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-673495934, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-673495934, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-673495934, ~x~0=~x~0_In-673495934} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-673495934, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-673495934, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-673495934, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-673495934, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-673495934, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-673495934, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-673495934, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-673495934, ~x~0=~x~0_In-673495934} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:37:22,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-798082506 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-798082506 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-798082506| ~y$w_buff0_used~0_In-798082506)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-798082506| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-798082506, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-798082506} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-798082506|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-798082506, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-798082506} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:37:22,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-123522753 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-123522753 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-123522753 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-123522753 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-123522753| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-123522753| ~y$w_buff1_used~0_In-123522753) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-123522753, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-123522753, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-123522753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-123522753} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-123522753|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-123522753, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-123522753, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-123522753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-123522753} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:37:22,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1033131800 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1033131800 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out1033131800 ~y$r_buff0_thd1~0_In1033131800))) (or (and (= 0 ~y$r_buff0_thd1~0_Out1033131800) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1033131800, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1033131800} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1033131800, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1033131800|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1033131800} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:37:22,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-1993186870 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1993186870 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1993186870 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1993186870 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1993186870| ~y$r_buff1_thd1~0_In-1993186870)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1993186870| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1993186870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1993186870, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1993186870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1993186870} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1993186870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1993186870, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1993186870|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1993186870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1993186870} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:37:22,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:37:22,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1984983921 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out1984983921| ~y$w_buff1~0_In1984983921) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In1984983921| |P1Thread1of1ForFork1_#t~ite17_Out1984983921|)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out1984983921| |P1Thread1of1ForFork1_#t~ite18_Out1984983921|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1984983921 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1984983921 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1984983921 256))) (= (mod ~y$w_buff0_used~0_In1984983921 256) 0))) (= |P1Thread1of1ForFork1_#t~ite17_Out1984983921| ~y$w_buff1~0_In1984983921)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1984983921, ~y$w_buff1~0=~y$w_buff1~0_In1984983921, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1984983921, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1984983921, ~weak$$choice2~0=~weak$$choice2~0_In1984983921, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1984983921|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1984983921} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1984983921, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1984983921|, ~y$w_buff1~0=~y$w_buff1~0_In1984983921, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1984983921, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1984983921, ~weak$$choice2~0=~weak$$choice2~0_In1984983921, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1984983921|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1984983921} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 13:37:22,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1818166045 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In1818166045| |P1Thread1of1ForFork1_#t~ite20_Out1818166045|) (= |P1Thread1of1ForFork1_#t~ite21_Out1818166045| ~y$w_buff0_used~0_In1818166045) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out1818166045| |P1Thread1of1ForFork1_#t~ite20_Out1818166045|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1818166045 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In1818166045 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In1818166045 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1818166045 256)))) (= ~y$w_buff0_used~0_In1818166045 |P1Thread1of1ForFork1_#t~ite20_Out1818166045|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1818166045, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1818166045, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1818166045|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1818166045, ~weak$$choice2~0=~weak$$choice2~0_In1818166045, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1818166045} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1818166045, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1818166045, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1818166045|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1818166045, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1818166045|, ~weak$$choice2~0=~weak$$choice2~0_In1818166045, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1818166045} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:37:22,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out-1647512376| |P1Thread1of1ForFork1_#t~ite23_Out-1647512376|)) (.cse5 (= (mod ~weak$$choice2~0_In-1647512376 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1647512376 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1647512376 256) 0)) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-1647512376 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1647512376 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-1647512376| |P1Thread1of1ForFork1_#t~ite22_Out-1647512376|) (or (and .cse0 (= ~y$w_buff1_used~0_In-1647512376 |P1Thread1of1ForFork1_#t~ite23_Out-1647512376|) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) .cse5) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1647512376| |P1Thread1of1ForFork1_#t~ite23_In-1647512376|) (= ~y$w_buff1_used~0_In-1647512376 |P1Thread1of1ForFork1_#t~ite24_Out-1647512376|) (not .cse5)))) (let ((.cse6 (not .cse2))) (and (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1647512376|) .cse0 .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-1647512376| |P1Thread1of1ForFork1_#t~ite22_Out-1647512376|) (or (not .cse1) .cse6) (not .cse3) (or .cse6 (not .cse4)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1647512376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1647512376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1647512376, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1647512376|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1647512376|, ~weak$$choice2~0=~weak$$choice2~0_In-1647512376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1647512376} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1647512376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1647512376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1647512376, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1647512376|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1647512376|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1647512376|, ~weak$$choice2~0=~weak$$choice2~0_In-1647512376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1647512376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 13:37:22,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:37:22,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In205840067 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In205840067| |P1Thread1of1ForFork1_#t~ite28_Out205840067|) (= |P1Thread1of1ForFork1_#t~ite29_In205840067| |P1Thread1of1ForFork1_#t~ite29_Out205840067|) (= |P1Thread1of1ForFork1_#t~ite30_Out205840067| ~y$r_buff1_thd2~0_In205840067) (not .cse0)) (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In205840067 256))))) (and (not (= 0 (mod ~y$w_buff0_used~0_In205840067 256))) (or (not (= 0 (mod ~y$w_buff1_used~0_In205840067 256))) .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out205840067| 0) (= |P1Thread1of1ForFork1_#t~ite29_Out205840067| |P1Thread1of1ForFork1_#t~ite28_Out205840067|) (= |P1Thread1of1ForFork1_#t~ite29_Out205840067| |P1Thread1of1ForFork1_#t~ite30_Out205840067|) (or (not (= (mod ~y$r_buff1_thd2~0_In205840067 256) 0)) .cse1) .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In205840067, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In205840067|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In205840067, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In205840067, ~weak$$choice2~0=~weak$$choice2~0_In205840067, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In205840067|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In205840067} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In205840067, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out205840067|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out205840067|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In205840067, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In205840067, ~weak$$choice2~0=~weak$$choice2~0_In205840067, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out205840067|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In205840067} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 13:37:22,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 13:37:22,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-651471138 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-651471138 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-651471138| |P1Thread1of1ForFork1_#t~ite32_Out-651471138|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-651471138 |P1Thread1of1ForFork1_#t~ite32_Out-651471138|) .cse1 (not .cse2)) (and (= ~y~0_In-651471138 |P1Thread1of1ForFork1_#t~ite32_Out-651471138|) (or .cse2 .cse0) .cse1))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-651471138, ~y$w_buff1~0=~y$w_buff1~0_In-651471138, ~y~0=~y~0_In-651471138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-651471138} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-651471138, ~y$w_buff1~0=~y$w_buff1~0_In-651471138, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-651471138|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-651471138|, ~y~0=~y~0_In-651471138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-651471138} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 13:37:22,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In489448814 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In489448814 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out489448814| ~y$w_buff0_used~0_In489448814) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out489448814| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In489448814, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In489448814} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In489448814, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In489448814, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out489448814|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:37:22,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-2132354808 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-2132354808 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-2132354808 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-2132354808 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-2132354808| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-2132354808| ~y$w_buff1_used~0_In-2132354808) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2132354808, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132354808, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2132354808, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132354808} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2132354808, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132354808, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2132354808, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2132354808|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132354808} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:37:22,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1450841830 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1450841830 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1450841830| ~y$r_buff0_thd2~0_In-1450841830)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1450841830| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1450841830, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1450841830} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1450841830, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1450841830, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1450841830|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:37:22,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In691218438 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In691218438 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In691218438 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In691218438 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In691218438 |P1Thread1of1ForFork1_#t~ite37_Out691218438|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out691218438|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In691218438, ~y$w_buff0_used~0=~y$w_buff0_used~0_In691218438, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In691218438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In691218438} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In691218438, ~y$w_buff0_used~0=~y$w_buff0_used~0_In691218438, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In691218438, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out691218438|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In691218438} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:37:22,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:37:22,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 13:37:22,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2145590889 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-2145590889 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-2145590889 |ULTIMATE.start_main_#t~ite40_Out-2145590889|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-2145590889| ~y$w_buff1~0_In-2145590889) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2145590889, ~y~0=~y~0_In-2145590889, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2145590889, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2145590889} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2145590889|, ~y$w_buff1~0=~y$w_buff1~0_In-2145590889, ~y~0=~y~0_In-2145590889, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2145590889, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2145590889} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:37:22,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 13:37:22,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-644070067 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-644070067 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-644070067|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-644070067 |ULTIMATE.start_main_#t~ite42_Out-644070067|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-644070067, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-644070067} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-644070067, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-644070067, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-644070067|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:37:22,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1790488833 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1790488833 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1790488833 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1790488833 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1790488833 |ULTIMATE.start_main_#t~ite43_Out1790488833|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1790488833|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1790488833, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1790488833, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1790488833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1790488833} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1790488833, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1790488833, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1790488833|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1790488833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1790488833} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:37:22,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-473479283 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-473479283 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-473479283|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-473479283 |ULTIMATE.start_main_#t~ite44_Out-473479283|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-473479283, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-473479283} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-473479283, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-473479283, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-473479283|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:37:22,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1194020017 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1194020017 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1194020017 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1194020017 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1194020017 |ULTIMATE.start_main_#t~ite45_Out1194020017|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1194020017|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1194020017, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1194020017, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1194020017, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1194020017} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1194020017, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1194020017, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1194020017, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1194020017|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1194020017} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:37:22,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:37:22,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:37:22 BasicIcfg [2019-12-07 13:37:22,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:37:22,598 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:37:22,598 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:37:22,598 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:37:22,598 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:37:11" (3/4) ... [2019-12-07 13:37:22,600 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:37:22,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27|) |v_ULTIMATE.start_main_~#t315~0.offset_19| 0))) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t315~0.base_27| 4)) (< 0 |v_#StackHeapBarrier_15|) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27| 1)) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27|) 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= 0 |v_ULTIMATE.start_main_~#t315~0.offset_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t315~0.base_27|) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t315~0.offset=|v_ULTIMATE.start_main_~#t315~0.offset_19|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t315~0.base=|v_ULTIMATE.start_main_~#t315~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t315~0.offset, ULTIMATE.start_main_~#t316~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t315~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t316~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:37:22,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t316~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t316~0.base_10|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10|) |v_ULTIMATE.start_main_~#t316~0.offset_9| 1)) |v_#memory_int_5|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t316~0.base_10| 4)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t316~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t316~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t316~0.offset] because there is no mapped edge [2019-12-07 13:37:22,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~x~0_In-673495934 ~__unbuffered_p0_EAX~0_Out-673495934) (= 1 ~y$r_buff0_thd1~0_Out-673495934) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-673495934)) (= ~y$r_buff0_thd1~0_In-673495934 ~y$r_buff1_thd1~0_Out-673495934) (= ~y$r_buff1_thd0~0_Out-673495934 ~y$r_buff0_thd0~0_In-673495934) (= ~y$r_buff1_thd2~0_Out-673495934 ~y$r_buff0_thd2~0_In-673495934)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-673495934, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-673495934, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-673495934, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-673495934, ~x~0=~x~0_In-673495934} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-673495934, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-673495934, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-673495934, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-673495934, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-673495934, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-673495934, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-673495934, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-673495934, ~x~0=~x~0_In-673495934} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:37:22,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-798082506 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-798082506 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-798082506| ~y$w_buff0_used~0_In-798082506)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-798082506| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-798082506, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-798082506} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-798082506|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-798082506, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-798082506} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:37:22,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-123522753 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-123522753 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-123522753 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-123522753 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-123522753| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-123522753| ~y$w_buff1_used~0_In-123522753) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-123522753, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-123522753, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-123522753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-123522753} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-123522753|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-123522753, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-123522753, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-123522753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-123522753} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:37:22,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1033131800 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1033131800 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out1033131800 ~y$r_buff0_thd1~0_In1033131800))) (or (and (= 0 ~y$r_buff0_thd1~0_Out1033131800) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1033131800, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1033131800} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1033131800, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1033131800|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1033131800} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:37:22,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-1993186870 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1993186870 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1993186870 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1993186870 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1993186870| ~y$r_buff1_thd1~0_In-1993186870)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1993186870| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1993186870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1993186870, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1993186870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1993186870} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1993186870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1993186870, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1993186870|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1993186870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1993186870} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:37:22,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:37:22,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1984983921 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out1984983921| ~y$w_buff1~0_In1984983921) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In1984983921| |P1Thread1of1ForFork1_#t~ite17_Out1984983921|)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out1984983921| |P1Thread1of1ForFork1_#t~ite18_Out1984983921|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1984983921 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1984983921 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1984983921 256))) (= (mod ~y$w_buff0_used~0_In1984983921 256) 0))) (= |P1Thread1of1ForFork1_#t~ite17_Out1984983921| ~y$w_buff1~0_In1984983921)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1984983921, ~y$w_buff1~0=~y$w_buff1~0_In1984983921, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1984983921, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1984983921, ~weak$$choice2~0=~weak$$choice2~0_In1984983921, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1984983921|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1984983921} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1984983921, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1984983921|, ~y$w_buff1~0=~y$w_buff1~0_In1984983921, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1984983921, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1984983921, ~weak$$choice2~0=~weak$$choice2~0_In1984983921, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1984983921|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1984983921} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 13:37:22,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1818166045 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In1818166045| |P1Thread1of1ForFork1_#t~ite20_Out1818166045|) (= |P1Thread1of1ForFork1_#t~ite21_Out1818166045| ~y$w_buff0_used~0_In1818166045) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out1818166045| |P1Thread1of1ForFork1_#t~ite20_Out1818166045|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1818166045 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In1818166045 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In1818166045 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1818166045 256)))) (= ~y$w_buff0_used~0_In1818166045 |P1Thread1of1ForFork1_#t~ite20_Out1818166045|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1818166045, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1818166045, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1818166045|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1818166045, ~weak$$choice2~0=~weak$$choice2~0_In1818166045, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1818166045} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1818166045, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1818166045, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1818166045|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1818166045, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1818166045|, ~weak$$choice2~0=~weak$$choice2~0_In1818166045, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1818166045} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:37:22,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out-1647512376| |P1Thread1of1ForFork1_#t~ite23_Out-1647512376|)) (.cse5 (= (mod ~weak$$choice2~0_In-1647512376 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1647512376 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1647512376 256) 0)) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-1647512376 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1647512376 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-1647512376| |P1Thread1of1ForFork1_#t~ite22_Out-1647512376|) (or (and .cse0 (= ~y$w_buff1_used~0_In-1647512376 |P1Thread1of1ForFork1_#t~ite23_Out-1647512376|) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) .cse5) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1647512376| |P1Thread1of1ForFork1_#t~ite23_In-1647512376|) (= ~y$w_buff1_used~0_In-1647512376 |P1Thread1of1ForFork1_#t~ite24_Out-1647512376|) (not .cse5)))) (let ((.cse6 (not .cse2))) (and (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1647512376|) .cse0 .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-1647512376| |P1Thread1of1ForFork1_#t~ite22_Out-1647512376|) (or (not .cse1) .cse6) (not .cse3) (or .cse6 (not .cse4)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1647512376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1647512376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1647512376, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1647512376|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1647512376|, ~weak$$choice2~0=~weak$$choice2~0_In-1647512376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1647512376} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1647512376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1647512376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1647512376, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1647512376|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1647512376|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1647512376|, ~weak$$choice2~0=~weak$$choice2~0_In-1647512376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1647512376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 13:37:22,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:37:22,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In205840067 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In205840067| |P1Thread1of1ForFork1_#t~ite28_Out205840067|) (= |P1Thread1of1ForFork1_#t~ite29_In205840067| |P1Thread1of1ForFork1_#t~ite29_Out205840067|) (= |P1Thread1of1ForFork1_#t~ite30_Out205840067| ~y$r_buff1_thd2~0_In205840067) (not .cse0)) (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In205840067 256))))) (and (not (= 0 (mod ~y$w_buff0_used~0_In205840067 256))) (or (not (= 0 (mod ~y$w_buff1_used~0_In205840067 256))) .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out205840067| 0) (= |P1Thread1of1ForFork1_#t~ite29_Out205840067| |P1Thread1of1ForFork1_#t~ite28_Out205840067|) (= |P1Thread1of1ForFork1_#t~ite29_Out205840067| |P1Thread1of1ForFork1_#t~ite30_Out205840067|) (or (not (= (mod ~y$r_buff1_thd2~0_In205840067 256) 0)) .cse1) .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In205840067, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In205840067|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In205840067, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In205840067, ~weak$$choice2~0=~weak$$choice2~0_In205840067, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In205840067|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In205840067} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In205840067, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out205840067|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out205840067|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In205840067, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In205840067, ~weak$$choice2~0=~weak$$choice2~0_In205840067, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out205840067|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In205840067} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 13:37:22,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 13:37:22,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-651471138 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-651471138 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-651471138| |P1Thread1of1ForFork1_#t~ite32_Out-651471138|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-651471138 |P1Thread1of1ForFork1_#t~ite32_Out-651471138|) .cse1 (not .cse2)) (and (= ~y~0_In-651471138 |P1Thread1of1ForFork1_#t~ite32_Out-651471138|) (or .cse2 .cse0) .cse1))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-651471138, ~y$w_buff1~0=~y$w_buff1~0_In-651471138, ~y~0=~y~0_In-651471138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-651471138} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-651471138, ~y$w_buff1~0=~y$w_buff1~0_In-651471138, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-651471138|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-651471138|, ~y~0=~y~0_In-651471138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-651471138} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 13:37:22,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In489448814 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In489448814 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out489448814| ~y$w_buff0_used~0_In489448814) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out489448814| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In489448814, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In489448814} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In489448814, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In489448814, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out489448814|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:37:22,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-2132354808 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-2132354808 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-2132354808 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-2132354808 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-2132354808| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-2132354808| ~y$w_buff1_used~0_In-2132354808) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2132354808, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132354808, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2132354808, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132354808} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2132354808, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132354808, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2132354808, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2132354808|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132354808} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:37:22,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1450841830 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1450841830 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1450841830| ~y$r_buff0_thd2~0_In-1450841830)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1450841830| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1450841830, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1450841830} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1450841830, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1450841830, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1450841830|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:37:22,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In691218438 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In691218438 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In691218438 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In691218438 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In691218438 |P1Thread1of1ForFork1_#t~ite37_Out691218438|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out691218438|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In691218438, ~y$w_buff0_used~0=~y$w_buff0_used~0_In691218438, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In691218438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In691218438} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In691218438, ~y$w_buff0_used~0=~y$w_buff0_used~0_In691218438, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In691218438, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out691218438|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In691218438} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:37:22,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:37:22,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 13:37:22,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2145590889 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-2145590889 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-2145590889 |ULTIMATE.start_main_#t~ite40_Out-2145590889|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-2145590889| ~y$w_buff1~0_In-2145590889) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2145590889, ~y~0=~y~0_In-2145590889, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2145590889, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2145590889} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2145590889|, ~y$w_buff1~0=~y$w_buff1~0_In-2145590889, ~y~0=~y~0_In-2145590889, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2145590889, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2145590889} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:37:22,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 13:37:22,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-644070067 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-644070067 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-644070067|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-644070067 |ULTIMATE.start_main_#t~ite42_Out-644070067|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-644070067, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-644070067} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-644070067, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-644070067, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-644070067|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:37:22,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1790488833 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1790488833 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1790488833 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1790488833 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1790488833 |ULTIMATE.start_main_#t~ite43_Out1790488833|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1790488833|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1790488833, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1790488833, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1790488833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1790488833} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1790488833, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1790488833, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1790488833|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1790488833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1790488833} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:37:22,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-473479283 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-473479283 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-473479283|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-473479283 |ULTIMATE.start_main_#t~ite44_Out-473479283|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-473479283, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-473479283} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-473479283, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-473479283, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-473479283|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:37:22,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1194020017 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1194020017 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1194020017 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1194020017 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1194020017 |ULTIMATE.start_main_#t~ite45_Out1194020017|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1194020017|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1194020017, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1194020017, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1194020017, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1194020017} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1194020017, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1194020017, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1194020017, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1194020017|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1194020017} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:37:22,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:37:22,655 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e0ccf098-4065-4122-8337-396c1a1b2322/bin/utaipan/witness.graphml [2019-12-07 13:37:22,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:37:22,656 INFO L168 Benchmark]: Toolchain (without parser) took 11599.43 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.6 MB). Free memory was 940.8 MB in the beginning and 1.2 GB in the end (delta: -260.9 MB). Peak memory consumption was 129.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:22,657 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:37:22,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -124.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:22,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.39 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:37:22,657 INFO L168 Benchmark]: Boogie Preprocessor took 24.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:37:22,658 INFO L168 Benchmark]: RCFGBuilder took 384.85 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:22,658 INFO L168 Benchmark]: TraceAbstraction took 10686.31 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 291.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -205.4 MB). Peak memory consumption was 86.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:22,658 INFO L168 Benchmark]: Witness Printer took 57.76 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:22,660 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -124.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.39 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 24.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 384.85 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10686.31 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 291.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -205.4 MB). Peak memory consumption was 86.1 MB. Max. memory is 11.5 GB. * Witness Printer took 57.76 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1796 SDtfs, 1921 SDslu, 4220 SDs, 0 SdLazy, 4060 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 23 SyntacticMatches, 14 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12203occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 7173 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 531 NumberOfCodeBlocks, 531 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 97306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...