./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_pso.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_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e635a02f2d7438928806d3267842b22f0deee00c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:59:04,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:59:04,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:59:04,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:59:04,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:59:04,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:59:04,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:59:04,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:59:04,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:59:04,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:59:04,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:59:04,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:59:04,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:59:04,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:59:04,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:59:04,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:59:04,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:59:04,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:59:04,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:59:04,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:59:04,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:59:04,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:59:04,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:59:04,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:59:04,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:59:04,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:59:04,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:59:04,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:59:04,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:59:04,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:59:04,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:59:04,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:59:04,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:59:04,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:59:04,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:59:04,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:59:04,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:59:04,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:59:04,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:59:04,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:59:04,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:59:04,070 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:59:04,080 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:59:04,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:59:04,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:59:04,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:59:04,081 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:59:04,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:59:04,081 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:59:04,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:59:04,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:59:04,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:59:04,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:59:04,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:59:04,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:59:04,082 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:59:04,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:59:04,082 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:59:04,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:59:04,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:59:04,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:59:04,083 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:59:04,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:59:04,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:59:04,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:59:04,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:59:04,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:59:04,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:59:04,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:59:04,084 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:59:04,084 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:59:04,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer 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 -> Automizer 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 -> e635a02f2d7438928806d3267842b22f0deee00c [2019-12-07 12:59:04,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:59:04,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:59:04,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:59:04,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:59:04,195 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:59:04,196 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix042_pso.opt.i [2019-12-07 12:59:04,237 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer/data/59eb936c5/f09b959ed38c46afa54b3841a2b7e732/FLAGec1b0d127 [2019-12-07 12:59:04,693 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:59:04,694 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/sv-benchmarks/c/pthread-wmm/mix042_pso.opt.i [2019-12-07 12:59:04,704 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer/data/59eb936c5/f09b959ed38c46afa54b3841a2b7e732/FLAGec1b0d127 [2019-12-07 12:59:04,713 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer/data/59eb936c5/f09b959ed38c46afa54b3841a2b7e732 [2019-12-07 12:59:04,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:59:04,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:59:04,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:59:04,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:59:04,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:59:04,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:59:04" (1/1) ... [2019-12-07 12:59:04,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ef89d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:04, skipping insertion in model container [2019-12-07 12:59:04,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:59:04" (1/1) ... [2019-12-07 12:59:04,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:59:04,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:59:04,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:59:05,007 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:59:05,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:59:05,096 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:59:05,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:05 WrapperNode [2019-12-07 12:59:05,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:59:05,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:59:05,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:59:05,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:59:05,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:05" (1/1) ... [2019-12-07 12:59:05,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:05" (1/1) ... [2019-12-07 12:59:05,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:59:05,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:59:05,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:59:05,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:59:05,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:05" (1/1) ... [2019-12-07 12:59:05,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:05" (1/1) ... [2019-12-07 12:59:05,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:05" (1/1) ... [2019-12-07 12:59:05,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:05" (1/1) ... [2019-12-07 12:59:05,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:05" (1/1) ... [2019-12-07 12:59:05,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:05" (1/1) ... [2019-12-07 12:59:05,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:05" (1/1) ... [2019-12-07 12:59:05,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:59:05,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:59:05,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:59:05,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:59:05,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer/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 12:59:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:59:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:59:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:59:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:59:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:59:05,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:59:05,205 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:59:05,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:59:05,205 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:59:05,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:59:05,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:59:05,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:59:05,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:59:05,206 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:59:05,545 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:59:05,545 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:59:05,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:59:05 BoogieIcfgContainer [2019-12-07 12:59:05,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:59:05,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:59:05,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:59:05,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:59:05,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:59:04" (1/3) ... [2019-12-07 12:59:05,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390e4fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:59:05, skipping insertion in model container [2019-12-07 12:59:05,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:05" (2/3) ... [2019-12-07 12:59:05,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390e4fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:59:05, skipping insertion in model container [2019-12-07 12:59:05,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:59:05" (3/3) ... [2019-12-07 12:59:05,550 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt.i [2019-12-07 12:59:05,556 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:59:05,556 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:59:05,561 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:59:05,562 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:59:05,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,584 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,584 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,590 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,590 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,590 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,591 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,591 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:05,610 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 12:59:05,627 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:59:05,627 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:59:05,627 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:59:05,627 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:59:05,627 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:59:05,627 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:59:05,627 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:59:05,627 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:59:05,638 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-07 12:59:05,640 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-07 12:59:05,689 INFO L134 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-07 12:59:05,689 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:59:05,697 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 476 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 12:59:05,709 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-07 12:59:05,735 INFO L134 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-07 12:59:05,735 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:59:05,739 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 476 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 12:59:05,748 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-07 12:59:05,749 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:59:08,499 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 12:59:08,590 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-07 12:59:08,590 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-07 12:59:08,592 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-07 12:59:09,213 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-07 12:59:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-07 12:59:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:59:09,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:09,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:09,220 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:09,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:09,223 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-07 12:59:09,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:09,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342347491] [2019-12-07 12:59:09,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:09,381 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 12:59:09,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342347491] [2019-12-07 12:59:09,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:09,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:59:09,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581260467] [2019-12-07 12:59:09,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:09,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:09,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:09,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:09,397 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-07 12:59:09,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:09,612 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-07 12:59:09,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:09,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 12:59:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:09,716 INFO L225 Difference]: With dead ends: 14182 [2019-12-07 12:59:09,716 INFO L226 Difference]: Without dead ends: 13870 [2019-12-07 12:59:09,717 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 12:59:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-07 12:59:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-07 12:59:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-07 12:59:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-07 12:59:10,218 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-07 12:59:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:10,219 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-07 12:59:10,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-07 12:59:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:59:10,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:10,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:10,224 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-07 12:59:10,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:10,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733176929] [2019-12-07 12:59:10,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:10,306 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 12:59:10,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733176929] [2019-12-07 12:59:10,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:10,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:59:10,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78587996] [2019-12-07 12:59:10,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:10,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:10,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:10,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:10,309 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-07 12:59:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:10,571 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-07 12:59:10,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:59:10,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:59:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:10,659 INFO L225 Difference]: With dead ends: 19034 [2019-12-07 12:59:10,660 INFO L226 Difference]: Without dead ends: 19034 [2019-12-07 12:59:10,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-07 12:59:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-07 12:59:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-07 12:59:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-07 12:59:11,121 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-07 12:59:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:11,122 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-07 12:59:11,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-07 12:59:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:59:11,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:11,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:11,125 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-07 12:59:11,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:11,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847135269] [2019-12-07 12:59:11,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:11,168 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 12:59:11,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847135269] [2019-12-07 12:59:11,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:11,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:59:11,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714810174] [2019-12-07 12:59:11,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:11,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:11,169 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 4 states. [2019-12-07 12:59:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:11,409 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-07 12:59:11,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:59:11,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:59:11,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:11,474 INFO L225 Difference]: With dead ends: 27022 [2019-12-07 12:59:11,475 INFO L226 Difference]: Without dead ends: 27008 [2019-12-07 12:59:11,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-07 12:59:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-07 12:59:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-07 12:59:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-07 12:59:11,984 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-07 12:59:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:11,984 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-07 12:59:11,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-07 12:59:11,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:59:11,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:11,989 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:11,989 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:11,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:11,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-07 12:59:11,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:11,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545377572] [2019-12-07 12:59:11,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:12,050 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 12:59:12,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545377572] [2019-12-07 12:59:12,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:12,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:12,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923833539] [2019-12-07 12:59:12,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:59:12,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:12,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:59:12,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:12,052 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 5 states. [2019-12-07 12:59:12,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:12,374 INFO L93 Difference]: Finished difference Result 30132 states and 106959 transitions. [2019-12-07 12:59:12,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:59:12,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 12:59:12,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:12,429 INFO L225 Difference]: With dead ends: 30132 [2019-12-07 12:59:12,429 INFO L226 Difference]: Without dead ends: 30118 [2019-12-07 12:59:12,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:59:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30118 states. [2019-12-07 12:59:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30118 to 22270. [2019-12-07 12:59:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22270 states. [2019-12-07 12:59:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22270 states to 22270 states and 80486 transitions. [2019-12-07 12:59:12,981 INFO L78 Accepts]: Start accepts. Automaton has 22270 states and 80486 transitions. Word has length 19 [2019-12-07 12:59:12,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:12,981 INFO L462 AbstractCegarLoop]: Abstraction has 22270 states and 80486 transitions. [2019-12-07 12:59:12,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:59:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 22270 states and 80486 transitions. [2019-12-07 12:59:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:59:12,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:12,997 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 12:59:12,997 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:12,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:12,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023153, now seen corresponding path program 1 times [2019-12-07 12:59:12,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:12,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402749114] [2019-12-07 12:59:12,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:13,049 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 12:59:13,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402749114] [2019-12-07 12:59:13,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:13,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:13,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603587129] [2019-12-07 12:59:13,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:13,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:13,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:13,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:13,050 INFO L87 Difference]: Start difference. First operand 22270 states and 80486 transitions. Second operand 4 states. [2019-12-07 12:59:13,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:13,099 INFO L93 Difference]: Finished difference Result 13342 states and 41523 transitions. [2019-12-07 12:59:13,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:13,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 12:59:13,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:13,115 INFO L225 Difference]: With dead ends: 13342 [2019-12-07 12:59:13,115 INFO L226 Difference]: Without dead ends: 12812 [2019-12-07 12:59:13,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12812 states. [2019-12-07 12:59:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12812 to 12812. [2019-12-07 12:59:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12812 states. [2019-12-07 12:59:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12812 states to 12812 states and 40017 transitions. [2019-12-07 12:59:13,305 INFO L78 Accepts]: Start accepts. Automaton has 12812 states and 40017 transitions. Word has length 27 [2019-12-07 12:59:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:13,305 INFO L462 AbstractCegarLoop]: Abstraction has 12812 states and 40017 transitions. [2019-12-07 12:59:13,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 12812 states and 40017 transitions. [2019-12-07 12:59:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:59:13,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:13,311 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] [2019-12-07 12:59:13,311 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:13,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1806206056, now seen corresponding path program 1 times [2019-12-07 12:59:13,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:13,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390455102] [2019-12-07 12:59:13,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:13,362 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 12:59:13,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390455102] [2019-12-07 12:59:13,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:13,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:13,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589824752] [2019-12-07 12:59:13,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:59:13,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:13,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:59:13,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:13,363 INFO L87 Difference]: Start difference. First operand 12812 states and 40017 transitions. Second operand 5 states. [2019-12-07 12:59:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:13,404 INFO L93 Difference]: Finished difference Result 2336 states and 5507 transitions. [2019-12-07 12:59:13,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:59:13,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 12:59:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:13,406 INFO L225 Difference]: With dead ends: 2336 [2019-12-07 12:59:13,407 INFO L226 Difference]: Without dead ends: 2027 [2019-12-07 12:59:13,407 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 12:59:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-12-07 12:59:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2027. [2019-12-07 12:59:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-12-07 12:59:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 4646 transitions. [2019-12-07 12:59:13,432 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 4646 transitions. Word has length 28 [2019-12-07 12:59:13,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:13,433 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 4646 transitions. [2019-12-07 12:59:13,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:59:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 4646 transitions. [2019-12-07 12:59:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 12:59:13,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:13,436 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] [2019-12-07 12:59:13,436 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:13,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1654876811, now seen corresponding path program 1 times [2019-12-07 12:59:13,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:13,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577261280] [2019-12-07 12:59:13,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:13,511 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 12:59:13,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577261280] [2019-12-07 12:59:13,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:13,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:59:13,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101431357] [2019-12-07 12:59:13,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:59:13,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:13,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:59:13,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:59:13,513 INFO L87 Difference]: Start difference. First operand 2027 states and 4646 transitions. Second operand 6 states. [2019-12-07 12:59:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:13,561 INFO L93 Difference]: Finished difference Result 690 states and 1578 transitions. [2019-12-07 12:59:13,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:59:13,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 12:59:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:13,562 INFO L225 Difference]: With dead ends: 690 [2019-12-07 12:59:13,562 INFO L226 Difference]: Without dead ends: 644 [2019-12-07 12:59:13,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:59:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-07 12:59:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 588. [2019-12-07 12:59:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-07 12:59:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1356 transitions. [2019-12-07 12:59:13,568 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1356 transitions. Word has length 40 [2019-12-07 12:59:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:13,568 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1356 transitions. [2019-12-07 12:59:13,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:59:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1356 transitions. [2019-12-07 12:59:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:59:13,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:13,570 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:13,570 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash 149828223, now seen corresponding path program 1 times [2019-12-07 12:59:13,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:13,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460578190] [2019-12-07 12:59:13,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:13,608 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 12:59:13,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460578190] [2019-12-07 12:59:13,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:13,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:13,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454700302] [2019-12-07 12:59:13,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:13,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:13,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:13,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:13,610 INFO L87 Difference]: Start difference. First operand 588 states and 1356 transitions. Second operand 3 states. [2019-12-07 12:59:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:13,635 INFO L93 Difference]: Finished difference Result 602 states and 1375 transitions. [2019-12-07 12:59:13,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:13,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 12:59:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:13,636 INFO L225 Difference]: With dead ends: 602 [2019-12-07 12:59:13,636 INFO L226 Difference]: Without dead ends: 602 [2019-12-07 12:59:13,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-12-07 12:59:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 596. [2019-12-07 12:59:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-07 12:59:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1368 transitions. [2019-12-07 12:59:13,641 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1368 transitions. Word has length 55 [2019-12-07 12:59:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:13,642 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1368 transitions. [2019-12-07 12:59:13,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1368 transitions. [2019-12-07 12:59:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:59:13,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:13,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:13,643 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:13,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:13,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1719525699, now seen corresponding path program 1 times [2019-12-07 12:59:13,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:13,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196697447] [2019-12-07 12:59:13,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:13,745 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 12:59:13,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196697447] [2019-12-07 12:59:13,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:13,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:59:13,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185421076] [2019-12-07 12:59:13,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:59:13,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:13,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:59:13,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:13,746 INFO L87 Difference]: Start difference. First operand 596 states and 1368 transitions. Second operand 5 states. [2019-12-07 12:59:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:13,881 INFO L93 Difference]: Finished difference Result 867 states and 1997 transitions. [2019-12-07 12:59:13,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:59:13,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-07 12:59:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:13,882 INFO L225 Difference]: With dead ends: 867 [2019-12-07 12:59:13,882 INFO L226 Difference]: Without dead ends: 867 [2019-12-07 12:59:13,883 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 12:59:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-12-07 12:59:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 789. [2019-12-07 12:59:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-07 12:59:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1820 transitions. [2019-12-07 12:59:13,890 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1820 transitions. Word has length 55 [2019-12-07 12:59:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:13,890 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1820 transitions. [2019-12-07 12:59:13,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:59:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1820 transitions. [2019-12-07 12:59:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:59:13,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:13,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:13,891 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:13,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1740404695, now seen corresponding path program 2 times [2019-12-07 12:59:13,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:13,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580777056] [2019-12-07 12:59:13,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:13,932 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 12:59:13,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580777056] [2019-12-07 12:59:13,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:13,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:59:13,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931560119] [2019-12-07 12:59:13,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:13,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:13,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:13,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:13,934 INFO L87 Difference]: Start difference. First operand 789 states and 1820 transitions. Second operand 3 states. [2019-12-07 12:59:13,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:13,964 INFO L93 Difference]: Finished difference Result 789 states and 1819 transitions. [2019-12-07 12:59:13,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:13,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 12:59:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:13,965 INFO L225 Difference]: With dead ends: 789 [2019-12-07 12:59:13,965 INFO L226 Difference]: Without dead ends: 789 [2019-12-07 12:59:13,965 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 12:59:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-07 12:59:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 632. [2019-12-07 12:59:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-12-07 12:59:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1459 transitions. [2019-12-07 12:59:13,971 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1459 transitions. Word has length 55 [2019-12-07 12:59:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:13,971 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 1459 transitions. [2019-12-07 12:59:13,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1459 transitions. [2019-12-07 12:59:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 12:59:13,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:13,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:13,973 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:13,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 1 times [2019-12-07 12:59:13,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:13,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626822237] [2019-12-07 12:59:13,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:14,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 12:59:14,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626822237] [2019-12-07 12:59:14,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:14,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:59:14,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054768861] [2019-12-07 12:59:14,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:14,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:14,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:14,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:14,015 INFO L87 Difference]: Start difference. First operand 632 states and 1459 transitions. Second operand 3 states. [2019-12-07 12:59:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:14,025 INFO L93 Difference]: Finished difference Result 632 states and 1429 transitions. [2019-12-07 12:59:14,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:14,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 12:59:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:14,026 INFO L225 Difference]: With dead ends: 632 [2019-12-07 12:59:14,026 INFO L226 Difference]: Without dead ends: 632 [2019-12-07 12:59:14,026 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 12:59:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-12-07 12:59:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 596. [2019-12-07 12:59:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-07 12:59:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1343 transitions. [2019-12-07 12:59:14,031 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1343 transitions. Word has length 56 [2019-12-07 12:59:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:14,032 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1343 transitions. [2019-12-07 12:59:14,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1343 transitions. [2019-12-07 12:59:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 12:59:14,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:14,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:14,033 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:14,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-07 12:59:14,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:14,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661753509] [2019-12-07 12:59:14,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:14,128 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 12:59:14,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661753509] [2019-12-07 12:59:14,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:14,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:59:14,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287433853] [2019-12-07 12:59:14,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:59:14,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:59:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:14,130 INFO L87 Difference]: Start difference. First operand 596 states and 1343 transitions. Second operand 7 states. [2019-12-07 12:59:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:14,213 INFO L93 Difference]: Finished difference Result 940 states and 1992 transitions. [2019-12-07 12:59:14,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:59:14,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-07 12:59:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:14,214 INFO L225 Difference]: With dead ends: 940 [2019-12-07 12:59:14,214 INFO L226 Difference]: Without dead ends: 600 [2019-12-07 12:59:14,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:59:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-07 12:59:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2019-12-07 12:59:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-12-07 12:59:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1164 transitions. [2019-12-07 12:59:14,220 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1164 transitions. Word has length 57 [2019-12-07 12:59:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:14,220 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 1164 transitions. [2019-12-07 12:59:14,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:59:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1164 transitions. [2019-12-07 12:59:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 12:59:14,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:14,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:14,221 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:14,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:14,221 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-07 12:59:14,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:14,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836776324] [2019-12-07 12:59:14,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:14,422 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 12:59:14,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836776324] [2019-12-07 12:59:14,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:14,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 12:59:14,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068976823] [2019-12-07 12:59:14,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:59:14,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:14,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:59:14,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:59:14,423 INFO L87 Difference]: Start difference. First operand 534 states and 1164 transitions. Second operand 14 states. [2019-12-07 12:59:14,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:14,715 INFO L93 Difference]: Finished difference Result 842 states and 1834 transitions. [2019-12-07 12:59:14,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:59:14,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-07 12:59:14,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:14,716 INFO L225 Difference]: With dead ends: 842 [2019-12-07 12:59:14,716 INFO L226 Difference]: Without dead ends: 812 [2019-12-07 12:59:14,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-07 12:59:14,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-12-07 12:59:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 738. [2019-12-07 12:59:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-07 12:59:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1617 transitions. [2019-12-07 12:59:14,723 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1617 transitions. Word has length 57 [2019-12-07 12:59:14,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:14,723 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1617 transitions. [2019-12-07 12:59:14,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:59:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1617 transitions. [2019-12-07 12:59:14,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 12:59:14,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:14,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:14,725 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:14,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:14,725 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 3 times [2019-12-07 12:59:14,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:14,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349152145] [2019-12-07 12:59:14,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:59:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:59:14,797 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:59:14,797 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:59:14,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1114~0.base_27|) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27|) 0) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= 0 v_~y$r_buff1_thd2~0_113) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27|) |v_ULTIMATE.start_main_~#t1114~0.offset_21| 0)) |v_#memory_int_15|) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1114~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd1~0_41 0) (= 0 |v_ULTIMATE.start_main_~#t1114~0.offset_21|) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27| 1)) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1114~0.offset=|v_ULTIMATE.start_main_~#t1114~0.offset_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_21|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1114~0.base=|v_ULTIMATE.start_main_~#t1114~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1114~0.offset, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1115~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1116~0.base, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1114~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:59:14,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1115~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1115~0.base_9|) (= |v_ULTIMATE.start_main_~#t1115~0.offset_8| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1115~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9|) |v_ULTIMATE.start_main_~#t1115~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, #length, ULTIMATE.start_main_~#t1115~0.base] because there is no mapped edge [2019-12-07 12:59:14,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1116~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1116~0.offset_10| 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10|) |v_ULTIMATE.start_main_~#t1116~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1116~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1116~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1116~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-07 12:59:14,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~y$r_buff0_thd3~0_In987439265 ~y$r_buff1_thd3~0_Out987439265) (= ~__unbuffered_p2_EAX~0_Out987439265 ~z~0_Out987439265) (= ~z~0_Out987439265 1) (= ~y$r_buff1_thd0~0_Out987439265 ~y$r_buff0_thd0~0_In987439265) (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In987439265)) (= 1 ~y$r_buff0_thd3~0_Out987439265) (= ~y$r_buff0_thd1~0_In987439265 ~y$r_buff1_thd1~0_Out987439265) (= ~y$r_buff1_thd2~0_Out987439265 ~y$r_buff0_thd2~0_In987439265) (= ~a~0_In987439265 ~__unbuffered_p2_EBX~0_Out987439265)) InVars {~a~0=~a~0_In987439265, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In987439265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In987439265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In987439265, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In987439265, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In987439265} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out987439265, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In987439265, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out987439265, ~a~0=~a~0_In987439265, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out987439265, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out987439265, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out987439265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In987439265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In987439265, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In987439265, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out987439265, ~z~0=~z~0_Out987439265, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out987439265} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:59:14,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_8 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= v_P0Thread1of1ForFork2_~arg.offset_8 |v_P0Thread1of1ForFork2_#in~arg.offset_10|) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_8, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_8} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 12:59:14,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite4_Out-1115825823| |P1Thread1of1ForFork0_#t~ite3_Out-1115825823|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1115825823 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1115825823 256)))) (or (and .cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out-1115825823| ~y$w_buff1~0_In-1115825823) (not .cse1) (not .cse2)) (and .cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out-1115825823| ~y~0_In-1115825823) (or .cse2 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1115825823, ~y$w_buff1~0=~y$w_buff1~0_In-1115825823, ~y~0=~y~0_In-1115825823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1115825823} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1115825823, ~y$w_buff1~0=~y$w_buff1~0_In-1115825823, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-1115825823|, ~y~0=~y~0_In-1115825823, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-1115825823|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1115825823} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 12:59:14,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-325410773 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-325410773 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-325410773 |P2Thread1of1ForFork1_#t~ite11_Out-325410773|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_Out-325410773| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-325410773, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-325410773} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-325410773, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-325410773|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-325410773} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 12:59:14,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-287239492 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-287239492 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-287239492 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-287239492 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite12_Out-287239492| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite12_Out-287239492| ~y$w_buff1_used~0_In-287239492)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-287239492, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-287239492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-287239492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-287239492} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-287239492, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-287239492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-287239492, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-287239492|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-287239492} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 12:59:14,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1922361773 256))) (.cse2 (= ~y$r_buff0_thd3~0_In-1922361773 ~y$r_buff0_thd3~0_Out-1922361773)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1922361773 256) 0))) (or (and (= 0 ~y$r_buff0_thd3~0_Out-1922361773) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1922361773, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1922361773} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out-1922361773|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1922361773, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1922361773} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 12:59:14,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-606211616 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-606211616 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-606211616 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-606211616 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite14_Out-606211616|)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out-606211616| ~y$r_buff1_thd3~0_In-606211616) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-606211616, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-606211616, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-606211616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-606211616} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-606211616|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-606211616, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-606211616, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-606211616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-606211616} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 12:59:14,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P2Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_33|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 12:59:14,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1743825600 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1743825600 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1743825600 |P1Thread1of1ForFork0_#t~ite5_Out-1743825600|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out-1743825600|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1743825600, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1743825600} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1743825600, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1743825600, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-1743825600|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:59:14,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-1445778247 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1445778247 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1445778247 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1445778247 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite6_Out-1445778247| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite6_Out-1445778247| ~y$w_buff1_used~0_In-1445778247) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1445778247, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1445778247, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1445778247, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1445778247} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1445778247, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1445778247, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1445778247, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-1445778247|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1445778247} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:59:14,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-277404359 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-277404359 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite7_Out-277404359| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite7_Out-277404359| ~y$r_buff0_thd2~0_In-277404359) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-277404359, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-277404359} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-277404359, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-277404359, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-277404359|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 12:59:14,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In815701725 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In815701725 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In815701725 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In815701725 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite8_Out815701725|)) (and (= ~y$r_buff1_thd2~0_In815701725 |P1Thread1of1ForFork0_#t~ite8_Out815701725|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In815701725, ~y$w_buff0_used~0=~y$w_buff0_used~0_In815701725, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In815701725, ~y$w_buff1_used~0=~y$w_buff1_used~0_In815701725} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In815701725, ~y$w_buff0_used~0=~y$w_buff0_used~0_In815701725, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In815701725, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out815701725|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In815701725} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:59:14,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_36|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_35|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 12:59:14,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:59:14,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite19_Out-1426624021| |ULTIMATE.start_main_#t~ite18_Out-1426624021|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1426624021 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1426624021 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In-1426624021 |ULTIMATE.start_main_#t~ite18_Out-1426624021|)) (and .cse1 (or .cse2 .cse0) (= ~y~0_In-1426624021 |ULTIMATE.start_main_#t~ite18_Out-1426624021|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1426624021, ~y~0=~y~0_In-1426624021, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1426624021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1426624021} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1426624021, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1426624021|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1426624021|, ~y~0=~y~0_In-1426624021, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1426624021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1426624021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-07 12:59:14,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1385159130 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1385159130 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-1385159130|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out-1385159130| ~y$w_buff0_used~0_In-1385159130) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1385159130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1385159130} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1385159130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1385159130, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1385159130|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 12:59:14,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-199524041 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-199524041 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-199524041 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-199524041 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out-199524041| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite21_Out-199524041| ~y$w_buff1_used~0_In-199524041) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-199524041, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-199524041, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-199524041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-199524041} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-199524041, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-199524041, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-199524041|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-199524041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-199524041} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 12:59:14,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1294117240 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1294117240 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-1294117240| ~y$r_buff0_thd0~0_In-1294117240) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-1294117240| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1294117240, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1294117240} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1294117240, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1294117240, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1294117240|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 12:59:14,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1491142241 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1491142241 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1491142241 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1491142241 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out1491142241|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In1491142241 |ULTIMATE.start_main_#t~ite23_Out1491142241|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1491142241, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1491142241, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1491142241, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1491142241} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1491142241, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1491142241, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1491142241, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1491142241|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1491142241} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-07 12:59:14,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1149475360 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite29_In-1149475360| |ULTIMATE.start_main_#t~ite29_Out-1149475360|) (= |ULTIMATE.start_main_#t~ite30_Out-1149475360| ~y$w_buff0~0_In-1149475360)) (and .cse0 (= |ULTIMATE.start_main_#t~ite30_Out-1149475360| |ULTIMATE.start_main_#t~ite29_Out-1149475360|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1149475360 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1149475360 256))) (= 0 (mod ~y$w_buff0_used~0_In-1149475360 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1149475360 256) 0)))) (= ~y$w_buff0~0_In-1149475360 |ULTIMATE.start_main_#t~ite29_Out-1149475360|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1149475360, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1149475360|, ~y$w_buff0~0=~y$w_buff0~0_In-1149475360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1149475360, ~weak$$choice2~0=~weak$$choice2~0_In-1149475360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1149475360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149475360} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1149475360|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1149475360, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1149475360|, ~y$w_buff0~0=~y$w_buff0~0_In-1149475360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1149475360, ~weak$$choice2~0=~weak$$choice2~0_In-1149475360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1149475360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149475360} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 12:59:14,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-721210854 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite35_Out-721210854| |ULTIMATE.start_main_#t~ite36_Out-721210854|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-721210854 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-721210854 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-721210854 256)) (and (= 0 (mod ~y$r_buff1_thd0~0_In-721210854 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite35_Out-721210854| ~y$w_buff0_used~0_In-721210854)) (and (= |ULTIMATE.start_main_#t~ite36_Out-721210854| ~y$w_buff0_used~0_In-721210854) (= |ULTIMATE.start_main_#t~ite35_In-721210854| |ULTIMATE.start_main_#t~ite35_Out-721210854|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-721210854, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-721210854, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-721210854|, ~weak$$choice2~0=~weak$$choice2~0_In-721210854, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-721210854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-721210854} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-721210854, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-721210854, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-721210854|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-721210854|, ~weak$$choice2~0=~weak$$choice2~0_In-721210854, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-721210854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-721210854} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 12:59:14,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1086788616 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In1086788616| |ULTIMATE.start_main_#t~ite38_Out1086788616|) (= ~y$w_buff1_used~0_In1086788616 |ULTIMATE.start_main_#t~ite39_Out1086788616|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out1086788616| |ULTIMATE.start_main_#t~ite39_Out1086788616|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1086788616 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1086788616 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1086788616 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1086788616 256)) .cse1))) (= ~y$w_buff1_used~0_In1086788616 |ULTIMATE.start_main_#t~ite38_Out1086788616|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1086788616, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1086788616, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1086788616|, ~weak$$choice2~0=~weak$$choice2~0_In1086788616, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1086788616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1086788616} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1086788616, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1086788616|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1086788616, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1086788616|, ~weak$$choice2~0=~weak$$choice2~0_In1086788616, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1086788616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1086788616} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 12:59:14,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:59:14,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In320449282 256)))) (or (and (not .cse0) (= ~y$r_buff1_thd0~0_In320449282 |ULTIMATE.start_main_#t~ite45_Out320449282|) (= |ULTIMATE.start_main_#t~ite44_In320449282| |ULTIMATE.start_main_#t~ite44_Out320449282|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In320449282 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In320449282 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In320449282 256))) (= 0 (mod ~y$w_buff0_used~0_In320449282 256)))) .cse0 (= |ULTIMATE.start_main_#t~ite45_Out320449282| |ULTIMATE.start_main_#t~ite44_Out320449282|) (= ~y$r_buff1_thd0~0_In320449282 |ULTIMATE.start_main_#t~ite44_Out320449282|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In320449282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In320449282, ~weak$$choice2~0=~weak$$choice2~0_In320449282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In320449282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In320449282, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In320449282|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In320449282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In320449282, ~weak$$choice2~0=~weak$$choice2~0_In320449282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In320449282, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out320449282|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out320449282|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In320449282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:59:14,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:59:14,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 12:59:14,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:59:14 BasicIcfg [2019-12-07 12:59:14,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:59:14,853 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:59:14,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:59:14,853 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:59:14,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:59:05" (3/4) ... [2019-12-07 12:59:14,855 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:59:14,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1114~0.base_27|) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27|) 0) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= 0 v_~y$r_buff1_thd2~0_113) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27|) |v_ULTIMATE.start_main_~#t1114~0.offset_21| 0)) |v_#memory_int_15|) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1114~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd1~0_41 0) (= 0 |v_ULTIMATE.start_main_~#t1114~0.offset_21|) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27| 1)) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1114~0.offset=|v_ULTIMATE.start_main_~#t1114~0.offset_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_21|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1114~0.base=|v_ULTIMATE.start_main_~#t1114~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1114~0.offset, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1115~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1116~0.base, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1114~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:59:14,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1115~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1115~0.base_9|) (= |v_ULTIMATE.start_main_~#t1115~0.offset_8| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1115~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9|) |v_ULTIMATE.start_main_~#t1115~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, #length, ULTIMATE.start_main_~#t1115~0.base] because there is no mapped edge [2019-12-07 12:59:14,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1116~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1116~0.offset_10| 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10|) |v_ULTIMATE.start_main_~#t1116~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1116~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1116~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1116~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-07 12:59:14,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~y$r_buff0_thd3~0_In987439265 ~y$r_buff1_thd3~0_Out987439265) (= ~__unbuffered_p2_EAX~0_Out987439265 ~z~0_Out987439265) (= ~z~0_Out987439265 1) (= ~y$r_buff1_thd0~0_Out987439265 ~y$r_buff0_thd0~0_In987439265) (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In987439265)) (= 1 ~y$r_buff0_thd3~0_Out987439265) (= ~y$r_buff0_thd1~0_In987439265 ~y$r_buff1_thd1~0_Out987439265) (= ~y$r_buff1_thd2~0_Out987439265 ~y$r_buff0_thd2~0_In987439265) (= ~a~0_In987439265 ~__unbuffered_p2_EBX~0_Out987439265)) InVars {~a~0=~a~0_In987439265, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In987439265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In987439265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In987439265, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In987439265, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In987439265} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out987439265, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In987439265, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out987439265, ~a~0=~a~0_In987439265, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out987439265, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out987439265, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out987439265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In987439265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In987439265, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In987439265, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out987439265, ~z~0=~z~0_Out987439265, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out987439265} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:59:14,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_8 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= v_P0Thread1of1ForFork2_~arg.offset_8 |v_P0Thread1of1ForFork2_#in~arg.offset_10|) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_8, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_8} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 12:59:14,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite4_Out-1115825823| |P1Thread1of1ForFork0_#t~ite3_Out-1115825823|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1115825823 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1115825823 256)))) (or (and .cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out-1115825823| ~y$w_buff1~0_In-1115825823) (not .cse1) (not .cse2)) (and .cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out-1115825823| ~y~0_In-1115825823) (or .cse2 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1115825823, ~y$w_buff1~0=~y$w_buff1~0_In-1115825823, ~y~0=~y~0_In-1115825823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1115825823} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1115825823, ~y$w_buff1~0=~y$w_buff1~0_In-1115825823, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-1115825823|, ~y~0=~y~0_In-1115825823, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-1115825823|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1115825823} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 12:59:14,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-325410773 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-325410773 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-325410773 |P2Thread1of1ForFork1_#t~ite11_Out-325410773|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_Out-325410773| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-325410773, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-325410773} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-325410773, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-325410773|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-325410773} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 12:59:14,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-287239492 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-287239492 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-287239492 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-287239492 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite12_Out-287239492| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite12_Out-287239492| ~y$w_buff1_used~0_In-287239492)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-287239492, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-287239492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-287239492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-287239492} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-287239492, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-287239492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-287239492, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-287239492|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-287239492} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 12:59:14,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1922361773 256))) (.cse2 (= ~y$r_buff0_thd3~0_In-1922361773 ~y$r_buff0_thd3~0_Out-1922361773)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1922361773 256) 0))) (or (and (= 0 ~y$r_buff0_thd3~0_Out-1922361773) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1922361773, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1922361773} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out-1922361773|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1922361773, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1922361773} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 12:59:14,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-606211616 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-606211616 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-606211616 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-606211616 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite14_Out-606211616|)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out-606211616| ~y$r_buff1_thd3~0_In-606211616) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-606211616, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-606211616, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-606211616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-606211616} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-606211616|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-606211616, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-606211616, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-606211616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-606211616} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 12:59:14,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P2Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_33|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 12:59:14,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1743825600 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1743825600 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1743825600 |P1Thread1of1ForFork0_#t~ite5_Out-1743825600|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out-1743825600|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1743825600, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1743825600} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1743825600, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1743825600, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-1743825600|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:59:14,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-1445778247 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1445778247 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1445778247 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1445778247 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite6_Out-1445778247| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite6_Out-1445778247| ~y$w_buff1_used~0_In-1445778247) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1445778247, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1445778247, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1445778247, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1445778247} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1445778247, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1445778247, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1445778247, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-1445778247|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1445778247} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:59:14,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-277404359 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-277404359 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite7_Out-277404359| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite7_Out-277404359| ~y$r_buff0_thd2~0_In-277404359) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-277404359, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-277404359} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-277404359, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-277404359, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-277404359|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 12:59:14,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In815701725 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In815701725 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In815701725 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In815701725 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite8_Out815701725|)) (and (= ~y$r_buff1_thd2~0_In815701725 |P1Thread1of1ForFork0_#t~ite8_Out815701725|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In815701725, ~y$w_buff0_used~0=~y$w_buff0_used~0_In815701725, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In815701725, ~y$w_buff1_used~0=~y$w_buff1_used~0_In815701725} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In815701725, ~y$w_buff0_used~0=~y$w_buff0_used~0_In815701725, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In815701725, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out815701725|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In815701725} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:59:14,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_36|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_35|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 12:59:14,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:59:14,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite19_Out-1426624021| |ULTIMATE.start_main_#t~ite18_Out-1426624021|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1426624021 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1426624021 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In-1426624021 |ULTIMATE.start_main_#t~ite18_Out-1426624021|)) (and .cse1 (or .cse2 .cse0) (= ~y~0_In-1426624021 |ULTIMATE.start_main_#t~ite18_Out-1426624021|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1426624021, ~y~0=~y~0_In-1426624021, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1426624021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1426624021} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1426624021, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1426624021|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1426624021|, ~y~0=~y~0_In-1426624021, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1426624021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1426624021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-07 12:59:14,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1385159130 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1385159130 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-1385159130|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out-1385159130| ~y$w_buff0_used~0_In-1385159130) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1385159130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1385159130} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1385159130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1385159130, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1385159130|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 12:59:14,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-199524041 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-199524041 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-199524041 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-199524041 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out-199524041| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite21_Out-199524041| ~y$w_buff1_used~0_In-199524041) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-199524041, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-199524041, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-199524041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-199524041} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-199524041, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-199524041, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-199524041|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-199524041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-199524041} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 12:59:14,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1294117240 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1294117240 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-1294117240| ~y$r_buff0_thd0~0_In-1294117240) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-1294117240| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1294117240, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1294117240} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1294117240, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1294117240, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1294117240|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 12:59:14,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1491142241 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1491142241 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1491142241 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1491142241 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out1491142241|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In1491142241 |ULTIMATE.start_main_#t~ite23_Out1491142241|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1491142241, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1491142241, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1491142241, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1491142241} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1491142241, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1491142241, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1491142241, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1491142241|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1491142241} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-07 12:59:14,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1149475360 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite29_In-1149475360| |ULTIMATE.start_main_#t~ite29_Out-1149475360|) (= |ULTIMATE.start_main_#t~ite30_Out-1149475360| ~y$w_buff0~0_In-1149475360)) (and .cse0 (= |ULTIMATE.start_main_#t~ite30_Out-1149475360| |ULTIMATE.start_main_#t~ite29_Out-1149475360|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1149475360 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1149475360 256))) (= 0 (mod ~y$w_buff0_used~0_In-1149475360 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1149475360 256) 0)))) (= ~y$w_buff0~0_In-1149475360 |ULTIMATE.start_main_#t~ite29_Out-1149475360|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1149475360, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1149475360|, ~y$w_buff0~0=~y$w_buff0~0_In-1149475360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1149475360, ~weak$$choice2~0=~weak$$choice2~0_In-1149475360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1149475360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149475360} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1149475360|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1149475360, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1149475360|, ~y$w_buff0~0=~y$w_buff0~0_In-1149475360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1149475360, ~weak$$choice2~0=~weak$$choice2~0_In-1149475360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1149475360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149475360} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 12:59:14,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-721210854 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite35_Out-721210854| |ULTIMATE.start_main_#t~ite36_Out-721210854|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-721210854 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-721210854 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-721210854 256)) (and (= 0 (mod ~y$r_buff1_thd0~0_In-721210854 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite35_Out-721210854| ~y$w_buff0_used~0_In-721210854)) (and (= |ULTIMATE.start_main_#t~ite36_Out-721210854| ~y$w_buff0_used~0_In-721210854) (= |ULTIMATE.start_main_#t~ite35_In-721210854| |ULTIMATE.start_main_#t~ite35_Out-721210854|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-721210854, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-721210854, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-721210854|, ~weak$$choice2~0=~weak$$choice2~0_In-721210854, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-721210854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-721210854} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-721210854, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-721210854, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-721210854|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-721210854|, ~weak$$choice2~0=~weak$$choice2~0_In-721210854, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-721210854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-721210854} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 12:59:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1086788616 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In1086788616| |ULTIMATE.start_main_#t~ite38_Out1086788616|) (= ~y$w_buff1_used~0_In1086788616 |ULTIMATE.start_main_#t~ite39_Out1086788616|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out1086788616| |ULTIMATE.start_main_#t~ite39_Out1086788616|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1086788616 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1086788616 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1086788616 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1086788616 256)) .cse1))) (= ~y$w_buff1_used~0_In1086788616 |ULTIMATE.start_main_#t~ite38_Out1086788616|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1086788616, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1086788616, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1086788616|, ~weak$$choice2~0=~weak$$choice2~0_In1086788616, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1086788616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1086788616} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1086788616, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1086788616|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1086788616, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1086788616|, ~weak$$choice2~0=~weak$$choice2~0_In1086788616, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1086788616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1086788616} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 12:59:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:59:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In320449282 256)))) (or (and (not .cse0) (= ~y$r_buff1_thd0~0_In320449282 |ULTIMATE.start_main_#t~ite45_Out320449282|) (= |ULTIMATE.start_main_#t~ite44_In320449282| |ULTIMATE.start_main_#t~ite44_Out320449282|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In320449282 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In320449282 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In320449282 256))) (= 0 (mod ~y$w_buff0_used~0_In320449282 256)))) .cse0 (= |ULTIMATE.start_main_#t~ite45_Out320449282| |ULTIMATE.start_main_#t~ite44_Out320449282|) (= ~y$r_buff1_thd0~0_In320449282 |ULTIMATE.start_main_#t~ite44_Out320449282|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In320449282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In320449282, ~weak$$choice2~0=~weak$$choice2~0_In320449282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In320449282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In320449282, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In320449282|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In320449282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In320449282, ~weak$$choice2~0=~weak$$choice2~0_In320449282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In320449282, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out320449282|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out320449282|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In320449282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:59:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:59:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 12:59:14,911 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9726fbe6-02dc-4f98-b711-765eda232bbe/bin/uautomizer/witness.graphml [2019-12-07 12:59:14,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:59:14,912 INFO L168 Benchmark]: Toolchain (without parser) took 10196.28 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 674.8 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 491.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:59:14,912 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:59:14,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:59:14,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.93 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 12:59:14,913 INFO L168 Benchmark]: Boogie Preprocessor took 24.97 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 12:59:14,913 INFO L168 Benchmark]: RCFGBuilder took 382.61 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: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:59:14,914 INFO L168 Benchmark]: TraceAbstraction took 9306.52 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 578.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -147.6 MB). Peak memory consumption was 430.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:59:14,914 INFO L168 Benchmark]: Witness Printer took 58.18 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:59:14,915 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.93 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.97 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 382.61 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: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9306.52 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 578.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -147.6 MB). Peak memory consumption was 430.7 MB. Max. memory is 11.5 GB. * Witness Printer took 58.18 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1114, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1115, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1116, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 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) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1355 SDtfs, 1438 SDslu, 2578 SDs, 0 SdLazy, 1183 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22366occurred 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: 2.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 13197 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 539 NumberOfCodeBlocks, 539 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 76725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...