./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix012_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/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/mix012_rmo.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 113feeaecf8d9417460b2edea2f8119d43f3e77a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 18:03:58,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:03:58,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:03:58,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:03:58,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:03:58,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:03:58,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:03:58,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:03:58,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:03:58,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:03:58,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:03:58,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:03:58,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:03:58,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:03:58,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:03:58,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:03:58,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:03:58,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:03:58,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:03:58,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:03:58,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:03:58,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:03:58,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:03:58,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:03:58,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:03:58,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:03:58,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:03:58,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:03:58,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:03:58,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:03:58,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:03:58,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:03:58,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:03:58,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:03:58,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:03:58,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:03:58,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:03:58,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:03:58,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:03:58,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:03:58,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:03:58,210 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:03:58,225 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:03:58,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:03:58,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:03:58,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:03:58,227 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:03:58,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:03:58,228 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:03:58,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:03:58,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:03:58,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:03:58,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:03:58,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:03:58,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:03:58,230 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:03:58,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:03:58,231 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:03:58,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:03:58,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:03:58,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:03:58,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:03:58,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:03:58,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:03:58,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:03:58,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:03:58,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:03:58,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:03:58,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:03:58,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:03:58,234 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:03:58,235 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 -> 113feeaecf8d9417460b2edea2f8119d43f3e77a [2019-11-28 18:03:58,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:03:58,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:03:58,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:03:58,599 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:03:58,599 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:03:58,601 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix012_rmo.opt.i [2019-11-28 18:03:58,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951320d4e/0e917e81f9a441dca102a4778333127d/FLAGf8a2cff03 [2019-11-28 18:03:59,231 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:03:59,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix012_rmo.opt.i [2019-11-28 18:03:59,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951320d4e/0e917e81f9a441dca102a4778333127d/FLAGf8a2cff03 [2019-11-28 18:03:59,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951320d4e/0e917e81f9a441dca102a4778333127d [2019-11-28 18:03:59,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:03:59,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:03:59,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:03:59,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:03:59,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:03:59,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:03:59" (1/1) ... [2019-11-28 18:03:59,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@332255e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:59, skipping insertion in model container [2019-11-28 18:03:59,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:03:59" (1/1) ... [2019-11-28 18:03:59,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:03:59,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:04:00,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:04:00,174 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:04:00,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:04:00,349 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:04:00,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00 WrapperNode [2019-11-28 18:04:00,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:04:00,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:04:00,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:04:00,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:04:00,361 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:04:00" (1/1) ... [2019-11-28 18:04:00,381 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:04:00" (1/1) ... [2019-11-28 18:04:00,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:04:00,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:04:00,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:04:00,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:04:00,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:04:00,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:04:00,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:04:00,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:04:00,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (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:04:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:04:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:04:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:04:00,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:04:00,548 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:04:00,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:04:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:04:00,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:04:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:04:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:04:00,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:04:00,553 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:04:01,260 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:04:01,261 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:04:01,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:04:01 BoogieIcfgContainer [2019-11-28 18:04:01,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:04:01,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:04:01,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:04:01,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:04:01,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:03:59" (1/3) ... [2019-11-28 18:04:01,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675391e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:04:01, skipping insertion in model container [2019-11-28 18:04:01,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (2/3) ... [2019-11-28 18:04:01,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675391e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:04:01, skipping insertion in model container [2019-11-28 18:04:01,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:04:01" (3/3) ... [2019-11-28 18:04:01,272 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_rmo.opt.i [2019-11-28 18:04:01,283 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:04:01,283 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:04:01,291 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:04:01,293 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:04:01,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,333 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,333 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,345 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,346 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,398 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:04:01,420 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:04:01,421 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:04:01,421 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:04:01,421 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:04:01,422 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:04:01,422 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:04:01,422 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:04:01,422 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:04:01,440 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-11-28 18:04:01,443 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:04:01,526 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:04:01,526 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:04:01,543 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:04:01,569 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:04:01,616 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:04:01,617 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:04:01,628 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:04:01,649 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:04:01,651 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:04:06,705 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:04:06,819 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:04:07,093 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-11-28 18:04:07,094 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-11-28 18:04:07,098 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-11-28 18:04:07,833 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-11-28 18:04:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-11-28 18:04:07,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:04:07,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:07,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:04:07,846 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:07,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:07,854 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-11-28 18:04:07,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:07,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912961223] [2019-11-28 18:04:07,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:08,129 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:04:08,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912961223] [2019-11-28 18:04:08,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:08,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:04:08,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740807468] [2019-11-28 18:04:08,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:04:08,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:08,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:04:08,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:08,157 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-11-28 18:04:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:08,419 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-11-28 18:04:08,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:04:08,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:04:08,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:08,508 INFO L225 Difference]: With dead ends: 8760 [2019-11-28 18:04:08,509 INFO L226 Difference]: Without dead ends: 7798 [2019-11-28 18:04:08,510 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:04:08,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-11-28 18:04:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-11-28 18:04:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-11-28 18:04:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-11-28 18:04:08,991 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-11-28 18:04:08,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:08,992 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-11-28 18:04:08,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:04:08,992 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-11-28 18:04:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:04:08,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:08,996 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:08,997 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:08,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:08,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-11-28 18:04:08,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:08,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031907308] [2019-11-28 18:04:08,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:09,105 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:04:09,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031907308] [2019-11-28 18:04:09,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:09,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:04:09,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436102944] [2019-11-28 18:04:09,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:04:09,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:09,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:04:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:09,112 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 3 states. [2019-11-28 18:04:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:09,154 INFO L93 Difference]: Finished difference Result 1232 states and 2767 transitions. [2019-11-28 18:04:09,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:04:09,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 18:04:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:09,162 INFO L225 Difference]: With dead ends: 1232 [2019-11-28 18:04:09,162 INFO L226 Difference]: Without dead ends: 1232 [2019-11-28 18:04:09,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-11-28 18:04:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-11-28 18:04:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-11-28 18:04:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2767 transitions. [2019-11-28 18:04:09,209 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2767 transitions. Word has length 11 [2019-11-28 18:04:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:09,210 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2767 transitions. [2019-11-28 18:04:09,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:04:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2767 transitions. [2019-11-28 18:04:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:04:09,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:09,217 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:09,217 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:09,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-11-28 18:04:09,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:09,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763268304] [2019-11-28 18:04:09,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:09,522 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:04:09,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763268304] [2019-11-28 18:04:09,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:09,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:04:09,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551666290] [2019-11-28 18:04:09,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:04:09,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:09,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:04:09,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:04:09,525 INFO L87 Difference]: Start difference. First operand 1232 states and 2767 transitions. Second operand 5 states. [2019-11-28 18:04:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:09,858 INFO L93 Difference]: Finished difference Result 1829 states and 4038 transitions. [2019-11-28 18:04:09,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:04:09,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:04:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:09,869 INFO L225 Difference]: With dead ends: 1829 [2019-11-28 18:04:09,869 INFO L226 Difference]: Without dead ends: 1829 [2019-11-28 18:04:09,870 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:04:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-11-28 18:04:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1572. [2019-11-28 18:04:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-11-28 18:04:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-11-28 18:04:09,914 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 14 [2019-11-28 18:04:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:09,915 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-11-28 18:04:09,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:04:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-11-28 18:04:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:04:09,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:09,918 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:09,919 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:09,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:09,919 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-11-28 18:04:09,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:09,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404266189] [2019-11-28 18:04:09,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:10,103 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:04:10,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404266189] [2019-11-28 18:04:10,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:10,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:04:10,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595048055] [2019-11-28 18:04:10,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:04:10,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:10,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:04:10,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:04:10,106 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 6 states. [2019-11-28 18:04:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:10,552 INFO L93 Difference]: Finished difference Result 2337 states and 5011 transitions. [2019-11-28 18:04:10,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:04:10,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 18:04:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:10,566 INFO L225 Difference]: With dead ends: 2337 [2019-11-28 18:04:10,566 INFO L226 Difference]: Without dead ends: 2337 [2019-11-28 18:04:10,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:04:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-11-28 18:04:10,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1705. [2019-11-28 18:04:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-11-28 18:04:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-11-28 18:04:10,612 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-11-28 18:04:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:10,613 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-11-28 18:04:10,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:04:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-11-28 18:04:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:04:10,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:10,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:10,616 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:10,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:10,617 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-11-28 18:04:10,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:10,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21350729] [2019-11-28 18:04:10,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:10,709 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:04:10,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21350729] [2019-11-28 18:04:10,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:10,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:04:10,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188634266] [2019-11-28 18:04:10,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:04:10,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:10,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:04:10,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:04:10,712 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 5 states. [2019-11-28 18:04:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:11,150 INFO L93 Difference]: Finished difference Result 2417 states and 5251 transitions. [2019-11-28 18:04:11,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:04:11,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:04:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:11,167 INFO L225 Difference]: With dead ends: 2417 [2019-11-28 18:04:11,168 INFO L226 Difference]: Without dead ends: 2417 [2019-11-28 18:04:11,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:04:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-11-28 18:04:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2124. [2019-11-28 18:04:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2124 states. [2019-11-28 18:04:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 4675 transitions. [2019-11-28 18:04:11,220 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 4675 transitions. Word has length 26 [2019-11-28 18:04:11,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:11,221 INFO L462 AbstractCegarLoop]: Abstraction has 2124 states and 4675 transitions. [2019-11-28 18:04:11,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:04:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 4675 transitions. [2019-11-28 18:04:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:04:11,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:11,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:11,228 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:11,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:11,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1792140012, now seen corresponding path program 1 times [2019-11-28 18:04:11,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:11,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752032328] [2019-11-28 18:04:11,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:11,322 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:04:11,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752032328] [2019-11-28 18:04:11,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:11,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:04:11,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654372580] [2019-11-28 18:04:11,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:04:11,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:11,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:04:11,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:04:11,325 INFO L87 Difference]: Start difference. First operand 2124 states and 4675 transitions. Second operand 4 states. [2019-11-28 18:04:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:11,349 INFO L93 Difference]: Finished difference Result 2123 states and 4673 transitions. [2019-11-28 18:04:11,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:04:11,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:04:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:11,378 INFO L225 Difference]: With dead ends: 2123 [2019-11-28 18:04:11,379 INFO L226 Difference]: Without dead ends: 2123 [2019-11-28 18:04:11,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:04:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-11-28 18:04:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2123. [2019-11-28 18:04:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2019-11-28 18:04:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 4673 transitions. [2019-11-28 18:04:11,433 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 4673 transitions. Word has length 27 [2019-11-28 18:04:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:11,433 INFO L462 AbstractCegarLoop]: Abstraction has 2123 states and 4673 transitions. [2019-11-28 18:04:11,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:04:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 4673 transitions. [2019-11-28 18:04:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:04:11,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:11,437 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:11,437 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:11,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:11,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1108446324, now seen corresponding path program 1 times [2019-11-28 18:04:11,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:11,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131368498] [2019-11-28 18:04:11,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:11,520 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:04:11,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131368498] [2019-11-28 18:04:11,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:11,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:04:11,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797410963] [2019-11-28 18:04:11,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:04:11,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:11,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:04:11,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:04:11,524 INFO L87 Difference]: Start difference. First operand 2123 states and 4673 transitions. Second operand 4 states. [2019-11-28 18:04:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:11,554 INFO L93 Difference]: Finished difference Result 3561 states and 7879 transitions. [2019-11-28 18:04:11,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:04:11,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:04:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:11,571 INFO L225 Difference]: With dead ends: 3561 [2019-11-28 18:04:11,571 INFO L226 Difference]: Without dead ends: 1721 [2019-11-28 18:04:11,572 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:04:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-11-28 18:04:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1704. [2019-11-28 18:04:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-11-28 18:04:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3701 transitions. [2019-11-28 18:04:11,609 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3701 transitions. Word has length 28 [2019-11-28 18:04:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:11,609 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3701 transitions. [2019-11-28 18:04:11,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:04:11,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3701 transitions. [2019-11-28 18:04:11,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:04:11,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:11,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:11,616 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:11,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:11,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 2 times [2019-11-28 18:04:11,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:11,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695907085] [2019-11-28 18:04:11,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:11,707 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:04:11,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695907085] [2019-11-28 18:04:11,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:11,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:04:11,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514193180] [2019-11-28 18:04:11,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:04:11,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:11,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:04:11,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:04:11,709 INFO L87 Difference]: Start difference. First operand 1704 states and 3701 transitions. Second operand 4 states. [2019-11-28 18:04:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:11,725 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-11-28 18:04:11,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:04:11,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:04:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:11,730 INFO L225 Difference]: With dead ends: 921 [2019-11-28 18:04:11,730 INFO L226 Difference]: Without dead ends: 824 [2019-11-28 18:04:11,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:04:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-11-28 18:04:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-11-28 18:04:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-11-28 18:04:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-11-28 18:04:11,746 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-11-28 18:04:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:11,746 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-11-28 18:04:11,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:04:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-11-28 18:04:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 18:04:11,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:11,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:11,752 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash -317989854, now seen corresponding path program 1 times [2019-11-28 18:04:11,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:11,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840130043] [2019-11-28 18:04:11,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:11,907 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:04:11,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840130043] [2019-11-28 18:04:11,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:11,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:04:11,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468841941] [2019-11-28 18:04:11,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:04:11,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:11,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:04:11,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:04:11,912 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 7 states. [2019-11-28 18:04:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:12,560 INFO L93 Difference]: Finished difference Result 1042 states and 2175 transitions. [2019-11-28 18:04:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:04:12,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-11-28 18:04:12,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:12,565 INFO L225 Difference]: With dead ends: 1042 [2019-11-28 18:04:12,565 INFO L226 Difference]: Without dead ends: 1036 [2019-11-28 18:04:12,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:04:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-11-28 18:04:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 836. [2019-11-28 18:04:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-11-28 18:04:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1763 transitions. [2019-11-28 18:04:12,583 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1763 transitions. Word has length 50 [2019-11-28 18:04:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:12,584 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1763 transitions. [2019-11-28 18:04:12,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:04:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1763 transitions. [2019-11-28 18:04:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 18:04:12,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:12,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:12,587 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:12,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:12,587 INFO L82 PathProgramCache]: Analyzing trace with hash -247031270, now seen corresponding path program 2 times [2019-11-28 18:04:12,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:12,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860782901] [2019-11-28 18:04:12,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:12,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:04:12,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860782901] [2019-11-28 18:04:12,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:12,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:04:12,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251929051] [2019-11-28 18:04:12,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:04:12,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:12,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:04:12,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:12,661 INFO L87 Difference]: Start difference. First operand 836 states and 1763 transitions. Second operand 3 states. [2019-11-28 18:04:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:12,714 INFO L93 Difference]: Finished difference Result 1106 states and 2335 transitions. [2019-11-28 18:04:12,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:04:12,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 18:04:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:12,718 INFO L225 Difference]: With dead ends: 1106 [2019-11-28 18:04:12,718 INFO L226 Difference]: Without dead ends: 1106 [2019-11-28 18:04:12,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-11-28 18:04:12,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 890. [2019-11-28 18:04:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-11-28 18:04:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1895 transitions. [2019-11-28 18:04:12,739 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1895 transitions. Word has length 50 [2019-11-28 18:04:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:12,741 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1895 transitions. [2019-11-28 18:04:12,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:04:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1895 transitions. [2019-11-28 18:04:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:04:12,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:12,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:12,744 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:12,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:12,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1718799888, now seen corresponding path program 1 times [2019-11-28 18:04:12,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:12,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515266967] [2019-11-28 18:04:12,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:12,981 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:04:12,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515266967] [2019-11-28 18:04:12,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:12,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:04:12,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990823489] [2019-11-28 18:04:12,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:04:12,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:12,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:04:12,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:04:12,986 INFO L87 Difference]: Start difference. First operand 890 states and 1895 transitions. Second operand 8 states. [2019-11-28 18:04:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:13,587 INFO L93 Difference]: Finished difference Result 1144 states and 2371 transitions. [2019-11-28 18:04:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:04:13,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-28 18:04:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:13,591 INFO L225 Difference]: With dead ends: 1144 [2019-11-28 18:04:13,591 INFO L226 Difference]: Without dead ends: 1144 [2019-11-28 18:04:13,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:04:13,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-11-28 18:04:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 950. [2019-11-28 18:04:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-28 18:04:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2017 transitions. [2019-11-28 18:04:13,612 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2017 transitions. Word has length 51 [2019-11-28 18:04:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:13,612 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 2017 transitions. [2019-11-28 18:04:13,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:04:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2017 transitions. [2019-11-28 18:04:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:04:13,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:13,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:13,616 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:13,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:13,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2033347596, now seen corresponding path program 2 times [2019-11-28 18:04:13,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:13,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864157323] [2019-11-28 18:04:13,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:13,689 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:04:13,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864157323] [2019-11-28 18:04:13,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:13,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:04:13,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376352565] [2019-11-28 18:04:13,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:04:13,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:13,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:04:13,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:13,692 INFO L87 Difference]: Start difference. First operand 950 states and 2017 transitions. Second operand 3 states. [2019-11-28 18:04:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:13,707 INFO L93 Difference]: Finished difference Result 949 states and 2015 transitions. [2019-11-28 18:04:13,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:04:13,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:04:13,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:13,710 INFO L225 Difference]: With dead ends: 949 [2019-11-28 18:04:13,710 INFO L226 Difference]: Without dead ends: 949 [2019-11-28 18:04:13,711 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:04:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-11-28 18:04:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 795. [2019-11-28 18:04:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-11-28 18:04:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1715 transitions. [2019-11-28 18:04:13,727 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1715 transitions. Word has length 51 [2019-11-28 18:04:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:13,728 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1715 transitions. [2019-11-28 18:04:13,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:04:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1715 transitions. [2019-11-28 18:04:13,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:04:13,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:13,730 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:04:13,731 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:13,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:13,731 INFO L82 PathProgramCache]: Analyzing trace with hash -673987370, now seen corresponding path program 1 times [2019-11-28 18:04:13,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:13,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661540841] [2019-11-28 18:04:13,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:13,831 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:04:13,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661540841] [2019-11-28 18:04:13,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:13,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:04:13,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615407551] [2019-11-28 18:04:13,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:04:13,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:13,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:04:13,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:04:13,833 INFO L87 Difference]: Start difference. First operand 795 states and 1715 transitions. Second operand 7 states. [2019-11-28 18:04:14,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:14,036 INFO L93 Difference]: Finished difference Result 1395 states and 2928 transitions. [2019-11-28 18:04:14,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:04:14,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:04:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:14,040 INFO L225 Difference]: With dead ends: 1395 [2019-11-28 18:04:14,040 INFO L226 Difference]: Without dead ends: 945 [2019-11-28 18:04:14,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:04:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-28 18:04:14,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 789. [2019-11-28 18:04:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-11-28 18:04:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-11-28 18:04:14,058 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 52 [2019-11-28 18:04:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:14,059 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-11-28 18:04:14,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:04:14,059 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-11-28 18:04:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:04:14,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:14,062 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:04:14,062 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:14,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:14,063 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 2 times [2019-11-28 18:04:14,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:14,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410950037] [2019-11-28 18:04:14,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:04:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:04:14,184 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:04:14,184 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:04:14,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27|) |v_ULTIMATE.start_main_~#t315~0.offset_19| 0))) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t315~0.base_27| 4)) (< 0 |v_#StackHeapBarrier_15|) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27| 1)) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27|) 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= 0 |v_ULTIMATE.start_main_~#t315~0.offset_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t315~0.base_27|) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t315~0.offset=|v_ULTIMATE.start_main_~#t315~0.offset_19|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t315~0.base=|v_ULTIMATE.start_main_~#t315~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t315~0.offset, ULTIMATE.start_main_~#t316~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t315~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t316~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:04:14,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t316~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t316~0.base_10|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10|) |v_ULTIMATE.start_main_~#t316~0.offset_9| 1)) |v_#memory_int_5|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t316~0.base_10| 4)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t316~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t316~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t316~0.offset] because there is no mapped edge [2019-11-28 18:04:14,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~x~0_In282342386 ~__unbuffered_p0_EAX~0_Out282342386) (= ~y$r_buff0_thd1~0_In282342386 ~y$r_buff1_thd1~0_Out282342386) (= ~y$r_buff0_thd2~0_In282342386 ~y$r_buff1_thd2~0_Out282342386) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In282342386 0)) (= ~y$r_buff1_thd0~0_Out282342386 ~y$r_buff0_thd0~0_In282342386) (= 1 ~y$r_buff0_thd1~0_Out282342386)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In282342386, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In282342386, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In282342386, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In282342386, ~x~0=~x~0_In282342386} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out282342386, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out282342386, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out282342386, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In282342386, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out282342386, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In282342386, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In282342386, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out282342386, ~x~0=~x~0_In282342386} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:04:14,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In975322841 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In975322841 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out975322841|) (not .cse1)) (and (= ~y$w_buff0_used~0_In975322841 |P0Thread1of1ForFork0_#t~ite5_Out975322841|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In975322841, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In975322841} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out975322841|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In975322841, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In975322841} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:04:14,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In663299160 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In663299160 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In663299160 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In663299160 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out663299160| ~y$w_buff1_used~0_In663299160) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out663299160| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In663299160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In663299160, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In663299160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In663299160} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out663299160|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In663299160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In663299160, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In663299160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In663299160} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:04:14,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_In-224892291 ~y$r_buff0_thd1~0_Out-224892291)) (.cse1 (= (mod ~y$w_buff0_used~0_In-224892291 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-224892291 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out-224892291)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-224892291, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-224892291} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-224892291, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-224892291|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-224892291} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:04:14,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-7211908 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-7211908 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-7211908 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-7211908 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-7211908|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd1~0_In-7211908 |P0Thread1of1ForFork0_#t~ite8_Out-7211908|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-7211908, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-7211908, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-7211908, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-7211908} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-7211908, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-7211908, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-7211908|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-7211908, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-7211908} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:04:14,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:04:14,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1932507350 256)))) (or (and (= ~y$w_buff1~0_In1932507350 |P1Thread1of1ForFork1_#t~ite18_Out1932507350|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In1932507350| |P1Thread1of1ForFork1_#t~ite17_Out1932507350|)) (and (= ~y$w_buff1~0_In1932507350 |P1Thread1of1ForFork1_#t~ite17_Out1932507350|) .cse0 (= |P1Thread1of1ForFork1_#t~ite17_Out1932507350| |P1Thread1of1ForFork1_#t~ite18_Out1932507350|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1932507350 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1932507350 256) 0)) (= (mod ~y$w_buff0_used~0_In1932507350 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In1932507350 256) 0) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1932507350, ~y$w_buff1~0=~y$w_buff1~0_In1932507350, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1932507350, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1932507350, ~weak$$choice2~0=~weak$$choice2~0_In1932507350, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1932507350|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1932507350} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1932507350, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1932507350|, ~y$w_buff1~0=~y$w_buff1~0_In1932507350, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1932507350, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1932507350, ~weak$$choice2~0=~weak$$choice2~0_In1932507350, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1932507350|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1932507350} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:04:14,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In695683056 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In695683056 256) 0))) (or (and .cse0 (= (mod ~y$r_buff1_thd2~0_In695683056 256) 0)) (= (mod ~y$w_buff0_used~0_In695683056 256) 0) (and .cse0 (= (mod ~y$w_buff1_used~0_In695683056 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite21_Out695683056| |P1Thread1of1ForFork1_#t~ite20_Out695683056|) (= |P1Thread1of1ForFork1_#t~ite20_Out695683056| ~y$w_buff0_used~0_In695683056) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite21_Out695683056| ~y$w_buff0_used~0_In695683056) (= |P1Thread1of1ForFork1_#t~ite20_In695683056| |P1Thread1of1ForFork1_#t~ite20_Out695683056|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In695683056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In695683056, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In695683056|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In695683056, ~weak$$choice2~0=~weak$$choice2~0_In695683056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In695683056} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In695683056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In695683056, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out695683056|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In695683056, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out695683056|, ~weak$$choice2~0=~weak$$choice2~0_In695683056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In695683056} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:04:14,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-1530224339| |P1Thread1of1ForFork1_#t~ite24_Out-1530224339|)) (.cse4 (= (mod ~y$w_buff1_used~0_In-1530224339 256) 0)) (.cse5 (= (mod ~y$w_buff0_used~0_In-1530224339 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-1530224339 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1530224339 256) 0)) (.cse1 (= (mod ~weak$$choice2~0_In-1530224339 256) 0))) (or (let ((.cse3 (not .cse6))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-1530224339| |P1Thread1of1ForFork1_#t~ite22_Out-1530224339|) .cse1 (or (not .cse2) .cse3) (or (not .cse4) .cse3) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite22_Out-1530224339| 0))) (and (= |P1Thread1of1ForFork1_#t~ite22_In-1530224339| |P1Thread1of1ForFork1_#t~ite22_Out-1530224339|) (or (and .cse0 (or (and .cse6 .cse4) .cse5 (and .cse6 .cse2)) (= |P1Thread1of1ForFork1_#t~ite23_Out-1530224339| ~y$w_buff1_used~0_In-1530224339) .cse1) (and (= ~y$w_buff1_used~0_In-1530224339 |P1Thread1of1ForFork1_#t~ite24_Out-1530224339|) (= |P1Thread1of1ForFork1_#t~ite23_Out-1530224339| |P1Thread1of1ForFork1_#t~ite23_In-1530224339|) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1530224339, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1530224339, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1530224339, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1530224339|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1530224339|, ~weak$$choice2~0=~weak$$choice2~0_In-1530224339, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1530224339} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1530224339, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1530224339, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1530224339, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1530224339|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1530224339|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1530224339|, ~weak$$choice2~0=~weak$$choice2~0_In-1530224339, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1530224339} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:04:14,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:04:14,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1993494908 256)))) (or (let ((.cse1 (not (= (mod ~y$r_buff0_thd2~0_In-1993494908 256) 0)))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1993494908| |P1Thread1of1ForFork1_#t~ite28_Out-1993494908|) (= |P1Thread1of1ForFork1_#t~ite30_Out-1993494908| |P1Thread1of1ForFork1_#t~ite29_Out-1993494908|) (not (= (mod ~y$w_buff0_used~0_In-1993494908 256) 0)) .cse0 (or (not (= 0 (mod ~y$w_buff1_used~0_In-1993494908 256))) .cse1) (or (not (= 0 (mod ~y$r_buff1_thd2~0_In-1993494908 256))) .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1993494908|))) (and (= |P1Thread1of1ForFork1_#t~ite28_In-1993494908| |P1Thread1of1ForFork1_#t~ite28_Out-1993494908|) (= |P1Thread1of1ForFork1_#t~ite29_In-1993494908| |P1Thread1of1ForFork1_#t~ite29_Out-1993494908|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-1993494908| ~y$r_buff1_thd2~0_In-1993494908)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1993494908, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1993494908|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1993494908, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1993494908, ~weak$$choice2~0=~weak$$choice2~0_In-1993494908, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-1993494908|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1993494908} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1993494908, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1993494908|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1993494908|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1993494908, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1993494908, ~weak$$choice2~0=~weak$$choice2~0_In-1993494908, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1993494908|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1993494908} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:04:14,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:04:14,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-2130428809| |P1Thread1of1ForFork1_#t~ite32_Out-2130428809|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2130428809 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-2130428809 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out-2130428809| ~y$w_buff1~0_In-2130428809)) (and .cse1 (or .cse2 .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-2130428809| ~y~0_In-2130428809)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2130428809, ~y$w_buff1~0=~y$w_buff1~0_In-2130428809, ~y~0=~y~0_In-2130428809, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2130428809} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2130428809, ~y$w_buff1~0=~y$w_buff1~0_In-2130428809, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2130428809|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-2130428809|, ~y~0=~y~0_In-2130428809, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2130428809} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:04:14,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1041052334 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1041052334 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1041052334|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1041052334 |P1Thread1of1ForFork1_#t~ite34_Out-1041052334|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1041052334, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1041052334} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1041052334, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1041052334, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1041052334|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:04:14,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In486092144 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In486092144 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In486092144 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In486092144 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out486092144| ~y$w_buff1_used~0_In486092144) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out486092144|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In486092144, ~y$w_buff0_used~0=~y$w_buff0_used~0_In486092144, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In486092144, ~y$w_buff1_used~0=~y$w_buff1_used~0_In486092144} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In486092144, ~y$w_buff0_used~0=~y$w_buff0_used~0_In486092144, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In486092144, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out486092144|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In486092144} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:04:14,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-884435161 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-884435161 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-884435161| ~y$r_buff0_thd2~0_In-884435161)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-884435161| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-884435161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-884435161} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-884435161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-884435161, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-884435161|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:04:14,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In290271528 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In290271528 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In290271528 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In290271528 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out290271528| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In290271528 |P1Thread1of1ForFork1_#t~ite37_Out290271528|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In290271528, ~y$w_buff0_used~0=~y$w_buff0_used~0_In290271528, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In290271528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In290271528} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In290271528, ~y$w_buff0_used~0=~y$w_buff0_used~0_In290271528, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In290271528, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out290271528|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In290271528} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:04:14,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:04:14,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:04:14,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1065128433 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1065128433 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1065128433| ~y$w_buff1~0_In1065128433)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1065128433| ~y~0_In1065128433)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1065128433, ~y~0=~y~0_In1065128433, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1065128433, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1065128433} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1065128433|, ~y$w_buff1~0=~y$w_buff1~0_In1065128433, ~y~0=~y~0_In1065128433, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1065128433, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1065128433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:04:14,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:04:14,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1338865025 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1338865025 256) 0))) (or (and (= ~y$w_buff0_used~0_In1338865025 |ULTIMATE.start_main_#t~ite42_Out1338865025|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out1338865025| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1338865025, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1338865025} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1338865025, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1338865025, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1338865025|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:04:14,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1734922421 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1734922421 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1734922421 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1734922421 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1734922421| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1734922421| ~y$w_buff1_used~0_In-1734922421)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1734922421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1734922421, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1734922421, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1734922421} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1734922421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1734922421, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1734922421|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1734922421, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1734922421} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:04:14,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In275918280 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In275918280 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out275918280| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out275918280| ~y$r_buff0_thd0~0_In275918280) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In275918280, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In275918280} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In275918280, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In275918280, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out275918280|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:04:14,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1998560433 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1998560433 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1998560433 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1998560433 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1998560433| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1998560433| ~y$r_buff1_thd0~0_In1998560433)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1998560433, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1998560433, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1998560433, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998560433} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1998560433, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1998560433, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1998560433, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1998560433|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998560433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:04:14,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:04:14,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:04:14 BasicIcfg [2019-11-28 18:04:14,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:04:14,273 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:04:14,273 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:04:14,274 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:04:14,274 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:04:01" (3/4) ... [2019-11-28 18:04:14,278 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:04:14,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27|) |v_ULTIMATE.start_main_~#t315~0.offset_19| 0))) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t315~0.base_27| 4)) (< 0 |v_#StackHeapBarrier_15|) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27| 1)) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27|) 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= 0 |v_ULTIMATE.start_main_~#t315~0.offset_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t315~0.base_27|) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t315~0.offset=|v_ULTIMATE.start_main_~#t315~0.offset_19|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t315~0.base=|v_ULTIMATE.start_main_~#t315~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t315~0.offset, ULTIMATE.start_main_~#t316~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t315~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t316~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:04:14,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t316~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t316~0.base_10|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10|) |v_ULTIMATE.start_main_~#t316~0.offset_9| 1)) |v_#memory_int_5|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t316~0.base_10| 4)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t316~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t316~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t316~0.offset] because there is no mapped edge [2019-11-28 18:04:14,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~x~0_In282342386 ~__unbuffered_p0_EAX~0_Out282342386) (= ~y$r_buff0_thd1~0_In282342386 ~y$r_buff1_thd1~0_Out282342386) (= ~y$r_buff0_thd2~0_In282342386 ~y$r_buff1_thd2~0_Out282342386) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In282342386 0)) (= ~y$r_buff1_thd0~0_Out282342386 ~y$r_buff0_thd0~0_In282342386) (= 1 ~y$r_buff0_thd1~0_Out282342386)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In282342386, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In282342386, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In282342386, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In282342386, ~x~0=~x~0_In282342386} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out282342386, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out282342386, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out282342386, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In282342386, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out282342386, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In282342386, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In282342386, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out282342386, ~x~0=~x~0_In282342386} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:04:14,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In975322841 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In975322841 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out975322841|) (not .cse1)) (and (= ~y$w_buff0_used~0_In975322841 |P0Thread1of1ForFork0_#t~ite5_Out975322841|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In975322841, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In975322841} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out975322841|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In975322841, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In975322841} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:04:14,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In663299160 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In663299160 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In663299160 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In663299160 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out663299160| ~y$w_buff1_used~0_In663299160) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out663299160| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In663299160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In663299160, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In663299160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In663299160} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out663299160|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In663299160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In663299160, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In663299160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In663299160} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:04:14,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_In-224892291 ~y$r_buff0_thd1~0_Out-224892291)) (.cse1 (= (mod ~y$w_buff0_used~0_In-224892291 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-224892291 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out-224892291)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-224892291, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-224892291} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-224892291, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-224892291|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-224892291} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:04:14,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-7211908 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-7211908 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-7211908 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-7211908 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-7211908|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd1~0_In-7211908 |P0Thread1of1ForFork0_#t~ite8_Out-7211908|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-7211908, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-7211908, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-7211908, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-7211908} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-7211908, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-7211908, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-7211908|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-7211908, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-7211908} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:04:14,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:04:14,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1932507350 256)))) (or (and (= ~y$w_buff1~0_In1932507350 |P1Thread1of1ForFork1_#t~ite18_Out1932507350|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In1932507350| |P1Thread1of1ForFork1_#t~ite17_Out1932507350|)) (and (= ~y$w_buff1~0_In1932507350 |P1Thread1of1ForFork1_#t~ite17_Out1932507350|) .cse0 (= |P1Thread1of1ForFork1_#t~ite17_Out1932507350| |P1Thread1of1ForFork1_#t~ite18_Out1932507350|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1932507350 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1932507350 256) 0)) (= (mod ~y$w_buff0_used~0_In1932507350 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In1932507350 256) 0) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1932507350, ~y$w_buff1~0=~y$w_buff1~0_In1932507350, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1932507350, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1932507350, ~weak$$choice2~0=~weak$$choice2~0_In1932507350, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1932507350|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1932507350} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1932507350, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1932507350|, ~y$w_buff1~0=~y$w_buff1~0_In1932507350, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1932507350, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1932507350, ~weak$$choice2~0=~weak$$choice2~0_In1932507350, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1932507350|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1932507350} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:04:14,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In695683056 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In695683056 256) 0))) (or (and .cse0 (= (mod ~y$r_buff1_thd2~0_In695683056 256) 0)) (= (mod ~y$w_buff0_used~0_In695683056 256) 0) (and .cse0 (= (mod ~y$w_buff1_used~0_In695683056 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite21_Out695683056| |P1Thread1of1ForFork1_#t~ite20_Out695683056|) (= |P1Thread1of1ForFork1_#t~ite20_Out695683056| ~y$w_buff0_used~0_In695683056) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite21_Out695683056| ~y$w_buff0_used~0_In695683056) (= |P1Thread1of1ForFork1_#t~ite20_In695683056| |P1Thread1of1ForFork1_#t~ite20_Out695683056|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In695683056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In695683056, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In695683056|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In695683056, ~weak$$choice2~0=~weak$$choice2~0_In695683056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In695683056} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In695683056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In695683056, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out695683056|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In695683056, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out695683056|, ~weak$$choice2~0=~weak$$choice2~0_In695683056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In695683056} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:04:14,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-1530224339| |P1Thread1of1ForFork1_#t~ite24_Out-1530224339|)) (.cse4 (= (mod ~y$w_buff1_used~0_In-1530224339 256) 0)) (.cse5 (= (mod ~y$w_buff0_used~0_In-1530224339 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-1530224339 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1530224339 256) 0)) (.cse1 (= (mod ~weak$$choice2~0_In-1530224339 256) 0))) (or (let ((.cse3 (not .cse6))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-1530224339| |P1Thread1of1ForFork1_#t~ite22_Out-1530224339|) .cse1 (or (not .cse2) .cse3) (or (not .cse4) .cse3) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite22_Out-1530224339| 0))) (and (= |P1Thread1of1ForFork1_#t~ite22_In-1530224339| |P1Thread1of1ForFork1_#t~ite22_Out-1530224339|) (or (and .cse0 (or (and .cse6 .cse4) .cse5 (and .cse6 .cse2)) (= |P1Thread1of1ForFork1_#t~ite23_Out-1530224339| ~y$w_buff1_used~0_In-1530224339) .cse1) (and (= ~y$w_buff1_used~0_In-1530224339 |P1Thread1of1ForFork1_#t~ite24_Out-1530224339|) (= |P1Thread1of1ForFork1_#t~ite23_Out-1530224339| |P1Thread1of1ForFork1_#t~ite23_In-1530224339|) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1530224339, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1530224339, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1530224339, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1530224339|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1530224339|, ~weak$$choice2~0=~weak$$choice2~0_In-1530224339, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1530224339} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1530224339, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1530224339, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1530224339, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1530224339|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1530224339|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1530224339|, ~weak$$choice2~0=~weak$$choice2~0_In-1530224339, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1530224339} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:04:14,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:04:14,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1993494908 256)))) (or (let ((.cse1 (not (= (mod ~y$r_buff0_thd2~0_In-1993494908 256) 0)))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1993494908| |P1Thread1of1ForFork1_#t~ite28_Out-1993494908|) (= |P1Thread1of1ForFork1_#t~ite30_Out-1993494908| |P1Thread1of1ForFork1_#t~ite29_Out-1993494908|) (not (= (mod ~y$w_buff0_used~0_In-1993494908 256) 0)) .cse0 (or (not (= 0 (mod ~y$w_buff1_used~0_In-1993494908 256))) .cse1) (or (not (= 0 (mod ~y$r_buff1_thd2~0_In-1993494908 256))) .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1993494908|))) (and (= |P1Thread1of1ForFork1_#t~ite28_In-1993494908| |P1Thread1of1ForFork1_#t~ite28_Out-1993494908|) (= |P1Thread1of1ForFork1_#t~ite29_In-1993494908| |P1Thread1of1ForFork1_#t~ite29_Out-1993494908|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-1993494908| ~y$r_buff1_thd2~0_In-1993494908)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1993494908, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1993494908|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1993494908, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1993494908, ~weak$$choice2~0=~weak$$choice2~0_In-1993494908, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-1993494908|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1993494908} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1993494908, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1993494908|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1993494908|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1993494908, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1993494908, ~weak$$choice2~0=~weak$$choice2~0_In-1993494908, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1993494908|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1993494908} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:04:14,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:04:14,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-2130428809| |P1Thread1of1ForFork1_#t~ite32_Out-2130428809|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2130428809 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-2130428809 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out-2130428809| ~y$w_buff1~0_In-2130428809)) (and .cse1 (or .cse2 .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-2130428809| ~y~0_In-2130428809)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2130428809, ~y$w_buff1~0=~y$w_buff1~0_In-2130428809, ~y~0=~y~0_In-2130428809, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2130428809} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2130428809, ~y$w_buff1~0=~y$w_buff1~0_In-2130428809, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2130428809|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-2130428809|, ~y~0=~y~0_In-2130428809, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2130428809} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:04:14,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1041052334 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1041052334 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1041052334|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1041052334 |P1Thread1of1ForFork1_#t~ite34_Out-1041052334|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1041052334, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1041052334} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1041052334, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1041052334, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1041052334|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:04:14,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In486092144 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In486092144 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In486092144 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In486092144 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out486092144| ~y$w_buff1_used~0_In486092144) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out486092144|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In486092144, ~y$w_buff0_used~0=~y$w_buff0_used~0_In486092144, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In486092144, ~y$w_buff1_used~0=~y$w_buff1_used~0_In486092144} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In486092144, ~y$w_buff0_used~0=~y$w_buff0_used~0_In486092144, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In486092144, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out486092144|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In486092144} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:04:14,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-884435161 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-884435161 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-884435161| ~y$r_buff0_thd2~0_In-884435161)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-884435161| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-884435161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-884435161} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-884435161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-884435161, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-884435161|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:04:14,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In290271528 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In290271528 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In290271528 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In290271528 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out290271528| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In290271528 |P1Thread1of1ForFork1_#t~ite37_Out290271528|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In290271528, ~y$w_buff0_used~0=~y$w_buff0_used~0_In290271528, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In290271528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In290271528} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In290271528, ~y$w_buff0_used~0=~y$w_buff0_used~0_In290271528, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In290271528, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out290271528|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In290271528} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:04:14,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:04:14,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:04:14,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1065128433 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1065128433 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1065128433| ~y$w_buff1~0_In1065128433)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1065128433| ~y~0_In1065128433)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1065128433, ~y~0=~y~0_In1065128433, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1065128433, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1065128433} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1065128433|, ~y$w_buff1~0=~y$w_buff1~0_In1065128433, ~y~0=~y~0_In1065128433, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1065128433, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1065128433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:04:14,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:04:14,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1338865025 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1338865025 256) 0))) (or (and (= ~y$w_buff0_used~0_In1338865025 |ULTIMATE.start_main_#t~ite42_Out1338865025|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out1338865025| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1338865025, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1338865025} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1338865025, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1338865025, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1338865025|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:04:14,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1734922421 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1734922421 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1734922421 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1734922421 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1734922421| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1734922421| ~y$w_buff1_used~0_In-1734922421)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1734922421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1734922421, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1734922421, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1734922421} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1734922421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1734922421, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1734922421|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1734922421, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1734922421} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:04:14,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In275918280 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In275918280 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out275918280| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out275918280| ~y$r_buff0_thd0~0_In275918280) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In275918280, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In275918280} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In275918280, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In275918280, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out275918280|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:04:14,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1998560433 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1998560433 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1998560433 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1998560433 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1998560433| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1998560433| ~y$r_buff1_thd0~0_In1998560433)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1998560433, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1998560433, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1998560433, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998560433} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1998560433, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1998560433, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1998560433, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1998560433|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998560433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:04:14,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:04:14,399 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:04:14,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:04:14,407 INFO L168 Benchmark]: Toolchain (without parser) took 14862.80 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 501.2 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -239.3 MB). Peak memory consumption was 262.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:14,408 INFO L168 Benchmark]: CDTParser took 0.89 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:04:14,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:14,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.84 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:04:14,409 INFO L168 Benchmark]: Boogie Preprocessor took 39.97 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:04:14,410 INFO L168 Benchmark]: RCFGBuilder took 793.05 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.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:14,411 INFO L168 Benchmark]: TraceAbstraction took 13009.17 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 349.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -151.3 MB). Peak memory consumption was 198.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:14,412 INFO L168 Benchmark]: Witness Printer took 126.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:14,421 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.89 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 809.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.84 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 39.97 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 793.05 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.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13009.17 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 349.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -151.3 MB). Peak memory consumption was 198.4 MB. Max. memory is 11.5 GB. * Witness Printer took 126.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1618 SDtfs, 1432 SDslu, 3298 SDs, 0 SdLazy, 2160 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8912occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 2161 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 467 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 402 ConstructedInterpolants, 0 QuantifiedInterpolants, 54920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...