./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/podwr000_tso.oepc.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/podwr000_tso.oepc.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 ebb01fcdd18feaa294052444a4405be118fcc862 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:20:56,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:20:56,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:20:56,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:20:56,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:20:56,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:20:56,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:20:56,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:20:56,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:20:56,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:20:56,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:20:56,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:20:56,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:20:56,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:20:56,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:20:56,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:20:56,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:20:56,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:20:56,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:20:56,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:20:56,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:20:56,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:20:56,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:20:56,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:20:56,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:20:56,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:20:56,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:20:56,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:20:56,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:20:56,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:20:56,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:20:56,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:20:56,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:20:56,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:20:56,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:20:56,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:20:56,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:20:56,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:20:56,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:20:56,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:20:56,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:20:56,260 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:20:56,286 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:20:56,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:20:56,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:20:56,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:20:56,288 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:20:56,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:20:56,289 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:20:56,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:20:56,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:20:56,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:20:56,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:20:56,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:20:56,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:20:56,291 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:20:56,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:20:56,291 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:20:56,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:20:56,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:20:56,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:20:56,292 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:20:56,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:20:56,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:20:56,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:20:56,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:20:56,294 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:20:56,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:20:56,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:20:56,295 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:20:56,295 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:20:56,295 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 -> ebb01fcdd18feaa294052444a4405be118fcc862 [2019-11-28 18:20:56,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:20:56,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:20:56,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:20:56,625 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:20:56,626 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:20:56,627 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/podwr000_tso.oepc.i [2019-11-28 18:20:56,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18f52cdc1/fe3f3963a29f4553bf861b8ca7642854/FLAGba40f078a [2019-11-28 18:20:57,299 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:20:57,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/podwr000_tso.oepc.i [2019-11-28 18:20:57,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18f52cdc1/fe3f3963a29f4553bf861b8ca7642854/FLAGba40f078a [2019-11-28 18:20:57,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18f52cdc1/fe3f3963a29f4553bf861b8ca7642854 [2019-11-28 18:20:57,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:20:57,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:20:57,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:20:57,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:20:57,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:20:57,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:57" (1/1) ... [2019-11-28 18:20:57,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1dbb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:57, skipping insertion in model container [2019-11-28 18:20:57,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:57" (1/1) ... [2019-11-28 18:20:57,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:20:57,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:20:58,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:20:58,182 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:20:58,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:20:58,331 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:20:58,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:58 WrapperNode [2019-11-28 18:20:58,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:20:58,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:20:58,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:20:58,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:20:58,343 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:20:58" (1/1) ... [2019-11-28 18:20:58,367 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:20:58" (1/1) ... [2019-11-28 18:20:58,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:20:58,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:20:58,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:20:58,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:20:58,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:58" (1/1) ... [2019-11-28 18:20:58,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:58" (1/1) ... [2019-11-28 18:20:58,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:58" (1/1) ... [2019-11-28 18:20:58,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:58" (1/1) ... [2019-11-28 18:20:58,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:58" (1/1) ... [2019-11-28 18:20:58,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:58" (1/1) ... [2019-11-28 18:20:58,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:58" (1/1) ... [2019-11-28 18:20:58,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:20:58,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:20:58,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:20:58,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:20:58,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:58" (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:20:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:20:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:20:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:20:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:20:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:20:58,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:20:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:20:58,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:20:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:20:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:20:58,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:20:58,545 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:20:59,202 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:20:59,203 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:20:59,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:59 BoogieIcfgContainer [2019-11-28 18:20:59,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:20:59,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:20:59,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:20:59,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:20:59,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:20:57" (1/3) ... [2019-11-28 18:20:59,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c2defc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:59, skipping insertion in model container [2019-11-28 18:20:59,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:58" (2/3) ... [2019-11-28 18:20:59,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c2defc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:59, skipping insertion in model container [2019-11-28 18:20:59,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:59" (3/3) ... [2019-11-28 18:20:59,214 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_tso.oepc.i [2019-11-28 18:20:59,225 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:20:59,226 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:20:59,234 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:20:59,236 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:20:59,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,275 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,290 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,290 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:59,344 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:20:59,365 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:20:59,365 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:20:59,365 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:20:59,366 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:20:59,366 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:20:59,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:20:59,366 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:20:59,367 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:20:59,389 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:20:59,391 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:20:59,511 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:20:59,512 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:20:59,528 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:20:59,553 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:20:59,598 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:20:59,599 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:20:59,607 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:20:59,627 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:20:59,628 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:21:04,137 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:21:04,270 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:21:04,366 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-11-28 18:21:04,366 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-11-28 18:21:04,390 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-11-28 18:21:04,919 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-11-28 18:21:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-11-28 18:21:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:21:04,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:04,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:21:04,932 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:21:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-11-28 18:21:04,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:04,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565982528] [2019-11-28 18:21:04,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:05,220 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:21:05,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565982528] [2019-11-28 18:21:05,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:05,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:21:05,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044846789] [2019-11-28 18:21:05,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:05,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:05,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:05,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:05,256 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-11-28 18:21:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:05,559 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-11-28 18:21:05,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:05,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:21:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:05,670 INFO L225 Difference]: With dead ends: 8074 [2019-11-28 18:21:05,677 INFO L226 Difference]: Without dead ends: 7606 [2019-11-28 18:21:05,681 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:21:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-11-28 18:21:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-11-28 18:21:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-11-28 18:21:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-11-28 18:21:06,122 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-11-28 18:21:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:06,123 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-11-28 18:21:06,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-11-28 18:21:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:21:06,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:06,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:06,131 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:21:06,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:06,131 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-11-28 18:21:06,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:06,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917671251] [2019-11-28 18:21:06,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:06,267 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:21:06,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917671251] [2019-11-28 18:21:06,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:06,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:06,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236362200] [2019-11-28 18:21:06,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:21:06,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:06,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:21:06,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:21:06,271 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-11-28 18:21:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:06,676 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-11-28 18:21:06,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:21:06,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:21:06,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:06,750 INFO L225 Difference]: With dead ends: 11630 [2019-11-28 18:21:06,751 INFO L226 Difference]: Without dead ends: 11623 [2019-11-28 18:21:06,752 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:21:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-11-28 18:21:07,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-11-28 18:21:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-11-28 18:21:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-11-28 18:21:07,358 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-11-28 18:21:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:07,360 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-11-28 18:21:07,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:21:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-11-28 18:21:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:21:07,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:07,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:07,367 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:21:07,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:07,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-11-28 18:21:07,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:07,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561560261] [2019-11-28 18:21:07,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:07,448 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:21:07,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561560261] [2019-11-28 18:21:07,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:07,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:07,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569688007] [2019-11-28 18:21:07,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:07,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:07,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:07,452 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-11-28 18:21:07,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:07,808 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-11-28 18:21:07,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:21:07,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:21:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:07,857 INFO L225 Difference]: With dead ends: 14471 [2019-11-28 18:21:07,858 INFO L226 Difference]: Without dead ends: 14471 [2019-11-28 18:21:07,858 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:21:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-11-28 18:21:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-11-28 18:21:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-11-28 18:21:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-11-28 18:21:08,261 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-11-28 18:21:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:08,263 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-11-28 18:21:08,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-11-28 18:21:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:21:08,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:08,267 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:08,268 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:21:08,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:08,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-11-28 18:21:08,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:08,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461642322] [2019-11-28 18:21:08,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:08,361 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:21:08,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461642322] [2019-11-28 18:21:08,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:08,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:08,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301029430] [2019-11-28 18:21:08,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:08,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:08,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:08,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:08,363 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-11-28 18:21:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:08,424 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-11-28 18:21:08,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:08,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:21:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:08,462 INFO L225 Difference]: With dead ends: 10750 [2019-11-28 18:21:08,462 INFO L226 Difference]: Without dead ends: 10750 [2019-11-28 18:21:08,462 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:21:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-11-28 18:21:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-11-28 18:21:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-11-28 18:21:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-11-28 18:21:08,745 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-11-28 18:21:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:08,745 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-11-28 18:21:08,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-11-28 18:21:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:21:08,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:08,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:08,749 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:21:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-11-28 18:21:08,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:08,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059801860] [2019-11-28 18:21:08,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:08,845 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:21:08,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059801860] [2019-11-28 18:21:08,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:08,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:08,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570046227] [2019-11-28 18:21:08,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:21:08,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:08,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:21:08,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:21:08,848 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-11-28 18:21:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:08,879 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-11-28 18:21:08,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:21:08,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:21:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:08,884 INFO L225 Difference]: With dead ends: 2054 [2019-11-28 18:21:08,885 INFO L226 Difference]: Without dead ends: 1457 [2019-11-28 18:21:08,885 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:21:08,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-11-28 18:21:08,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-11-28 18:21:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-11-28 18:21:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-11-28 18:21:08,910 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-11-28 18:21:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:08,911 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-11-28 18:21:08,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:21:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-11-28 18:21:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:21:08,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:08,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:08,914 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:21:08,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-11-28 18:21:08,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:08,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811572297] [2019-11-28 18:21:08,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:09,008 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:21:09,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811572297] [2019-11-28 18:21:09,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:09,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:21:09,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768553676] [2019-11-28 18:21:09,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:21:09,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:09,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:21:09,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:21:09,010 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-11-28 18:21:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:09,387 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-11-28 18:21:09,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:21:09,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 18:21:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:09,393 INFO L225 Difference]: With dead ends: 2249 [2019-11-28 18:21:09,393 INFO L226 Difference]: Without dead ends: 2197 [2019-11-28 18:21:09,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:21:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-11-28 18:21:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-11-28 18:21:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-28 18:21:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-11-28 18:21:09,525 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-11-28 18:21:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:09,525 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-11-28 18:21:09,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:21:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-11-28 18:21:09,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:21:09,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:09,530 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:21:09,530 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:21:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:09,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-11-28 18:21:09,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:09,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925695304] [2019-11-28 18:21:09,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:09,633 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:21:09,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925695304] [2019-11-28 18:21:09,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:09,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:21:09,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426820709] [2019-11-28 18:21:09,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:09,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:09,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:09,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:09,637 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 5 states. [2019-11-28 18:21:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:09,680 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-11-28 18:21:09,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:21:09,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:21:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:09,683 INFO L225 Difference]: With dead ends: 752 [2019-11-28 18:21:09,683 INFO L226 Difference]: Without dead ends: 689 [2019-11-28 18:21:09,683 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:21:09,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-11-28 18:21:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-11-28 18:21:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-28 18:21:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-11-28 18:21:09,695 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-11-28 18:21:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:09,695 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-11-28 18:21:09,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-11-28 18:21:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:21:09,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:09,702 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:21:09,703 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:21:09,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:09,703 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-11-28 18:21:09,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:09,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226971178] [2019-11-28 18:21:09,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:09,822 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:21:09,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226971178] [2019-11-28 18:21:09,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:09,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:21:09,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362491205] [2019-11-28 18:21:09,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:09,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:09,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:09,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:09,824 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 5 states. [2019-11-28 18:21:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:10,189 INFO L93 Difference]: Finished difference Result 1105 states and 2341 transitions. [2019-11-28 18:21:10,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:21:10,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-28 18:21:10,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:10,193 INFO L225 Difference]: With dead ends: 1105 [2019-11-28 18:21:10,193 INFO L226 Difference]: Without dead ends: 1105 [2019-11-28 18:21:10,193 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:21:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-11-28 18:21:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 896. [2019-11-28 18:21:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-11-28 18:21:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1944 transitions. [2019-11-28 18:21:10,210 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1944 transitions. Word has length 51 [2019-11-28 18:21:10,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:10,210 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1944 transitions. [2019-11-28 18:21:10,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1944 transitions. [2019-11-28 18:21:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:21:10,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:10,216 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:21:10,217 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:21:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:10,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1015680243, now seen corresponding path program 2 times [2019-11-28 18:21:10,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:10,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225510289] [2019-11-28 18:21:10,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:10,294 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:21:10,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225510289] [2019-11-28 18:21:10,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:10,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:10,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176519857] [2019-11-28 18:21:10,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:10,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:10,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:10,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:10,297 INFO L87 Difference]: Start difference. First operand 896 states and 1944 transitions. Second operand 3 states. [2019-11-28 18:21:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:10,351 INFO L93 Difference]: Finished difference Result 1184 states and 2559 transitions. [2019-11-28 18:21:10,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:10,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:21:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:10,355 INFO L225 Difference]: With dead ends: 1184 [2019-11-28 18:21:10,355 INFO L226 Difference]: Without dead ends: 1184 [2019-11-28 18:21:10,356 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:21:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-11-28 18:21:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 956. [2019-11-28 18:21:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-28 18:21:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2092 transitions. [2019-11-28 18:21:10,372 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2092 transitions. Word has length 51 [2019-11-28 18:21:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:10,372 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2092 transitions. [2019-11-28 18:21:10,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2092 transitions. [2019-11-28 18:21:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:10,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:10,375 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:21:10,375 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:21:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:10,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-11-28 18:21:10,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:10,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698412396] [2019-11-28 18:21:10,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:10,557 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:21:10,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698412396] [2019-11-28 18:21:10,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:10,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:21:10,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626504882] [2019-11-28 18:21:10,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:10,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:10,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:10,561 INFO L87 Difference]: Start difference. First operand 956 states and 2092 transitions. Second operand 5 states. [2019-11-28 18:21:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:10,582 INFO L93 Difference]: Finished difference Result 1646 states and 3628 transitions. [2019-11-28 18:21:10,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:21:10,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-28 18:21:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:10,585 INFO L225 Difference]: With dead ends: 1646 [2019-11-28 18:21:10,585 INFO L226 Difference]: Without dead ends: 759 [2019-11-28 18:21:10,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:21:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-11-28 18:21:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2019-11-28 18:21:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-11-28 18:21:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1666 transitions. [2019-11-28 18:21:10,598 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1666 transitions. Word has length 52 [2019-11-28 18:21:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:10,598 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1666 transitions. [2019-11-28 18:21:10,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1666 transitions. [2019-11-28 18:21:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:10,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:10,602 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:21:10,602 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:21:10,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:10,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 2 times [2019-11-28 18:21:10,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:10,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431689845] [2019-11-28 18:21:10,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:11,027 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:21:11,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431689845] [2019-11-28 18:21:11,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:11,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:21:11,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668559127] [2019-11-28 18:21:11,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:21:11,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:11,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:21:11,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:21:11,030 INFO L87 Difference]: Start difference. First operand 759 states and 1666 transitions. Second operand 13 states. [2019-11-28 18:21:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:12,434 INFO L93 Difference]: Finished difference Result 1086 states and 2309 transitions. [2019-11-28 18:21:12,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 18:21:12,434 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-11-28 18:21:12,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:12,436 INFO L225 Difference]: With dead ends: 1086 [2019-11-28 18:21:12,436 INFO L226 Difference]: Without dead ends: 865 [2019-11-28 18:21:12,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-11-28 18:21:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-11-28 18:21:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 790. [2019-11-28 18:21:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 18:21:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1740 transitions. [2019-11-28 18:21:12,450 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1740 transitions. Word has length 52 [2019-11-28 18:21:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:12,451 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1740 transitions. [2019-11-28 18:21:12,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:21:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1740 transitions. [2019-11-28 18:21:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:12,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:12,453 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:21:12,453 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:21:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash 925896582, now seen corresponding path program 3 times [2019-11-28 18:21:12,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:12,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412865848] [2019-11-28 18:21:12,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:12,570 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:21:12,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412865848] [2019-11-28 18:21:12,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:12,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:21:12,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344376010] [2019-11-28 18:21:12,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:21:12,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:12,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:21:12,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:21:12,574 INFO L87 Difference]: Start difference. First operand 790 states and 1740 transitions. Second operand 7 states. [2019-11-28 18:21:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:12,765 INFO L93 Difference]: Finished difference Result 1290 states and 2749 transitions. [2019-11-28 18:21:12,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:21:12,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:21:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:12,767 INFO L225 Difference]: With dead ends: 1290 [2019-11-28 18:21:12,767 INFO L226 Difference]: Without dead ends: 919 [2019-11-28 18:21:12,768 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:21:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-11-28 18:21:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 754. [2019-11-28 18:21:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-11-28 18:21:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-11-28 18:21:12,787 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 52 [2019-11-28 18:21:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:12,787 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-11-28 18:21:12,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:21:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-11-28 18:21:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:12,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:12,791 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:21:12,791 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:21:12,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:12,792 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 4 times [2019-11-28 18:21:12,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:12,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973587455] [2019-11-28 18:21:12,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:21:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:21:12,920 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:21:12,921 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:21:12,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= (select .cse0 |v_ULTIMATE.start_main_~#t1557~0.base_40|) 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1557~0.base_40| 1)) (= v_~y$read_delayed~0_6 0) (= |v_ULTIMATE.start_main_~#t1557~0.offset_27| 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1557~0.base_40| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1557~0.base_40|) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1557~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1557~0.base_40|) |v_ULTIMATE.start_main_~#t1557~0.offset_27| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1557~0.offset=|v_ULTIMATE.start_main_~#t1557~0.offset_27|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1558~0.base=|v_ULTIMATE.start_main_~#t1558~0.base_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t1558~0.offset=|v_ULTIMATE.start_main_~#t1558~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_~#t1557~0.base=|v_ULTIMATE.start_main_~#t1557~0.base_40|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1557~0.offset, ~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, ULTIMATE.start_main_~#t1558~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1558~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1557~0.base, 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:21:12,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_ULTIMATE.start_main_~#t1558~0.offset_11| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1558~0.base_13|) 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1558~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1558~0.base_13|) |v_ULTIMATE.start_main_~#t1558~0.offset_11| 1))) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1558~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1558~0.base_13|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1558~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1558~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1558~0.base=|v_ULTIMATE.start_main_~#t1558~0.base_13|, ULTIMATE.start_main_~#t1558~0.offset=|v_ULTIMATE.start_main_~#t1558~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1558~0.base, ULTIMATE.start_main_~#t1558~0.offset] because there is no mapped edge [2019-11-28 18:21:12,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1009985364 0)) (= 1 ~y$r_buff0_thd1~0_Out-1009985364) (= ~x~0_In-1009985364 ~__unbuffered_p0_EAX~0_Out-1009985364) (= ~y$r_buff0_thd1~0_In-1009985364 ~y$r_buff1_thd1~0_Out-1009985364) (= ~y$r_buff1_thd0~0_Out-1009985364 ~y$r_buff0_thd0~0_In-1009985364) (= ~y$r_buff1_thd2~0_Out-1009985364 ~y$r_buff0_thd2~0_In-1009985364)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1009985364, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1009985364, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1009985364, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1009985364, ~x~0=~x~0_In-1009985364} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1009985364, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1009985364, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1009985364, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1009985364, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1009985364, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1009985364, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1009985364, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1009985364, ~x~0=~x~0_In-1009985364} 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:21:12,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1322696034 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1322696034 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1322696034| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1322696034| ~y$w_buff0_used~0_In1322696034)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1322696034, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1322696034} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1322696034|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1322696034, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1322696034} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:21:12,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1502432084 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out1502432084| ~y$w_buff0_used~0_In1502432084) (= |P1Thread1of1ForFork1_#t~ite20_In1502432084| |P1Thread1of1ForFork1_#t~ite20_Out1502432084|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out1502432084| |P1Thread1of1ForFork1_#t~ite21_Out1502432084|) (= |P1Thread1of1ForFork1_#t~ite20_Out1502432084| ~y$w_buff0_used~0_In1502432084) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1502432084 256)))) (or (and (= (mod ~y$w_buff1_used~0_In1502432084 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In1502432084 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1502432084 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1502432084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1502432084, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1502432084|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1502432084, ~weak$$choice2~0=~weak$$choice2~0_In1502432084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1502432084} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1502432084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1502432084, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1502432084|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1502432084, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1502432084|, ~weak$$choice2~0=~weak$$choice2~0_In1502432084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1502432084} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:21:12,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse5 (= (mod ~y$w_buff0_used~0_In92150146 256) 0)) (.cse4 (= (mod ~y$w_buff1_used~0_In92150146 256) 0)) (.cse0 (= (mod ~weak$$choice2~0_In92150146 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out92150146| |P1Thread1of1ForFork1_#t~ite23_Out92150146|)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In92150146 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In92150146 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In92150146| |P1Thread1of1ForFork1_#t~ite22_Out92150146|) (or (and .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out92150146| ~y$w_buff1_used~0_In92150146) (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5)) (and (= |P1Thread1of1ForFork1_#t~ite24_Out92150146| ~y$w_buff1_used~0_In92150146) (= |P1Thread1of1ForFork1_#t~ite23_In92150146| |P1Thread1of1ForFork1_#t~ite23_Out92150146|) (not .cse0)))) (let ((.cse6 (not .cse3))) (and (not .cse5) (or .cse6 (not .cse4)) .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out92150146| |P1Thread1of1ForFork1_#t~ite22_Out92150146|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out92150146|) (or .cse6 (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In92150146, ~y$w_buff0_used~0=~y$w_buff0_used~0_In92150146, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In92150146, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In92150146|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In92150146|, ~weak$$choice2~0=~weak$$choice2~0_In92150146, ~y$w_buff1_used~0=~y$w_buff1_used~0_In92150146} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In92150146, ~y$w_buff0_used~0=~y$w_buff0_used~0_In92150146, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In92150146, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out92150146|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out92150146|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out92150146|, ~weak$$choice2~0=~weak$$choice2~0_In92150146, ~y$w_buff1_used~0=~y$w_buff1_used~0_In92150146} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:21:12,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-527558954 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-527558954 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-527558954 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-527558954 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-527558954| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-527558954 |P0Thread1of1ForFork0_#t~ite6_Out-527558954|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-527558954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527558954, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-527558954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527558954} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-527558954|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-527558954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527558954, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-527558954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527558954} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:21:12,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1185359778 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1185359778 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_In-1185359778 ~y$r_buff0_thd1~0_Out-1185359778))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-1185359778)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1185359778, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1185359778} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1185359778, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1185359778|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1185359778} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:21:12,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In164025500 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In164025500 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In164025500 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In164025500 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out164025500| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out164025500| ~y$r_buff1_thd1~0_In164025500)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In164025500, ~y$w_buff0_used~0=~y$w_buff0_used~0_In164025500, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In164025500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In164025500} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In164025500, ~y$w_buff0_used~0=~y$w_buff0_used~0_In164025500, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out164025500|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In164025500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In164025500} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:21:12,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} 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:21:12,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2142126869 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out2142126869| |P1Thread1of1ForFork1_#t~ite29_Out2142126869|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In2142126869 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In2142126869 256)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In2142126869 256) 0)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In2142126869 256))))) (= ~y$r_buff1_thd2~0_In2142126869 |P1Thread1of1ForFork1_#t~ite29_Out2142126869|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite29_In2142126869| |P1Thread1of1ForFork1_#t~ite29_Out2142126869|) (= ~y$r_buff1_thd2~0_In2142126869 |P1Thread1of1ForFork1_#t~ite30_Out2142126869|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2142126869, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In2142126869|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2142126869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2142126869, ~weak$$choice2~0=~weak$$choice2~0_In2142126869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142126869} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2142126869, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2142126869|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2142126869|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2142126869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2142126869, ~weak$$choice2~0=~weak$$choice2~0_In2142126869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142126869} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:21:12,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:21:12,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-2123256054 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-2123256054 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-2123256054| ~y~0_In-2123256054) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-2123256054| ~y$w_buff1~0_In-2123256054)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2123256054, ~y$w_buff1~0=~y$w_buff1~0_In-2123256054, ~y~0=~y~0_In-2123256054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2123256054} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2123256054, ~y$w_buff1~0=~y$w_buff1~0_In-2123256054, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2123256054|, ~y~0=~y~0_In-2123256054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2123256054} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:21:12,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:21:12,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In186715090 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In186715090 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out186715090| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out186715090| ~y$w_buff0_used~0_In186715090) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In186715090, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In186715090} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In186715090, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In186715090, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out186715090|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:21:12,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In597651315 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In597651315 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In597651315 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In597651315 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out597651315|)) (and (= ~y$w_buff1_used~0_In597651315 |P1Thread1of1ForFork1_#t~ite35_Out597651315|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In597651315, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597651315, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In597651315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597651315} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In597651315, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597651315, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In597651315, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out597651315|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597651315} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:21:12,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-243861391 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-243861391 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-243861391|) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-243861391 |P1Thread1of1ForFork1_#t~ite36_Out-243861391|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-243861391, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-243861391} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-243861391, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-243861391, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-243861391|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:21:12,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In302910712 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In302910712 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In302910712 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In302910712 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out302910712|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In302910712 |P1Thread1of1ForFork1_#t~ite37_Out302910712|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In302910712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In302910712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In302910712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In302910712} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In302910712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In302910712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In302910712, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out302910712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In302910712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:21:12,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} 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:21:12,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} 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:21:12,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:21:12,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1093731229 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1093731229 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1093731229| ~y$w_buff1~0_In1093731229)) (and (= |ULTIMATE.start_main_#t~ite40_Out1093731229| ~y~0_In1093731229) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1093731229, ~y~0=~y~0_In1093731229, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1093731229, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1093731229} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1093731229|, ~y$w_buff1~0=~y$w_buff1~0_In1093731229, ~y~0=~y~0_In1093731229, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1093731229, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1093731229} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:21:12,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:21:12,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1253032305 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1253032305 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1253032305 |ULTIMATE.start_main_#t~ite42_Out-1253032305|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1253032305|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1253032305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1253032305} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1253032305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1253032305, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1253032305|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:21:12,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In98625338 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In98625338 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In98625338 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In98625338 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In98625338 |ULTIMATE.start_main_#t~ite43_Out98625338|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out98625338|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In98625338, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In98625338, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In98625338, ~y$w_buff1_used~0=~y$w_buff1_used~0_In98625338} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In98625338, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In98625338, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out98625338|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In98625338, ~y$w_buff1_used~0=~y$w_buff1_used~0_In98625338} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:21:12,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-826277999 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-826277999 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-826277999| ~y$r_buff0_thd0~0_In-826277999) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-826277999| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-826277999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-826277999} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-826277999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-826277999, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-826277999|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:21:12,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In128300786 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In128300786 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In128300786 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In128300786 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out128300786| ~y$r_buff1_thd0~0_In128300786)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite45_Out128300786| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In128300786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In128300786, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In128300786, ~y$w_buff1_used~0=~y$w_buff1_used~0_In128300786} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In128300786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In128300786, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In128300786, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out128300786|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In128300786} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:21:12,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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:21:13,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:21:13 BasicIcfg [2019-11-28 18:21:13,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:21:13,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:21:13,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:21:13,038 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:21:13,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:59" (3/4) ... [2019-11-28 18:21:13,041 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:21:13,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= (select .cse0 |v_ULTIMATE.start_main_~#t1557~0.base_40|) 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1557~0.base_40| 1)) (= v_~y$read_delayed~0_6 0) (= |v_ULTIMATE.start_main_~#t1557~0.offset_27| 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1557~0.base_40| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1557~0.base_40|) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1557~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1557~0.base_40|) |v_ULTIMATE.start_main_~#t1557~0.offset_27| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1557~0.offset=|v_ULTIMATE.start_main_~#t1557~0.offset_27|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1558~0.base=|v_ULTIMATE.start_main_~#t1558~0.base_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t1558~0.offset=|v_ULTIMATE.start_main_~#t1558~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_~#t1557~0.base=|v_ULTIMATE.start_main_~#t1557~0.base_40|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1557~0.offset, ~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, ULTIMATE.start_main_~#t1558~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1558~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1557~0.base, 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:21:13,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_ULTIMATE.start_main_~#t1558~0.offset_11| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1558~0.base_13|) 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1558~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1558~0.base_13|) |v_ULTIMATE.start_main_~#t1558~0.offset_11| 1))) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1558~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1558~0.base_13|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1558~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1558~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1558~0.base=|v_ULTIMATE.start_main_~#t1558~0.base_13|, ULTIMATE.start_main_~#t1558~0.offset=|v_ULTIMATE.start_main_~#t1558~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1558~0.base, ULTIMATE.start_main_~#t1558~0.offset] because there is no mapped edge [2019-11-28 18:21:13,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1009985364 0)) (= 1 ~y$r_buff0_thd1~0_Out-1009985364) (= ~x~0_In-1009985364 ~__unbuffered_p0_EAX~0_Out-1009985364) (= ~y$r_buff0_thd1~0_In-1009985364 ~y$r_buff1_thd1~0_Out-1009985364) (= ~y$r_buff1_thd0~0_Out-1009985364 ~y$r_buff0_thd0~0_In-1009985364) (= ~y$r_buff1_thd2~0_Out-1009985364 ~y$r_buff0_thd2~0_In-1009985364)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1009985364, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1009985364, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1009985364, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1009985364, ~x~0=~x~0_In-1009985364} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1009985364, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1009985364, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1009985364, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1009985364, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1009985364, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1009985364, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1009985364, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1009985364, ~x~0=~x~0_In-1009985364} 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:21:13,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1322696034 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1322696034 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1322696034| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1322696034| ~y$w_buff0_used~0_In1322696034)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1322696034, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1322696034} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1322696034|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1322696034, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1322696034} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:21:13,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1502432084 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out1502432084| ~y$w_buff0_used~0_In1502432084) (= |P1Thread1of1ForFork1_#t~ite20_In1502432084| |P1Thread1of1ForFork1_#t~ite20_Out1502432084|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out1502432084| |P1Thread1of1ForFork1_#t~ite21_Out1502432084|) (= |P1Thread1of1ForFork1_#t~ite20_Out1502432084| ~y$w_buff0_used~0_In1502432084) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1502432084 256)))) (or (and (= (mod ~y$w_buff1_used~0_In1502432084 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In1502432084 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1502432084 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1502432084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1502432084, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1502432084|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1502432084, ~weak$$choice2~0=~weak$$choice2~0_In1502432084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1502432084} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1502432084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1502432084, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1502432084|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1502432084, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1502432084|, ~weak$$choice2~0=~weak$$choice2~0_In1502432084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1502432084} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:21:13,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse5 (= (mod ~y$w_buff0_used~0_In92150146 256) 0)) (.cse4 (= (mod ~y$w_buff1_used~0_In92150146 256) 0)) (.cse0 (= (mod ~weak$$choice2~0_In92150146 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out92150146| |P1Thread1of1ForFork1_#t~ite23_Out92150146|)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In92150146 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In92150146 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In92150146| |P1Thread1of1ForFork1_#t~ite22_Out92150146|) (or (and .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out92150146| ~y$w_buff1_used~0_In92150146) (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5)) (and (= |P1Thread1of1ForFork1_#t~ite24_Out92150146| ~y$w_buff1_used~0_In92150146) (= |P1Thread1of1ForFork1_#t~ite23_In92150146| |P1Thread1of1ForFork1_#t~ite23_Out92150146|) (not .cse0)))) (let ((.cse6 (not .cse3))) (and (not .cse5) (or .cse6 (not .cse4)) .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out92150146| |P1Thread1of1ForFork1_#t~ite22_Out92150146|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out92150146|) (or .cse6 (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In92150146, ~y$w_buff0_used~0=~y$w_buff0_used~0_In92150146, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In92150146, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In92150146|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In92150146|, ~weak$$choice2~0=~weak$$choice2~0_In92150146, ~y$w_buff1_used~0=~y$w_buff1_used~0_In92150146} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In92150146, ~y$w_buff0_used~0=~y$w_buff0_used~0_In92150146, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In92150146, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out92150146|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out92150146|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out92150146|, ~weak$$choice2~0=~weak$$choice2~0_In92150146, ~y$w_buff1_used~0=~y$w_buff1_used~0_In92150146} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:21:13,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-527558954 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-527558954 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-527558954 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-527558954 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-527558954| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-527558954 |P0Thread1of1ForFork0_#t~ite6_Out-527558954|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-527558954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527558954, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-527558954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527558954} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-527558954|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-527558954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527558954, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-527558954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527558954} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:21:13,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1185359778 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1185359778 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_In-1185359778 ~y$r_buff0_thd1~0_Out-1185359778))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-1185359778)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1185359778, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1185359778} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1185359778, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1185359778|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1185359778} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:21:13,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In164025500 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In164025500 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In164025500 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In164025500 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out164025500| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out164025500| ~y$r_buff1_thd1~0_In164025500)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In164025500, ~y$w_buff0_used~0=~y$w_buff0_used~0_In164025500, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In164025500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In164025500} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In164025500, ~y$w_buff0_used~0=~y$w_buff0_used~0_In164025500, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out164025500|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In164025500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In164025500} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:21:13,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} 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:21:13,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2142126869 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out2142126869| |P1Thread1of1ForFork1_#t~ite29_Out2142126869|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In2142126869 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In2142126869 256)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In2142126869 256) 0)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In2142126869 256))))) (= ~y$r_buff1_thd2~0_In2142126869 |P1Thread1of1ForFork1_#t~ite29_Out2142126869|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite29_In2142126869| |P1Thread1of1ForFork1_#t~ite29_Out2142126869|) (= ~y$r_buff1_thd2~0_In2142126869 |P1Thread1of1ForFork1_#t~ite30_Out2142126869|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2142126869, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In2142126869|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2142126869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2142126869, ~weak$$choice2~0=~weak$$choice2~0_In2142126869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142126869} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2142126869, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2142126869|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2142126869|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2142126869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2142126869, ~weak$$choice2~0=~weak$$choice2~0_In2142126869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142126869} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:21:13,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:21:13,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-2123256054 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-2123256054 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-2123256054| ~y~0_In-2123256054) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-2123256054| ~y$w_buff1~0_In-2123256054)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2123256054, ~y$w_buff1~0=~y$w_buff1~0_In-2123256054, ~y~0=~y~0_In-2123256054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2123256054} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2123256054, ~y$w_buff1~0=~y$w_buff1~0_In-2123256054, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2123256054|, ~y~0=~y~0_In-2123256054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2123256054} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:21:13,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:21:13,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In186715090 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In186715090 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out186715090| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out186715090| ~y$w_buff0_used~0_In186715090) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In186715090, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In186715090} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In186715090, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In186715090, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out186715090|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:21:13,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In597651315 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In597651315 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In597651315 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In597651315 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out597651315|)) (and (= ~y$w_buff1_used~0_In597651315 |P1Thread1of1ForFork1_#t~ite35_Out597651315|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In597651315, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597651315, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In597651315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597651315} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In597651315, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597651315, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In597651315, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out597651315|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597651315} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:21:13,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-243861391 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-243861391 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-243861391|) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-243861391 |P1Thread1of1ForFork1_#t~ite36_Out-243861391|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-243861391, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-243861391} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-243861391, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-243861391, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-243861391|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:21:13,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In302910712 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In302910712 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In302910712 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In302910712 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out302910712|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In302910712 |P1Thread1of1ForFork1_#t~ite37_Out302910712|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In302910712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In302910712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In302910712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In302910712} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In302910712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In302910712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In302910712, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out302910712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In302910712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:21:13,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} 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:21:13,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} 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:21:13,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:21:13,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1093731229 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1093731229 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1093731229| ~y$w_buff1~0_In1093731229)) (and (= |ULTIMATE.start_main_#t~ite40_Out1093731229| ~y~0_In1093731229) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1093731229, ~y~0=~y~0_In1093731229, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1093731229, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1093731229} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1093731229|, ~y$w_buff1~0=~y$w_buff1~0_In1093731229, ~y~0=~y~0_In1093731229, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1093731229, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1093731229} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:21:13,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:21:13,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1253032305 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1253032305 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1253032305 |ULTIMATE.start_main_#t~ite42_Out-1253032305|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1253032305|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1253032305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1253032305} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1253032305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1253032305, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1253032305|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:21:13,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In98625338 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In98625338 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In98625338 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In98625338 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In98625338 |ULTIMATE.start_main_#t~ite43_Out98625338|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out98625338|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In98625338, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In98625338, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In98625338, ~y$w_buff1_used~0=~y$w_buff1_used~0_In98625338} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In98625338, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In98625338, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out98625338|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In98625338, ~y$w_buff1_used~0=~y$w_buff1_used~0_In98625338} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:21:13,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-826277999 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-826277999 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-826277999| ~y$r_buff0_thd0~0_In-826277999) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-826277999| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-826277999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-826277999} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-826277999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-826277999, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-826277999|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:21:13,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In128300786 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In128300786 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In128300786 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In128300786 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out128300786| ~y$r_buff1_thd0~0_In128300786)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite45_Out128300786| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In128300786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In128300786, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In128300786, ~y$w_buff1_used~0=~y$w_buff1_used~0_In128300786} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In128300786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In128300786, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In128300786, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out128300786|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In128300786} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:21:13,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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:21:13,127 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:21:13,128 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:21:13,129 INFO L168 Benchmark]: Toolchain (without parser) took 15542.05 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 552.1 MB). Free memory was 946.9 MB in the beginning and 927.9 MB in the end (delta: 19.1 MB). Peak memory consumption was 571.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:13,130 INFO L168 Benchmark]: CDTParser took 0.87 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:21:13,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -141.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:13,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.74 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:13,131 INFO L168 Benchmark]: Boogie Preprocessor took 62.87 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:21:13,132 INFO L168 Benchmark]: RCFGBuilder took 740.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:13,132 INFO L168 Benchmark]: TraceAbstraction took 13831.52 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 426.8 MB). Free memory was 1.0 GB in the beginning and 955.2 MB in the end (delta: 81.4 MB). Peak memory consumption was 508.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:13,133 INFO L168 Benchmark]: Witness Printer took 90.23 ms. Allocated memory is still 1.6 GB. Free memory was 955.2 MB in the beginning and 927.9 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:13,136 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.87 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 743.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -141.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.74 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.87 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 740.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13831.52 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 426.8 MB). Free memory was 1.0 GB in the beginning and 955.2 MB in the end (delta: 81.4 MB). Peak memory consumption was 508.2 MB. Max. memory is 11.5 GB. * Witness Printer took 90.23 ms. Allocated memory is still 1.6 GB. Free memory was 955.2 MB in the beginning and 927.9 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1557, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1558, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L738] 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, 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] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L759] 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=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] [L738] 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) [L759] 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) [L760] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 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)) [L761] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=0, 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] [L761] 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)) [L762] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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 [L765] 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)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L771] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1402 SDtfs, 1742 SDslu, 3051 SDs, 0 SdLazy, 2369 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 5845 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 421 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 357 ConstructedInterpolants, 0 QuantifiedInterpolants, 70635 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...