./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix033_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix033_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a39cbaeb30fe1cccbfed4b9a704e68f15d6f9022 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-28 18:11:57,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:11:57,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:11:57,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:11:57,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:11:57,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:11:57,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:11:57,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:11:57,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:11:57,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:11:57,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:11:57,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:11:57,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:11:57,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:11:57,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:11:57,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:11:57,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:11:57,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:11:57,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:11:57,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:11:57,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:11:57,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:11:57,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:11:57,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:11:57,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:11:57,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:11:57,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:11:57,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:11:57,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:11:57,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:11:57,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:11:57,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:11:57,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:11:57,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:11:57,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:11:57,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:11:57,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:11:57,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:11:57,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:11:57,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:11:57,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:11:57,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:11:57,178 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:11:57,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:11:57,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:11:57,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:11:57,180 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:11:57,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:11:57,181 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:11:57,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:11:57,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:11:57,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:11:57,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:11:57,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:11:57,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:11:57,183 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:11:57,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:11:57,184 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:11:57,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:11:57,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:11:57,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:11:57,185 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:11:57,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:11:57,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:11:57,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:11:57,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:11:57,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:11:57,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:11:57,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:11:57,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:11:57,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:11:57,188 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a39cbaeb30fe1cccbfed4b9a704e68f15d6f9022 [2019-11-28 18:11:57,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:11:57,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:11:57,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:11:57,545 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:11:57,545 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:11:57,546 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix033_power.opt.i [2019-11-28 18:11:57,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996639392/ebb46b56728b4c65ab6ad13e94994626/FLAG8c61f84e5 [2019-11-28 18:11:58,139 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:11:58,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033_power.opt.i [2019-11-28 18:11:58,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996639392/ebb46b56728b4c65ab6ad13e94994626/FLAG8c61f84e5 [2019-11-28 18:11:58,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996639392/ebb46b56728b4c65ab6ad13e94994626 [2019-11-28 18:11:58,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:11:58,412 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:11:58,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:58,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:11:58,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:11:58,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:58" (1/1) ... [2019-11-28 18:11:58,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c380f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:58, skipping insertion in model container [2019-11-28 18:11:58,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:58" (1/1) ... [2019-11-28 18:11:58,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:11:58,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:11:58,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:58,953 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:11:59,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:59,126 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:11:59,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59 WrapperNode [2019-11-28 18:11:59,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:59,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:59,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:11:59,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:11:59,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:59,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:11:59,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:11:59,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:11:59,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:11:59,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:11:59,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:11:59,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:11:59,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:11:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:11:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:11:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:11:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:11:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:11:59,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:11:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:11:59,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:11:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:11:59,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:11:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:11:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:11:59,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:11:59,310 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:11:59,973 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:11:59,974 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:11:59,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:59 BoogieIcfgContainer [2019-11-28 18:11:59,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:11:59,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:11:59,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:11:59,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:11:59,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:11:58" (1/3) ... [2019-11-28 18:11:59,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7d25b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:59, skipping insertion in model container [2019-11-28 18:11:59,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (2/3) ... [2019-11-28 18:11:59,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7d25b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:59, skipping insertion in model container [2019-11-28 18:11:59,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:59" (3/3) ... [2019-11-28 18:11:59,985 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_power.opt.i [2019-11-28 18:11:59,996 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:11:59,996 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:12:00,007 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:12:00,008 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:12:00,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,053 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,053 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,058 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,059 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,104 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,104 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,105 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,114 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,114 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,146 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:12:00,170 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:12:00,170 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:12:00,171 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:12:00,171 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:12:00,171 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:12:00,171 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:12:00,171 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:12:00,172 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:12:00,195 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 180 transitions [2019-11-28 18:12:00,197 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-11-28 18:12:00,283 INFO L134 PetriNetUnfolder]: 35/177 cut-off events. [2019-11-28 18:12:00,283 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:00,299 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 560 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:12:00,320 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-11-28 18:12:00,368 INFO L134 PetriNetUnfolder]: 35/177 cut-off events. [2019-11-28 18:12:00,368 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:00,377 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 560 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:12:00,394 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:12:00,396 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:05,199 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-28 18:12:05,341 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-28 18:12:05,467 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39797 [2019-11-28 18:12:05,468 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-11-28 18:12:05,472 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 78 transitions [2019-11-28 18:12:06,252 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 11878 states. [2019-11-28 18:12:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states. [2019-11-28 18:12:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:12:06,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:06,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:06,262 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-11-28 18:12:06,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:06,269 INFO L82 PathProgramCache]: Analyzing trace with hash -884972408, now seen corresponding path program 1 times [2019-11-28 18:12:06,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:06,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140245713] [2019-11-28 18:12:06,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:06,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140245713] [2019-11-28 18:12:06,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:06,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:06,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681298770] [2019-11-28 18:12:06,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:06,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:06,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:06,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:06,577 INFO L87 Difference]: Start difference. First operand 11878 states. Second operand 3 states. [2019-11-28 18:12:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:06,950 INFO L93 Difference]: Finished difference Result 11574 states and 44420 transitions. [2019-11-28 18:12:06,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:06,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:12:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:07,113 INFO L225 Difference]: With dead ends: 11574 [2019-11-28 18:12:07,113 INFO L226 Difference]: Without dead ends: 10902 [2019-11-28 18:12:07,115 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-11-28 18:12:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-11-28 18:12:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 10902. [2019-11-28 18:12:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-11-28 18:12:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 41772 transitions. [2019-11-28 18:12:07,847 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 41772 transitions. Word has length 7 [2019-11-28 18:12:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:07,849 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 41772 transitions. [2019-11-28 18:12:07,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 41772 transitions. [2019-11-28 18:12:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:12:07,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:07,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:07,856 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-11-28 18:12:07,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:07,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1826046565, now seen corresponding path program 1 times [2019-11-28 18:12:07,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:07,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117773780] [2019-11-28 18:12:07,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:07,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117773780] [2019-11-28 18:12:07,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:07,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:07,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552883418] [2019-11-28 18:12:07,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:07,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:07,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:07,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:07,978 INFO L87 Difference]: Start difference. First operand 10902 states and 41772 transitions. Second operand 3 states. [2019-11-28 18:12:08,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:08,118 INFO L93 Difference]: Finished difference Result 6581 states and 22068 transitions. [2019-11-28 18:12:08,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:08,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 18:12:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:08,177 INFO L225 Difference]: With dead ends: 6581 [2019-11-28 18:12:08,177 INFO L226 Difference]: Without dead ends: 6581 [2019-11-28 18:12:08,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2019-11-28 18:12:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 6581. [2019-11-28 18:12:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6581 states. [2019-11-28 18:12:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 22068 transitions. [2019-11-28 18:12:08,512 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 22068 transitions. Word has length 13 [2019-11-28 18:12:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:08,512 INFO L462 AbstractCegarLoop]: Abstraction has 6581 states and 22068 transitions. [2019-11-28 18:12:08,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 22068 transitions. [2019-11-28 18:12:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:08,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:08,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:08,520 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-11-28 18:12:08,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2047638315, now seen corresponding path program 1 times [2019-11-28 18:12:08,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:08,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985057068] [2019-11-28 18:12:08,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:08,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985057068] [2019-11-28 18:12:08,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:08,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:08,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194484704] [2019-11-28 18:12:08,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:08,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:08,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:08,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:08,677 INFO L87 Difference]: Start difference. First operand 6581 states and 22068 transitions. Second operand 4 states. [2019-11-28 18:12:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:08,744 INFO L93 Difference]: Finished difference Result 1580 states and 4255 transitions. [2019-11-28 18:12:08,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:08,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:08,751 INFO L225 Difference]: With dead ends: 1580 [2019-11-28 18:12:08,751 INFO L226 Difference]: Without dead ends: 1580 [2019-11-28 18:12:08,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2019-11-28 18:12:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2019-11-28 18:12:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2019-11-28 18:12:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 4255 transitions. [2019-11-28 18:12:08,807 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 4255 transitions. Word has length 14 [2019-11-28 18:12:08,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:08,808 INFO L462 AbstractCegarLoop]: Abstraction has 1580 states and 4255 transitions. [2019-11-28 18:12:08,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 4255 transitions. [2019-11-28 18:12:08,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:08,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:08,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:08,810 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-11-28 18:12:08,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:08,811 INFO L82 PathProgramCache]: Analyzing trace with hash 564133875, now seen corresponding path program 1 times [2019-11-28 18:12:08,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:08,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553655876] [2019-11-28 18:12:08,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:08,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553655876] [2019-11-28 18:12:08,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:08,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:08,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206113166] [2019-11-28 18:12:08,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:08,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:08,901 INFO L87 Difference]: Start difference. First operand 1580 states and 4255 transitions. Second operand 3 states. [2019-11-28 18:12:08,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:08,964 INFO L93 Difference]: Finished difference Result 2392 states and 6401 transitions. [2019-11-28 18:12:08,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:08,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:12:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:08,972 INFO L225 Difference]: With dead ends: 2392 [2019-11-28 18:12:08,972 INFO L226 Difference]: Without dead ends: 2392 [2019-11-28 18:12:08,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-11-28 18:12:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1844. [2019-11-28 18:12:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2019-11-28 18:12:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 5001 transitions. [2019-11-28 18:12:09,036 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 5001 transitions. Word has length 16 [2019-11-28 18:12:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:09,037 INFO L462 AbstractCegarLoop]: Abstraction has 1844 states and 5001 transitions. [2019-11-28 18:12:09,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 5001 transitions. [2019-11-28 18:12:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:09,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:09,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:09,040 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-11-28 18:12:09,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:09,040 INFO L82 PathProgramCache]: Analyzing trace with hash 659196956, now seen corresponding path program 1 times [2019-11-28 18:12:09,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:09,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617423011] [2019-11-28 18:12:09,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:09,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:09,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617423011] [2019-11-28 18:12:09,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:09,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:09,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414817040] [2019-11-28 18:12:09,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:09,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:09,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:09,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:09,123 INFO L87 Difference]: Start difference. First operand 1844 states and 5001 transitions. Second operand 5 states. [2019-11-28 18:12:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:09,402 INFO L93 Difference]: Finished difference Result 2843 states and 7459 transitions. [2019-11-28 18:12:09,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:09,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 18:12:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:09,418 INFO L225 Difference]: With dead ends: 2843 [2019-11-28 18:12:09,419 INFO L226 Difference]: Without dead ends: 2843 [2019-11-28 18:12:09,419 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-11-28 18:12:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2019-11-28 18:12:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2353. [2019-11-28 18:12:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2019-11-28 18:12:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 6293 transitions. [2019-11-28 18:12:09,484 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 6293 transitions. Word has length 16 [2019-11-28 18:12:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:09,485 INFO L462 AbstractCegarLoop]: Abstraction has 2353 states and 6293 transitions. [2019-11-28 18:12:09,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 6293 transitions. [2019-11-28 18:12:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:12:09,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:09,492 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] [2019-11-28 18:12:09,492 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-11-28 18:12:09,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:09,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1695035107, now seen corresponding path program 1 times [2019-11-28 18:12:09,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:09,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867302870] [2019-11-28 18:12:09,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:09,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867302870] [2019-11-28 18:12:09,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:09,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:09,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345493724] [2019-11-28 18:12:09,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:09,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:09,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:09,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:09,626 INFO L87 Difference]: Start difference. First operand 2353 states and 6293 transitions. Second operand 5 states. [2019-11-28 18:12:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:09,663 INFO L93 Difference]: Finished difference Result 1432 states and 3933 transitions. [2019-11-28 18:12:09,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:09,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 18:12:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:09,669 INFO L225 Difference]: With dead ends: 1432 [2019-11-28 18:12:09,670 INFO L226 Difference]: Without dead ends: 1432 [2019-11-28 18:12:09,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2019-11-28 18:12:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1360. [2019-11-28 18:12:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2019-11-28 18:12:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 3745 transitions. [2019-11-28 18:12:09,706 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 3745 transitions. Word has length 29 [2019-11-28 18:12:09,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:09,707 INFO L462 AbstractCegarLoop]: Abstraction has 1360 states and 3745 transitions. [2019-11-28 18:12:09,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 3745 transitions. [2019-11-28 18:12:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 18:12:09,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:09,714 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] [2019-11-28 18:12:09,714 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-11-28 18:12:09,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:09,715 INFO L82 PathProgramCache]: Analyzing trace with hash -17339731, now seen corresponding path program 1 times [2019-11-28 18:12:09,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:09,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054476130] [2019-11-28 18:12:09,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:09,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054476130] [2019-11-28 18:12:09,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:09,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:12:09,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980251775] [2019-11-28 18:12:09,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:09,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:09,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:09,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:09,871 INFO L87 Difference]: Start difference. First operand 1360 states and 3745 transitions. Second operand 5 states. [2019-11-28 18:12:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:10,187 INFO L93 Difference]: Finished difference Result 2062 states and 5572 transitions. [2019-11-28 18:12:10,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:12:10,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-28 18:12:10,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:10,195 INFO L225 Difference]: With dead ends: 2062 [2019-11-28 18:12:10,195 INFO L226 Difference]: Without dead ends: 2062 [2019-11-28 18:12:10,196 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-11-28 18:12:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2019-11-28 18:12:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1780. [2019-11-28 18:12:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-11-28 18:12:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 4869 transitions. [2019-11-28 18:12:10,244 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 4869 transitions. Word has length 44 [2019-11-28 18:12:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:10,244 INFO L462 AbstractCegarLoop]: Abstraction has 1780 states and 4869 transitions. [2019-11-28 18:12:10,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:10,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 4869 transitions. [2019-11-28 18:12:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 18:12:10,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:10,250 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] [2019-11-28 18:12:10,251 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-11-28 18:12:10,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2037325251, now seen corresponding path program 2 times [2019-11-28 18:12:10,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:10,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395413538] [2019-11-28 18:12:10,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:10,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395413538] [2019-11-28 18:12:10,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:10,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:10,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259526827] [2019-11-28 18:12:10,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:10,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:10,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:10,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:10,340 INFO L87 Difference]: Start difference. First operand 1780 states and 4869 transitions. Second operand 3 states. [2019-11-28 18:12:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:10,367 INFO L93 Difference]: Finished difference Result 1778 states and 4864 transitions. [2019-11-28 18:12:10,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:10,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 18:12:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:10,375 INFO L225 Difference]: With dead ends: 1778 [2019-11-28 18:12:10,376 INFO L226 Difference]: Without dead ends: 1778 [2019-11-28 18:12:10,376 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-11-28 18:12:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-11-28 18:12:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1596. [2019-11-28 18:12:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2019-11-28 18:12:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 4411 transitions. [2019-11-28 18:12:10,493 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 4411 transitions. Word has length 44 [2019-11-28 18:12:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:10,495 INFO L462 AbstractCegarLoop]: Abstraction has 1596 states and 4411 transitions. [2019-11-28 18:12:10,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 4411 transitions. [2019-11-28 18:12:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:10,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:10,501 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] [2019-11-28 18:12:10,502 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-11-28 18:12:10,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:10,503 INFO L82 PathProgramCache]: Analyzing trace with hash 91748315, now seen corresponding path program 1 times [2019-11-28 18:12:10,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:10,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350485057] [2019-11-28 18:12:10,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:10,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350485057] [2019-11-28 18:12:10,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:10,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:10,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230059418] [2019-11-28 18:12:10,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:10,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:10,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:10,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:10,650 INFO L87 Difference]: Start difference. First operand 1596 states and 4411 transitions. Second operand 4 states. [2019-11-28 18:12:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:10,682 INFO L93 Difference]: Finished difference Result 2263 states and 5929 transitions. [2019-11-28 18:12:10,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:10,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:12:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:10,688 INFO L225 Difference]: With dead ends: 2263 [2019-11-28 18:12:10,688 INFO L226 Difference]: Without dead ends: 1456 [2019-11-28 18:12:10,690 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-11-28 18:12:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-11-28 18:12:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1456. [2019-11-28 18:12:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1456 states. [2019-11-28 18:12:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 3962 transitions. [2019-11-28 18:12:10,727 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 3962 transitions. Word has length 45 [2019-11-28 18:12:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:10,727 INFO L462 AbstractCegarLoop]: Abstraction has 1456 states and 3962 transitions. [2019-11-28 18:12:10,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 3962 transitions. [2019-11-28 18:12:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:10,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:10,733 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] [2019-11-28 18:12:10,733 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-11-28 18:12:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:10,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1010142777, now seen corresponding path program 2 times [2019-11-28 18:12:10,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:10,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620109372] [2019-11-28 18:12:10,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:10,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620109372] [2019-11-28 18:12:10,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:10,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:10,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101940449] [2019-11-28 18:12:10,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:10,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:10,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:10,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:10,866 INFO L87 Difference]: Start difference. First operand 1456 states and 3962 transitions. Second operand 4 states. [2019-11-28 18:12:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:10,892 INFO L93 Difference]: Finished difference Result 2030 states and 5282 transitions. [2019-11-28 18:12:10,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:10,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:12:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:10,894 INFO L225 Difference]: With dead ends: 2030 [2019-11-28 18:12:10,895 INFO L226 Difference]: Without dead ends: 624 [2019-11-28 18:12:10,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-11-28 18:12:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2019-11-28 18:12:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-11-28 18:12:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1409 transitions. [2019-11-28 18:12:10,908 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1409 transitions. Word has length 45 [2019-11-28 18:12:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:10,908 INFO L462 AbstractCegarLoop]: Abstraction has 624 states and 1409 transitions. [2019-11-28 18:12:10,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1409 transitions. [2019-11-28 18:12:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:10,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:10,911 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] [2019-11-28 18:12:10,911 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-11-28 18:12:10,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:10,912 INFO L82 PathProgramCache]: Analyzing trace with hash -926318759, now seen corresponding path program 3 times [2019-11-28 18:12:10,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:10,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339932970] [2019-11-28 18:12:10,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:11,023 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:11,023 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:11,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t876~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t876~0.base_26|) |v_ULTIMATE.start_main_~#t876~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= 0 v_~z$r_buff1_thd3~0_123) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t876~0.base_26| 4)) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= (select .cse0 |v_ULTIMATE.start_main_~#t876~0.base_26|) 0) (= v_~z$r_buff1_thd0~0_127 0) (= v_~z$r_buff0_thd0~0_88 0) (= v_~z$w_buff1_used~0_415 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t876~0.base_26| 1)) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t876~0.base_26|) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= |v_ULTIMATE.start_main_~#t876~0.offset_19| 0) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t878~0.offset=|v_ULTIMATE.start_main_~#t878~0.offset_16|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t876~0.base=|v_ULTIMATE.start_main_~#t876~0.base_26|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ULTIMATE.start_main_~#t877~0.base=|v_ULTIMATE.start_main_~#t877~0.base_19|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ULTIMATE.start_main_~#t877~0.offset=|v_ULTIMATE.start_main_~#t877~0.offset_16|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ULTIMATE.start_main_~#t876~0.offset=|v_ULTIMATE.start_main_~#t876~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ULTIMATE.start_main_~#t878~0.base=|v_ULTIMATE.start_main_~#t878~0.base_19|, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, #NULL.base=|v_#NULL.base_7|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t878~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t876~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t877~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t877~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t876~0.offset, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t878~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:11,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t877~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t877~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t877~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t877~0.base_11|) |v_ULTIMATE.start_main_~#t877~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t877~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t877~0.offset_10| 0) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t877~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t877~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t877~0.base=|v_ULTIMATE.start_main_~#t877~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t877~0.offset=|v_ULTIMATE.start_main_~#t877~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t877~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t877~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:12:11,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t878~0.base_13| 1) |v_#valid_41|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t878~0.base_13| 4) |v_#length_17|) (not (= 0 |v_ULTIMATE.start_main_~#t878~0.base_13|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t878~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t878~0.base_13|) |v_ULTIMATE.start_main_~#t878~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t878~0.base_13|) (= |v_ULTIMATE.start_main_~#t878~0.offset_11| 0) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t878~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t878~0.offset=|v_ULTIMATE.start_main_~#t878~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t878~0.base=|v_ULTIMATE.start_main_~#t878~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t878~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t878~0.base, #length] because there is no mapped edge [2019-11-28 18:12:11,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-11-28 18:12:11,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_18 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:11,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1264351312 256)))) (or (and (= ~z$w_buff0_used~0_In1264351312 |P1Thread1of1ForFork1_#t~ite15_Out1264351312|) (= |P1Thread1of1ForFork1_#t~ite14_In1264351312| |P1Thread1of1ForFork1_#t~ite14_Out1264351312|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1264351312 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1264351312 256)) (and (= (mod ~z$r_buff1_thd2~0_In1264351312 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In1264351312 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out1264351312| |P1Thread1of1ForFork1_#t~ite15_Out1264351312|) (= |P1Thread1of1ForFork1_#t~ite14_Out1264351312| ~z$w_buff0_used~0_In1264351312)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1264351312, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1264351312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1264351312, ~weak$$choice2~0=~weak$$choice2~0_In1264351312, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1264351312, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1264351312|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1264351312, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1264351312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1264351312, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1264351312|, ~weak$$choice2~0=~weak$$choice2~0_In1264351312, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1264351312|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1264351312} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:12:11,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_8|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_5|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:11,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:12:11,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1664177413 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1664177413 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out-1664177413| ~z$w_buff0_used~0_In-1664177413) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-1664177413|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1664177413, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1664177413} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1664177413, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1664177413, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-1664177413|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:12:11,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In719366658 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In719366658 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In719366658 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In719366658 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out719366658| ~z$w_buff1_used~0_In719366658) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out719366658| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In719366658, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In719366658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In719366658, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In719366658} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In719366658, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In719366658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In719366658, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In719366658, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out719366658|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:12:11,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2133559406 256))) (.cse2 (= ~z$r_buff0_thd3~0_In-2133559406 ~z$r_buff0_thd3~0_Out-2133559406)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-2133559406 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd3~0_Out-2133559406)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2133559406, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2133559406} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-2133559406|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2133559406, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-2133559406} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:12:11,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In1282068581 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1282068581 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1282068581 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1282068581 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite31_Out1282068581| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite31_Out1282068581| ~z$r_buff1_thd3~0_In1282068581)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1282068581, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1282068581, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1282068581, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1282068581} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1282068581|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1282068581, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1282068581, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1282068581, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1282068581} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:12:11,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~z$r_buff1_thd3~0_49)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:12:11,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:11,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-440764456 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-440764456 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-440764456| ~z$w_buff1~0_In-440764456)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-440764456| ~z~0_In-440764456)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-440764456, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-440764456, ~z$w_buff1~0=~z$w_buff1~0_In-440764456, ~z~0=~z~0_In-440764456} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-440764456, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-440764456|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-440764456, ~z$w_buff1~0=~z$w_buff1~0_In-440764456, ~z~0=~z~0_In-440764456} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:11,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-11-28 18:12:11,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1536231680 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1536231680 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1536231680 |ULTIMATE.start_main_#t~ite37_Out-1536231680|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out-1536231680|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1536231680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1536231680} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1536231680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1536231680, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1536231680|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:11,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1522099180 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1522099180 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1522099180 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1522099180 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-1522099180| ~z$w_buff1_used~0_In-1522099180)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite38_Out-1522099180| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1522099180, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1522099180, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1522099180, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1522099180} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1522099180, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1522099180, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1522099180, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1522099180, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1522099180|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:11,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1029227465 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1029227465 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1029227465| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite39_Out1029227465| ~z$r_buff0_thd0~0_In1029227465) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1029227465, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1029227465} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1029227465, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1029227465|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1029227465} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:11,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2100301601 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2100301601 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2100301601 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-2100301601 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-2100301601 |ULTIMATE.start_main_#t~ite40_Out-2100301601|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite40_Out-2100301601|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2100301601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2100301601, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2100301601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2100301601} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2100301601, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2100301601|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2100301601, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2100301601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2100301601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:11,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_~__unbuffered_p1_EBX~0_41 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:11,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:11 BasicIcfg [2019-11-28 18:12:11,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:11,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:11,128 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:11,128 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:11,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:59" (3/4) ... [2019-11-28 18:12:11,131 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:11,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t876~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t876~0.base_26|) |v_ULTIMATE.start_main_~#t876~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= 0 v_~z$r_buff1_thd3~0_123) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t876~0.base_26| 4)) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= (select .cse0 |v_ULTIMATE.start_main_~#t876~0.base_26|) 0) (= v_~z$r_buff1_thd0~0_127 0) (= v_~z$r_buff0_thd0~0_88 0) (= v_~z$w_buff1_used~0_415 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t876~0.base_26| 1)) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t876~0.base_26|) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= |v_ULTIMATE.start_main_~#t876~0.offset_19| 0) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t878~0.offset=|v_ULTIMATE.start_main_~#t878~0.offset_16|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t876~0.base=|v_ULTIMATE.start_main_~#t876~0.base_26|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ULTIMATE.start_main_~#t877~0.base=|v_ULTIMATE.start_main_~#t877~0.base_19|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ULTIMATE.start_main_~#t877~0.offset=|v_ULTIMATE.start_main_~#t877~0.offset_16|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ULTIMATE.start_main_~#t876~0.offset=|v_ULTIMATE.start_main_~#t876~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ULTIMATE.start_main_~#t878~0.base=|v_ULTIMATE.start_main_~#t878~0.base_19|, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, #NULL.base=|v_#NULL.base_7|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t878~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t876~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t877~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t877~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t876~0.offset, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t878~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:11,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t877~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t877~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t877~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t877~0.base_11|) |v_ULTIMATE.start_main_~#t877~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t877~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t877~0.offset_10| 0) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t877~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t877~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t877~0.base=|v_ULTIMATE.start_main_~#t877~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t877~0.offset=|v_ULTIMATE.start_main_~#t877~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t877~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t877~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:12:11,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t878~0.base_13| 1) |v_#valid_41|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t878~0.base_13| 4) |v_#length_17|) (not (= 0 |v_ULTIMATE.start_main_~#t878~0.base_13|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t878~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t878~0.base_13|) |v_ULTIMATE.start_main_~#t878~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t878~0.base_13|) (= |v_ULTIMATE.start_main_~#t878~0.offset_11| 0) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t878~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t878~0.offset=|v_ULTIMATE.start_main_~#t878~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t878~0.base=|v_ULTIMATE.start_main_~#t878~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t878~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t878~0.base, #length] because there is no mapped edge [2019-11-28 18:12:11,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-11-28 18:12:11,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_18 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:11,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1264351312 256)))) (or (and (= ~z$w_buff0_used~0_In1264351312 |P1Thread1of1ForFork1_#t~ite15_Out1264351312|) (= |P1Thread1of1ForFork1_#t~ite14_In1264351312| |P1Thread1of1ForFork1_#t~ite14_Out1264351312|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1264351312 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1264351312 256)) (and (= (mod ~z$r_buff1_thd2~0_In1264351312 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In1264351312 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out1264351312| |P1Thread1of1ForFork1_#t~ite15_Out1264351312|) (= |P1Thread1of1ForFork1_#t~ite14_Out1264351312| ~z$w_buff0_used~0_In1264351312)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1264351312, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1264351312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1264351312, ~weak$$choice2~0=~weak$$choice2~0_In1264351312, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1264351312, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1264351312|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1264351312, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1264351312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1264351312, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1264351312|, ~weak$$choice2~0=~weak$$choice2~0_In1264351312, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1264351312|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1264351312} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:12:11,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_8|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_5|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:11,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:12:11,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1664177413 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1664177413 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out-1664177413| ~z$w_buff0_used~0_In-1664177413) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-1664177413|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1664177413, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1664177413} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1664177413, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1664177413, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-1664177413|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:12:11,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In719366658 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In719366658 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In719366658 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In719366658 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out719366658| ~z$w_buff1_used~0_In719366658) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out719366658| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In719366658, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In719366658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In719366658, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In719366658} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In719366658, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In719366658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In719366658, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In719366658, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out719366658|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:12:11,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2133559406 256))) (.cse2 (= ~z$r_buff0_thd3~0_In-2133559406 ~z$r_buff0_thd3~0_Out-2133559406)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-2133559406 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd3~0_Out-2133559406)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2133559406, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2133559406} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-2133559406|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2133559406, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-2133559406} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:12:11,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In1282068581 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1282068581 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1282068581 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1282068581 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite31_Out1282068581| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite31_Out1282068581| ~z$r_buff1_thd3~0_In1282068581)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1282068581, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1282068581, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1282068581, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1282068581} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1282068581|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1282068581, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1282068581, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1282068581, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1282068581} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:12:11,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~z$r_buff1_thd3~0_49)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:12:11,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:11,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-440764456 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-440764456 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-440764456| ~z$w_buff1~0_In-440764456)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-440764456| ~z~0_In-440764456)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-440764456, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-440764456, ~z$w_buff1~0=~z$w_buff1~0_In-440764456, ~z~0=~z~0_In-440764456} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-440764456, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-440764456|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-440764456, ~z$w_buff1~0=~z$w_buff1~0_In-440764456, ~z~0=~z~0_In-440764456} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:11,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-11-28 18:12:11,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1536231680 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1536231680 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1536231680 |ULTIMATE.start_main_#t~ite37_Out-1536231680|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out-1536231680|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1536231680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1536231680} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1536231680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1536231680, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1536231680|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:11,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1522099180 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1522099180 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1522099180 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1522099180 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-1522099180| ~z$w_buff1_used~0_In-1522099180)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite38_Out-1522099180| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1522099180, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1522099180, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1522099180, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1522099180} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1522099180, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1522099180, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1522099180, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1522099180, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1522099180|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:11,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1029227465 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1029227465 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1029227465| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite39_Out1029227465| ~z$r_buff0_thd0~0_In1029227465) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1029227465, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1029227465} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1029227465, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1029227465|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1029227465} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:11,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2100301601 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2100301601 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2100301601 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-2100301601 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-2100301601 |ULTIMATE.start_main_#t~ite40_Out-2100301601|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite40_Out-2100301601|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2100301601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2100301601, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2100301601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2100301601} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2100301601, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2100301601|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2100301601, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2100301601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2100301601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:11,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_~__unbuffered_p1_EBX~0_41 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:11,269 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:11,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:11,271 INFO L168 Benchmark]: Toolchain (without parser) took 12859.13 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 518.0 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -356.2 MB). Peak memory consumption was 161.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:11,272 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:11,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:11,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:11,274 INFO L168 Benchmark]: Boogie Preprocessor took 47.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:11,274 INFO L168 Benchmark]: RCFGBuilder took 734.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:11,279 INFO L168 Benchmark]: TraceAbstraction took 11150.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 365.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -272.8 MB). Peak memory consumption was 92.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:11,280 INFO L168 Benchmark]: Witness Printer took 141.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:11,286 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 714.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 734.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11150.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 365.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -272.8 MB). Peak memory consumption was 92.7 MB. Max. memory is 11.5 GB. * Witness Printer took 141.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 155 ProgramPointsBefore, 70 ProgramPointsAfterwards, 180 TransitionsBefore, 78 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 21 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 192 VarBasedMoverChecksNegative, 55 SemBasedMoverChecksPositive, 173 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 39797 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff1 = z$w_buff0 [L787] 3 z$w_buff0 = 1 [L788] 3 z$w_buff1_used = z$w_buff0_used [L789] 3 z$w_buff0_used = (_Bool)1 [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 146 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.8s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 940 SDtfs, 867 SDslu, 1148 SDs, 0 SdLazy, 517 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 1574 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 41977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...