./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix041_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/mix041_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 0c76bdefb7d69bad3fea845fa012b0f8a1a35469 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:14:48,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:14:48,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:14:48,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:14:48,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:14:48,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:14:48,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:14:48,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:14:48,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:14:48,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:14:48,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:14:48,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:14:48,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:14:48,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:14:48,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:14:48,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:14:48,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:14:48,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:14:48,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:14:48,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:14:48,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:14:48,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:14:48,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:14:48,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:14:48,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:14:48,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:14:48,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:14:48,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:14:48,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:14:48,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:14:48,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:14:48,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:14:48,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:14:48,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:14:48,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:14:48,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:14:48,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:14:48,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:14:48,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:14:48,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:14:48,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:14:48,263 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:14:48,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:14:48,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:14:48,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:14:48,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:14:48,280 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:14:48,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:14:48,281 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:14:48,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:14:48,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:14:48,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:14:48,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:14:48,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:14:48,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:14:48,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:14:48,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:14:48,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:14:48,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:14:48,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:14:48,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:14:48,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:14:48,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:14:48,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:14:48,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:14:48,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:14:48,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:14:48,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:14:48,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:14:48,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:14:48,287 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:14:48,287 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 -> 0c76bdefb7d69bad3fea845fa012b0f8a1a35469 [2019-11-28 18:14:48,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:14:48,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:14:48,685 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:14:48,687 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:14:48,688 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:14:48,688 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix041_power.opt.i [2019-11-28 18:14:48,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96321df10/9accf00465184fb98ec3a4c0fb760eea/FLAG202d9ebe8 [2019-11-28 18:14:49,332 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:14:49,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_power.opt.i [2019-11-28 18:14:49,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96321df10/9accf00465184fb98ec3a4c0fb760eea/FLAG202d9ebe8 [2019-11-28 18:14:49,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96321df10/9accf00465184fb98ec3a4c0fb760eea [2019-11-28 18:14:49,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:14:49,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:14:49,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:49,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:14:49,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:14:49,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:49" (1/1) ... [2019-11-28 18:14:49,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76576ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:49, skipping insertion in model container [2019-11-28 18:14:49,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:49" (1/1) ... [2019-11-28 18:14:49,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:14:49,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:14:50,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:50,188 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:14:50,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:50,373 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:14:50,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50 WrapperNode [2019-11-28 18:14:50,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:50,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:50,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:14:50,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:14:50,385 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:14:50" (1/1) ... [2019-11-28 18:14:50,405 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:14:50" (1/1) ... [2019-11-28 18:14:50,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:50,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:14:50,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:14:50,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:14:50,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:14:50,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:14:50,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:14:50,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:14:50,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (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:14:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:14:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:14:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:14:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:14:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:14:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:14:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:14:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:14:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:14:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:14:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:14:50,569 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:14:51,297 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:14:51,298 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:14:51,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:51 BoogieIcfgContainer [2019-11-28 18:14:51,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:14:51,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:14:51,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:14:51,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:14:51,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:14:49" (1/3) ... [2019-11-28 18:14:51,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eaaa3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:14:51, skipping insertion in model container [2019-11-28 18:14:51,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (2/3) ... [2019-11-28 18:14:51,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eaaa3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:14:51, skipping insertion in model container [2019-11-28 18:14:51,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:51" (3/3) ... [2019-11-28 18:14:51,316 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_power.opt.i [2019-11-28 18:14:51,329 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:14:51,330 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:14:51,342 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:14:51,343 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:14:51,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,411 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,412 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,412 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,414 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,447 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:14:51,467 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:14:51,468 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:14:51,468 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:14:51,468 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:14:51,468 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:14:51,468 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:14:51,468 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:14:51,469 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:14:51,487 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-11-28 18:14:51,489 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:14:51,577 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:14:51,577 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:14:51,593 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 463 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:14:51,613 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:14:51,659 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:14:51,659 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:14:51,665 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 463 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:14:51,681 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-11-28 18:14:51,683 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:14:54,492 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-11-28 18:14:56,188 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:14:56,330 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:14:56,367 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45620 [2019-11-28 18:14:56,368 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-11-28 18:14:56,371 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-11-28 18:14:57,029 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8218 states. [2019-11-28 18:14:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 8218 states. [2019-11-28 18:14:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:14:57,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:57,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:14:57,055 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:57,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:57,069 INFO L82 PathProgramCache]: Analyzing trace with hash 699456563, now seen corresponding path program 1 times [2019-11-28 18:14:57,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:57,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241986896] [2019-11-28 18:14:57,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:57,560 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:14:57,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241986896] [2019-11-28 18:14:57,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:57,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:14:57,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014090461] [2019-11-28 18:14:57,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:57,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:57,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:57,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:57,601 INFO L87 Difference]: Start difference. First operand 8218 states. Second operand 3 states. [2019-11-28 18:14:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:57,896 INFO L93 Difference]: Finished difference Result 8170 states and 26597 transitions. [2019-11-28 18:14:57,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:57,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:14:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:58,008 INFO L225 Difference]: With dead ends: 8170 [2019-11-28 18:14:58,011 INFO L226 Difference]: Without dead ends: 8001 [2019-11-28 18:14:58,013 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:14:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2019-11-28 18:14:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 8001. [2019-11-28 18:14:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8001 states. [2019-11-28 18:14:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 26077 transitions. [2019-11-28 18:14:58,427 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 26077 transitions. Word has length 5 [2019-11-28 18:14:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:58,428 INFO L462 AbstractCegarLoop]: Abstraction has 8001 states and 26077 transitions. [2019-11-28 18:14:58,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 26077 transitions. [2019-11-28 18:14:58,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:14:58,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:58,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:58,432 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:58,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:58,433 INFO L82 PathProgramCache]: Analyzing trace with hash 336736415, now seen corresponding path program 1 times [2019-11-28 18:14:58,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:58,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055172400] [2019-11-28 18:14:58,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:58,562 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:14:58,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055172400] [2019-11-28 18:14:58,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:58,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:58,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486059439] [2019-11-28 18:14:58,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:58,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:58,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:58,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:58,566 INFO L87 Difference]: Start difference. First operand 8001 states and 26077 transitions. Second operand 4 states. [2019-11-28 18:14:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:58,963 INFO L93 Difference]: Finished difference Result 12769 states and 39815 transitions. [2019-11-28 18:14:58,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:58,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:14:58,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:59,056 INFO L225 Difference]: With dead ends: 12769 [2019-11-28 18:14:59,057 INFO L226 Difference]: Without dead ends: 12762 [2019-11-28 18:14:59,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2019-11-28 18:14:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 11253. [2019-11-28 18:14:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11253 states. [2019-11-28 18:14:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11253 states to 11253 states and 35607 transitions. [2019-11-28 18:14:59,718 INFO L78 Accepts]: Start accepts. Automaton has 11253 states and 35607 transitions. Word has length 11 [2019-11-28 18:14:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:59,718 INFO L462 AbstractCegarLoop]: Abstraction has 11253 states and 35607 transitions. [2019-11-28 18:14:59,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 11253 states and 35607 transitions. [2019-11-28 18:14:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:14:59,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:59,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:59,722 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:59,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:59,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1460182026, now seen corresponding path program 1 times [2019-11-28 18:14:59,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:59,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496962847] [2019-11-28 18:14:59,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:59,824 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:14:59,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496962847] [2019-11-28 18:14:59,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:59,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:59,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972710653] [2019-11-28 18:14:59,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:59,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:59,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:59,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:59,826 INFO L87 Difference]: Start difference. First operand 11253 states and 35607 transitions. Second operand 4 states. [2019-11-28 18:14:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:59,864 INFO L93 Difference]: Finished difference Result 1887 states and 4356 transitions. [2019-11-28 18:14:59,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:59,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:14:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:59,870 INFO L225 Difference]: With dead ends: 1887 [2019-11-28 18:14:59,870 INFO L226 Difference]: Without dead ends: 1601 [2019-11-28 18:14:59,871 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:14:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2019-11-28 18:14:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2019-11-28 18:14:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-11-28 18:14:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 3565 transitions. [2019-11-28 18:14:59,911 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 3565 transitions. Word has length 11 [2019-11-28 18:14:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:59,911 INFO L462 AbstractCegarLoop]: Abstraction has 1601 states and 3565 transitions. [2019-11-28 18:14:59,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:59,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 3565 transitions. [2019-11-28 18:14:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 18:14:59,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:59,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:59,914 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:59,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:59,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1717219497, now seen corresponding path program 1 times [2019-11-28 18:14:59,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:59,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474958800] [2019-11-28 18:14:59,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:00,215 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:15:00,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474958800] [2019-11-28 18:15:00,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:00,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:15:00,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281761510] [2019-11-28 18:15:00,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:15:00,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:00,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:15:00,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:15:00,218 INFO L87 Difference]: Start difference. First operand 1601 states and 3565 transitions. Second operand 7 states. [2019-11-28 18:15:00,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:00,733 INFO L93 Difference]: Finished difference Result 2053 states and 4473 transitions. [2019-11-28 18:15:00,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 18:15:00,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-28 18:15:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:00,740 INFO L225 Difference]: With dead ends: 2053 [2019-11-28 18:15:00,740 INFO L226 Difference]: Without dead ends: 2053 [2019-11-28 18:15:00,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:15:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-11-28 18:15:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1824. [2019-11-28 18:15:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-11-28 18:15:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 4021 transitions. [2019-11-28 18:15:00,785 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 4021 transitions. Word has length 23 [2019-11-28 18:15:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:00,788 INFO L462 AbstractCegarLoop]: Abstraction has 1824 states and 4021 transitions. [2019-11-28 18:15:00,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:15:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 4021 transitions. [2019-11-28 18:15:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 18:15:00,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:00,792 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] [2019-11-28 18:15:00,793 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:00,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:00,793 INFO L82 PathProgramCache]: Analyzing trace with hash 736634855, now seen corresponding path program 1 times [2019-11-28 18:15:00,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:00,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20981821] [2019-11-28 18:15:00,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:00,881 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:15:00,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20981821] [2019-11-28 18:15:00,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:00,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:15:00,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639381237] [2019-11-28 18:15:00,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:15:00,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:00,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:15:00,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:00,883 INFO L87 Difference]: Start difference. First operand 1824 states and 4021 transitions. Second operand 5 states. [2019-11-28 18:15:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:00,927 INFO L93 Difference]: Finished difference Result 419 states and 767 transitions. [2019-11-28 18:15:00,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:15:00,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-28 18:15:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:00,929 INFO L225 Difference]: With dead ends: 419 [2019-11-28 18:15:00,929 INFO L226 Difference]: Without dead ends: 373 [2019-11-28 18:15:00,930 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:15:00,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-28 18:15:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 338. [2019-11-28 18:15:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-11-28 18:15:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 612 transitions. [2019-11-28 18:15:00,937 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 612 transitions. Word has length 37 [2019-11-28 18:15:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:00,938 INFO L462 AbstractCegarLoop]: Abstraction has 338 states and 612 transitions. [2019-11-28 18:15:00,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:15:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 612 transitions. [2019-11-28 18:15:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:15:00,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:00,940 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:00,941 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1915125863, now seen corresponding path program 1 times [2019-11-28 18:15:00,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:00,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28904396] [2019-11-28 18:15:00,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:01,068 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:15:01,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28904396] [2019-11-28 18:15:01,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:01,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:01,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006995940] [2019-11-28 18:15:01,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:01,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:01,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:01,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:01,071 INFO L87 Difference]: Start difference. First operand 338 states and 612 transitions. Second operand 3 states. [2019-11-28 18:15:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:01,114 INFO L93 Difference]: Finished difference Result 352 states and 630 transitions. [2019-11-28 18:15:01,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:01,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:15:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:01,116 INFO L225 Difference]: With dead ends: 352 [2019-11-28 18:15:01,116 INFO L226 Difference]: Without dead ends: 352 [2019-11-28 18:15:01,117 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:15:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-28 18:15:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-11-28 18:15:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-28 18:15:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 626 transitions. [2019-11-28 18:15:01,124 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 626 transitions. Word has length 52 [2019-11-28 18:15:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:01,125 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 626 transitions. [2019-11-28 18:15:01,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 626 transitions. [2019-11-28 18:15:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:15:01,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:01,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:01,127 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:01,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:01,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1804822393, now seen corresponding path program 1 times [2019-11-28 18:15:01,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:01,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561542533] [2019-11-28 18:15:01,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:01,221 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:15:01,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561542533] [2019-11-28 18:15:01,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:01,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:01,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555725024] [2019-11-28 18:15:01,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:01,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:01,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:01,224 INFO L87 Difference]: Start difference. First operand 348 states and 626 transitions. Second operand 3 states. [2019-11-28 18:15:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:01,239 INFO L93 Difference]: Finished difference Result 348 states and 613 transitions. [2019-11-28 18:15:01,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:01,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:15:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:01,241 INFO L225 Difference]: With dead ends: 348 [2019-11-28 18:15:01,241 INFO L226 Difference]: Without dead ends: 348 [2019-11-28 18:15:01,242 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:15:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-11-28 18:15:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-11-28 18:15:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-28 18:15:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 613 transitions. [2019-11-28 18:15:01,250 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 613 transitions. Word has length 52 [2019-11-28 18:15:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:01,250 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 613 transitions. [2019-11-28 18:15:01,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 613 transitions. [2019-11-28 18:15:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:15:01,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:01,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:01,253 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:01,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:01,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1986059885, now seen corresponding path program 1 times [2019-11-28 18:15:01,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:01,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433321378] [2019-11-28 18:15:01,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:01,333 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:15:01,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433321378] [2019-11-28 18:15:01,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:01,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:01,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256161065] [2019-11-28 18:15:01,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:01,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:01,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:01,336 INFO L87 Difference]: Start difference. First operand 348 states and 613 transitions. Second operand 3 states. [2019-11-28 18:15:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:01,375 INFO L93 Difference]: Finished difference Result 347 states and 611 transitions. [2019-11-28 18:15:01,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:01,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-28 18:15:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:01,377 INFO L225 Difference]: With dead ends: 347 [2019-11-28 18:15:01,377 INFO L226 Difference]: Without dead ends: 347 [2019-11-28 18:15:01,378 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:15:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-11-28 18:15:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2019-11-28 18:15:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-28 18:15:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 611 transitions. [2019-11-28 18:15:01,386 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 611 transitions. Word has length 53 [2019-11-28 18:15:01,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:01,387 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 611 transitions. [2019-11-28 18:15:01,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 611 transitions. [2019-11-28 18:15:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 18:15:01,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:01,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:01,389 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:01,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:01,389 INFO L82 PathProgramCache]: Analyzing trace with hash -752439480, now seen corresponding path program 1 times [2019-11-28 18:15:01,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:01,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204921215] [2019-11-28 18:15:01,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:01,659 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:15:01,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204921215] [2019-11-28 18:15:01,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:01,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:15:01,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624136162] [2019-11-28 18:15:01,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:15:01,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:01,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:15:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:15:01,667 INFO L87 Difference]: Start difference. First operand 347 states and 611 transitions. Second operand 10 states. [2019-11-28 18:15:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:02,011 INFO L93 Difference]: Finished difference Result 560 states and 992 transitions. [2019-11-28 18:15:02,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:15:02,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-28 18:15:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:02,013 INFO L225 Difference]: With dead ends: 560 [2019-11-28 18:15:02,013 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 18:15:02,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-11-28 18:15:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 18:15:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 208. [2019-11-28 18:15:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-28 18:15:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 367 transitions. [2019-11-28 18:15:02,019 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 367 transitions. Word has length 54 [2019-11-28 18:15:02,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:02,019 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 367 transitions. [2019-11-28 18:15:02,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:15:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 367 transitions. [2019-11-28 18:15:02,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 18:15:02,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:02,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:02,020 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:02,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:02,021 INFO L82 PathProgramCache]: Analyzing trace with hash 516281010, now seen corresponding path program 2 times [2019-11-28 18:15:02,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:02,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031254374] [2019-11-28 18:15:02,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:15:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:15:02,249 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:15:02,249 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:15:02,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$r_buff1_thd2~0_157) (= 0 v_~weak$$choice0~0_14) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1091~0.base_20|) (= v_~x$mem_tmp~0_21 0) (= 0 v_~x$w_buff0~0_235) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~x$w_buff1~0_175) (= 0 v_~x$w_buff1_used~0_360) (= v_~weak$$choice2~0_113 0) (= 0 v_~x$read_delayed~0_5) (= 0 v_~x$r_buff0_thd2~0_211) (= v_~main$tmp_guard1~0_26 0) (= v_~x$r_buff0_thd0~0_331 0) (= |v_ULTIMATE.start_main_~#t1091~0.offset_15| 0) (= v_~x$r_buff1_thd0~0_268 0) (= v_~__unbuffered_p1_EAX~0_126 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~x$r_buff1_thd1~0_198 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1091~0.base_20|)) (= 0 v_~__unbuffered_cnt~0_64) (= (store .cse0 |v_ULTIMATE.start_main_~#t1091~0.base_20| 1) |v_#valid_44|) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p1_EBX~0_126) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1091~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1091~0.base_20|) |v_ULTIMATE.start_main_~#t1091~0.offset_15| 0)) |v_#memory_int_17|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1091~0.base_20| 4) |v_#length_17|) (= 0 v_~x$w_buff0_used~0_638) (= 0 v_~x~0_158) (= v_~x$flush_delayed~0_38 0) (= v_~z~0_80 0) (= v_~y~0_115 0) (= v_~x$r_buff0_thd1~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_235, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ~x$flush_delayed~0=v_~x$flush_delayed~0_38, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_34|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_126, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_331, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_35|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ~x$w_buff1~0=v_~x$w_buff1~0_175, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_24|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_360, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_29|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_30|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1092~0.base=|v_ULTIMATE.start_main_~#t1092~0.base_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~x~0=v_~x~0_158, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_118, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_26|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_45|, ~x$mem_tmp~0=v_~x$mem_tmp~0_21, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_36|, ULTIMATE.start_main_~#t1092~0.offset=|v_ULTIMATE.start_main_~#t1092~0.offset_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_26|, ULTIMATE.start_main_~#t1091~0.base=|v_ULTIMATE.start_main_~#t1091~0.base_20|, ~y~0=v_~y~0_115, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_126, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_34|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_~#t1091~0.offset=|v_ULTIMATE.start_main_~#t1091~0.offset_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_268, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_638, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_17|, ~z~0=v_~z~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_113, ~x$read_delayed~0=v_~x$read_delayed~0_5} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1092~0.base, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1092~0.offset, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1091~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t1091~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:15:02,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L789-1-->L791: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1092~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1092~0.base_11|) |v_ULTIMATE.start_main_~#t1092~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1092~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1092~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1092~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1092~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1092~0.base_11| 1)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1092~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1092~0.offset=|v_ULTIMATE.start_main_~#t1092~0.offset_10|, ULTIMATE.start_main_~#t1092~0.base=|v_ULTIMATE.start_main_~#t1092~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1092~0.offset, ULTIMATE.start_main_~#t1092~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-11-28 18:15:02,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= 1 v_~x$w_buff0_used~0_78) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_78 256))) (not (= (mod v_~x$w_buff1_used~0_47 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (= 2 v_~x$w_buff0~0_19) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= v_~x$w_buff1_used~0_47 v_~x$w_buff0_used~0_79) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-11-28 18:15:02,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In801286270 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In801286270 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out801286270| |P0Thread1of1ForFork0_#t~ite3_Out801286270|))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In801286270 |P0Thread1of1ForFork0_#t~ite3_Out801286270|) .cse2) (and (or .cse1 .cse0) (= ~x~0_In801286270 |P0Thread1of1ForFork0_#t~ite3_Out801286270|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In801286270, ~x$w_buff1_used~0=~x$w_buff1_used~0_In801286270, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In801286270, ~x~0=~x~0_In801286270} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out801286270|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out801286270|, ~x$w_buff1~0=~x$w_buff1~0_In801286270, ~x$w_buff1_used~0=~x$w_buff1_used~0_In801286270, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In801286270, ~x~0=~x~0_In801286270} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-11-28 18:15:02,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1568190554 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1568190554 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1568190554| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1568190554 |P0Thread1of1ForFork0_#t~ite5_Out1568190554|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1568190554, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1568190554} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1568190554|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1568190554, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1568190554} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:15:02,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In1171196771 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1171196771 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1171196771 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1171196771 256) 0))) (or (and (= ~x$w_buff1_used~0_In1171196771 |P0Thread1of1ForFork0_#t~ite6_Out1171196771|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1171196771| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1171196771, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1171196771, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1171196771, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1171196771} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1171196771|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1171196771, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1171196771, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1171196771, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1171196771} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:15:02,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1342623224 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1342623224 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1342623224|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In1342623224 |P0Thread1of1ForFork0_#t~ite7_Out1342623224|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1342623224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1342623224} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1342623224, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1342623224|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1342623224} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:15:02,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-787913997 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-787913997 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-787913997 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-787913997 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-787913997| ~x$r_buff1_thd1~0_In-787913997)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-787913997|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-787913997, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-787913997, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-787913997, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-787913997} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-787913997, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-787913997|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-787913997, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-787913997, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-787913997} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:15:02,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L736-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_144 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_144} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:15:02,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In140684706 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In140684706 256) 0))) (or (and (= ~x$w_buff0_used~0_In140684706 |P1Thread1of1ForFork1_#t~ite11_Out140684706|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out140684706|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In140684706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In140684706} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out140684706|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In140684706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In140684706} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-11-28 18:15:02,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In772516503 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In772516503 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In772516503 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In772516503 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out772516503|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In772516503 |P1Thread1of1ForFork1_#t~ite12_Out772516503|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In772516503, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In772516503, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In772516503, ~x$w_buff0_used~0=~x$w_buff0_used~0_In772516503} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In772516503, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In772516503, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out772516503|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In772516503, ~x$w_buff0_used~0=~x$w_buff0_used~0_In772516503} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:15:02,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In-1603767742 ~x$r_buff0_thd2~0_Out-1603767742)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1603767742 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1603767742 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1603767742)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1603767742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1603767742} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1603767742|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1603767742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1603767742} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:15:02,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-69524439 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-69524439 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-69524439 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-69524439 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-69524439 |P1Thread1of1ForFork1_#t~ite14_Out-69524439|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-69524439|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-69524439, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-69524439, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-69524439, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-69524439} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-69524439, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-69524439, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-69524439, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-69524439|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-69524439} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:15:02,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_134 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:15:02,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_128 256) 0) (= 0 (mod v_~x$w_buff0_used~0_232 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:15:02,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1178857548 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1178857548 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out1178857548| ~x~0_In1178857548)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out1178857548| ~x$w_buff1~0_In1178857548)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1178857548, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1178857548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1178857548, ~x~0=~x~0_In1178857548} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1178857548|, ~x$w_buff1~0=~x$w_buff1~0_In1178857548, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1178857548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1178857548, ~x~0=~x~0_In1178857548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-11-28 18:15:02,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_43 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-11-28 18:15:02,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1327632487 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1327632487 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-1327632487| ~x$w_buff0_used~0_In-1327632487) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-1327632487| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1327632487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1327632487} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1327632487, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1327632487|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1327632487} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-11-28 18:15:02,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-519503864 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-519503864 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-519503864 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-519503864 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-519503864| ~x$w_buff1_used~0_In-519503864) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-519503864|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-519503864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-519503864, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-519503864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519503864} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-519503864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-519503864, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-519503864|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-519503864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519503864} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-11-28 18:15:02,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1026660069 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1026660069 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1026660069|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1026660069 |ULTIMATE.start_main_#t~ite21_Out-1026660069|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1026660069, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1026660069} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1026660069, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1026660069|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1026660069} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-11-28 18:15:02,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1239706735 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1239706735 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1239706735 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1239706735 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out1239706735| 0)) (and (= ~x$r_buff1_thd0~0_In1239706735 |ULTIMATE.start_main_#t~ite22_Out1239706735|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1239706735, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1239706735, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1239706735, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1239706735} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1239706735, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1239706735, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1239706735, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1239706735|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1239706735} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-11-28 18:15:02,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L810-->L810-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In574818707 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In574818707 256)))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In574818707 256)) .cse0) (= (mod ~x$w_buff0_used~0_In574818707 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In574818707 256)) .cse0))) (= ~x$w_buff1~0_In574818707 |ULTIMATE.start_main_#t~ite31_Out574818707|) .cse1 (= |ULTIMATE.start_main_#t~ite32_Out574818707| |ULTIMATE.start_main_#t~ite31_Out574818707|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite31_In574818707| |ULTIMATE.start_main_#t~ite31_Out574818707|) (= ~x$w_buff1~0_In574818707 |ULTIMATE.start_main_#t~ite32_Out574818707|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In574818707, ~x$w_buff1~0=~x$w_buff1~0_In574818707, ~x$w_buff1_used~0=~x$w_buff1_used~0_In574818707, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In574818707, ~weak$$choice2~0=~weak$$choice2~0_In574818707, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In574818707|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In574818707} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In574818707, ~x$w_buff1~0=~x$w_buff1~0_In574818707, ~x$w_buff1_used~0=~x$w_buff1_used~0_In574818707, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out574818707|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In574818707, ~weak$$choice2~0=~weak$$choice2~0_In574818707, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out574818707|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In574818707} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-11-28 18:15:02,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-26858189 256) 0))) (or (and (= ~x$w_buff1_used~0_In-26858189 |ULTIMATE.start_main_#t~ite37_Out-26858189|) (= |ULTIMATE.start_main_#t~ite38_Out-26858189| |ULTIMATE.start_main_#t~ite37_Out-26858189|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-26858189 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-26858189 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-26858189 256)) (and (= 0 (mod ~x$r_buff1_thd0~0_In-26858189 256)) .cse1)))) (and (not .cse0) (= ~x$w_buff1_used~0_In-26858189 |ULTIMATE.start_main_#t~ite38_Out-26858189|) (= |ULTIMATE.start_main_#t~ite37_In-26858189| |ULTIMATE.start_main_#t~ite37_Out-26858189|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-26858189, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-26858189, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-26858189|, ~weak$$choice2~0=~weak$$choice2~0_In-26858189, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-26858189, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-26858189} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-26858189, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-26858189, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-26858189|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-26858189|, ~weak$$choice2~0=~weak$$choice2~0_In-26858189, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-26858189, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-26858189} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:15:02,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~x$r_buff0_thd0~0_85 v_~x$r_buff0_thd0~0_84)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:15:02,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L816-->L819-1: Formula: (and (= v_~x$mem_tmp~0_16 v_~x~0_122) (not (= 0 (mod v_~x$flush_delayed~0_31 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_30 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ~x~0=v_~x~0_122, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_27|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:15:02,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:15:02,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:15:02 BasicIcfg [2019-11-28 18:15:02,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:15:02,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:15:02,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:15:02,369 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:15:02,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:51" (3/4) ... [2019-11-28 18:15:02,371 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:15:02,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$r_buff1_thd2~0_157) (= 0 v_~weak$$choice0~0_14) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1091~0.base_20|) (= v_~x$mem_tmp~0_21 0) (= 0 v_~x$w_buff0~0_235) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~x$w_buff1~0_175) (= 0 v_~x$w_buff1_used~0_360) (= v_~weak$$choice2~0_113 0) (= 0 v_~x$read_delayed~0_5) (= 0 v_~x$r_buff0_thd2~0_211) (= v_~main$tmp_guard1~0_26 0) (= v_~x$r_buff0_thd0~0_331 0) (= |v_ULTIMATE.start_main_~#t1091~0.offset_15| 0) (= v_~x$r_buff1_thd0~0_268 0) (= v_~__unbuffered_p1_EAX~0_126 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~x$r_buff1_thd1~0_198 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1091~0.base_20|)) (= 0 v_~__unbuffered_cnt~0_64) (= (store .cse0 |v_ULTIMATE.start_main_~#t1091~0.base_20| 1) |v_#valid_44|) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p1_EBX~0_126) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1091~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1091~0.base_20|) |v_ULTIMATE.start_main_~#t1091~0.offset_15| 0)) |v_#memory_int_17|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1091~0.base_20| 4) |v_#length_17|) (= 0 v_~x$w_buff0_used~0_638) (= 0 v_~x~0_158) (= v_~x$flush_delayed~0_38 0) (= v_~z~0_80 0) (= v_~y~0_115 0) (= v_~x$r_buff0_thd1~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_235, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ~x$flush_delayed~0=v_~x$flush_delayed~0_38, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_34|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_126, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_331, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_35|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ~x$w_buff1~0=v_~x$w_buff1~0_175, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_24|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_360, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_29|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_30|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1092~0.base=|v_ULTIMATE.start_main_~#t1092~0.base_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~x~0=v_~x~0_158, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_118, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_26|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_45|, ~x$mem_tmp~0=v_~x$mem_tmp~0_21, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_36|, ULTIMATE.start_main_~#t1092~0.offset=|v_ULTIMATE.start_main_~#t1092~0.offset_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_26|, ULTIMATE.start_main_~#t1091~0.base=|v_ULTIMATE.start_main_~#t1091~0.base_20|, ~y~0=v_~y~0_115, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_126, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_34|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_~#t1091~0.offset=|v_ULTIMATE.start_main_~#t1091~0.offset_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_268, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_638, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_17|, ~z~0=v_~z~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_113, ~x$read_delayed~0=v_~x$read_delayed~0_5} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1092~0.base, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1092~0.offset, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1091~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t1091~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:15:02,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L789-1-->L791: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1092~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1092~0.base_11|) |v_ULTIMATE.start_main_~#t1092~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1092~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1092~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1092~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1092~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1092~0.base_11| 1)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1092~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1092~0.offset=|v_ULTIMATE.start_main_~#t1092~0.offset_10|, ULTIMATE.start_main_~#t1092~0.base=|v_ULTIMATE.start_main_~#t1092~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1092~0.offset, ULTIMATE.start_main_~#t1092~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-11-28 18:15:02,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= 1 v_~x$w_buff0_used~0_78) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_78 256))) (not (= (mod v_~x$w_buff1_used~0_47 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (= 2 v_~x$w_buff0~0_19) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= v_~x$w_buff1_used~0_47 v_~x$w_buff0_used~0_79) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-11-28 18:15:02,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In801286270 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In801286270 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out801286270| |P0Thread1of1ForFork0_#t~ite3_Out801286270|))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In801286270 |P0Thread1of1ForFork0_#t~ite3_Out801286270|) .cse2) (and (or .cse1 .cse0) (= ~x~0_In801286270 |P0Thread1of1ForFork0_#t~ite3_Out801286270|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In801286270, ~x$w_buff1_used~0=~x$w_buff1_used~0_In801286270, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In801286270, ~x~0=~x~0_In801286270} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out801286270|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out801286270|, ~x$w_buff1~0=~x$w_buff1~0_In801286270, ~x$w_buff1_used~0=~x$w_buff1_used~0_In801286270, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In801286270, ~x~0=~x~0_In801286270} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-11-28 18:15:02,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1568190554 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1568190554 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1568190554| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1568190554 |P0Thread1of1ForFork0_#t~ite5_Out1568190554|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1568190554, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1568190554} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1568190554|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1568190554, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1568190554} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:15:02,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In1171196771 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1171196771 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1171196771 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1171196771 256) 0))) (or (and (= ~x$w_buff1_used~0_In1171196771 |P0Thread1of1ForFork0_#t~ite6_Out1171196771|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1171196771| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1171196771, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1171196771, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1171196771, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1171196771} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1171196771|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1171196771, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1171196771, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1171196771, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1171196771} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:15:02,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1342623224 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1342623224 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1342623224|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In1342623224 |P0Thread1of1ForFork0_#t~ite7_Out1342623224|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1342623224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1342623224} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1342623224, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1342623224|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1342623224} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:15:02,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-787913997 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-787913997 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-787913997 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-787913997 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-787913997| ~x$r_buff1_thd1~0_In-787913997)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-787913997|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-787913997, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-787913997, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-787913997, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-787913997} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-787913997, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-787913997|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-787913997, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-787913997, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-787913997} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:15:02,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L736-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_144 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_144} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:15:02,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In140684706 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In140684706 256) 0))) (or (and (= ~x$w_buff0_used~0_In140684706 |P1Thread1of1ForFork1_#t~ite11_Out140684706|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out140684706|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In140684706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In140684706} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out140684706|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In140684706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In140684706} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-11-28 18:15:02,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In772516503 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In772516503 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In772516503 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In772516503 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out772516503|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In772516503 |P1Thread1of1ForFork1_#t~ite12_Out772516503|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In772516503, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In772516503, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In772516503, ~x$w_buff0_used~0=~x$w_buff0_used~0_In772516503} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In772516503, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In772516503, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out772516503|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In772516503, ~x$w_buff0_used~0=~x$w_buff0_used~0_In772516503} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:15:02,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In-1603767742 ~x$r_buff0_thd2~0_Out-1603767742)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1603767742 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1603767742 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1603767742)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1603767742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1603767742} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1603767742|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1603767742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1603767742} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:15:02,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-69524439 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-69524439 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-69524439 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-69524439 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-69524439 |P1Thread1of1ForFork1_#t~ite14_Out-69524439|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-69524439|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-69524439, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-69524439, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-69524439, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-69524439} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-69524439, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-69524439, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-69524439, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-69524439|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-69524439} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:15:02,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_134 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:15:02,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_128 256) 0) (= 0 (mod v_~x$w_buff0_used~0_232 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:15:02,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1178857548 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1178857548 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out1178857548| ~x~0_In1178857548)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out1178857548| ~x$w_buff1~0_In1178857548)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1178857548, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1178857548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1178857548, ~x~0=~x~0_In1178857548} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1178857548|, ~x$w_buff1~0=~x$w_buff1~0_In1178857548, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1178857548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1178857548, ~x~0=~x~0_In1178857548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-11-28 18:15:02,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_43 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-11-28 18:15:02,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1327632487 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1327632487 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-1327632487| ~x$w_buff0_used~0_In-1327632487) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-1327632487| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1327632487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1327632487} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1327632487, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1327632487|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1327632487} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-11-28 18:15:02,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-519503864 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-519503864 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-519503864 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-519503864 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-519503864| ~x$w_buff1_used~0_In-519503864) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-519503864|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-519503864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-519503864, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-519503864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519503864} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-519503864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-519503864, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-519503864|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-519503864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519503864} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-11-28 18:15:02,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1026660069 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1026660069 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1026660069|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1026660069 |ULTIMATE.start_main_#t~ite21_Out-1026660069|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1026660069, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1026660069} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1026660069, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1026660069|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1026660069} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-11-28 18:15:02,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1239706735 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1239706735 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1239706735 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1239706735 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out1239706735| 0)) (and (= ~x$r_buff1_thd0~0_In1239706735 |ULTIMATE.start_main_#t~ite22_Out1239706735|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1239706735, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1239706735, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1239706735, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1239706735} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1239706735, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1239706735, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1239706735, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1239706735|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1239706735} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-11-28 18:15:02,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L810-->L810-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In574818707 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In574818707 256)))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In574818707 256)) .cse0) (= (mod ~x$w_buff0_used~0_In574818707 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In574818707 256)) .cse0))) (= ~x$w_buff1~0_In574818707 |ULTIMATE.start_main_#t~ite31_Out574818707|) .cse1 (= |ULTIMATE.start_main_#t~ite32_Out574818707| |ULTIMATE.start_main_#t~ite31_Out574818707|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite31_In574818707| |ULTIMATE.start_main_#t~ite31_Out574818707|) (= ~x$w_buff1~0_In574818707 |ULTIMATE.start_main_#t~ite32_Out574818707|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In574818707, ~x$w_buff1~0=~x$w_buff1~0_In574818707, ~x$w_buff1_used~0=~x$w_buff1_used~0_In574818707, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In574818707, ~weak$$choice2~0=~weak$$choice2~0_In574818707, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In574818707|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In574818707} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In574818707, ~x$w_buff1~0=~x$w_buff1~0_In574818707, ~x$w_buff1_used~0=~x$w_buff1_used~0_In574818707, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out574818707|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In574818707, ~weak$$choice2~0=~weak$$choice2~0_In574818707, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out574818707|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In574818707} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-11-28 18:15:02,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-26858189 256) 0))) (or (and (= ~x$w_buff1_used~0_In-26858189 |ULTIMATE.start_main_#t~ite37_Out-26858189|) (= |ULTIMATE.start_main_#t~ite38_Out-26858189| |ULTIMATE.start_main_#t~ite37_Out-26858189|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-26858189 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-26858189 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-26858189 256)) (and (= 0 (mod ~x$r_buff1_thd0~0_In-26858189 256)) .cse1)))) (and (not .cse0) (= ~x$w_buff1_used~0_In-26858189 |ULTIMATE.start_main_#t~ite38_Out-26858189|) (= |ULTIMATE.start_main_#t~ite37_In-26858189| |ULTIMATE.start_main_#t~ite37_Out-26858189|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-26858189, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-26858189, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-26858189|, ~weak$$choice2~0=~weak$$choice2~0_In-26858189, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-26858189, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-26858189} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-26858189, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-26858189, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-26858189|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-26858189|, ~weak$$choice2~0=~weak$$choice2~0_In-26858189, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-26858189, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-26858189} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:15:02,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~x$r_buff0_thd0~0_85 v_~x$r_buff0_thd0~0_84)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:15:02,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L816-->L819-1: Formula: (and (= v_~x$mem_tmp~0_16 v_~x~0_122) (not (= 0 (mod v_~x$flush_delayed~0_31 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_30 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ~x~0=v_~x~0_122, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_27|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:15:02,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:15:02,502 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:15:02,502 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:15:02,504 INFO L168 Benchmark]: Toolchain (without parser) took 12921.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 960.4 MB in the beginning and 855.1 MB in the end (delta: 105.3 MB). Peak memory consumption was 437.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:02,504 INFO L168 Benchmark]: CDTParser took 0.80 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:15:02,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:02,506 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.14 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:02,506 INFO L168 Benchmark]: Boogie Preprocessor took 44.53 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:15:02,506 INFO L168 Benchmark]: RCFGBuilder took 807.20 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: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:02,507 INFO L168 Benchmark]: TraceAbstraction took 11067.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.9 MB). Free memory was 1.1 GB in the beginning and 864.7 MB in the end (delta: 186.4 MB). Peak memory consumption was 379.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:02,507 INFO L168 Benchmark]: Witness Printer took 133.55 ms. Allocated memory is still 1.4 GB. Free memory was 864.7 MB in the beginning and 855.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:02,510 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.80 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 787.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.14 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.53 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 807.20 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: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11067.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.9 MB). Free memory was 1.1 GB in the beginning and 864.7 MB in the end (delta: 186.4 MB). Peak memory consumption was 379.3 MB. Max. memory is 11.5 GB. * Witness Printer took 133.55 ms. Allocated memory is still 1.4 GB. Free memory was 864.7 MB in the beginning and 855.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 88 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 3874 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 57 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 45620 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.7s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 950 SDtfs, 883 SDslu, 1557 SDs, 0 SdLazy, 789 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11253occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 1801 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 43975 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...