/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i


--------------------------------------------------------------------------------


This is Ultimate 0.1.25-b09bf87
[2020-10-16 13:25:53,231 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 13:25:53,234 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 13:25:53,276 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 13:25:53,277 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 13:25:53,285 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 13:25:53,288 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 13:25:53,292 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 13:25:53,295 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 13:25:53,298 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 13:25:53,299 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 13:25:53,300 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 13:25:53,300 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 13:25:53,303 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 13:25:53,306 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 13:25:53,308 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 13:25:53,309 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 13:25:53,311 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 13:25:53,313 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 13:25:53,323 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 13:25:53,326 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 13:25:53,327 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 13:25:53,329 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 13:25:53,330 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 13:25:53,341 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 13:25:53,341 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 13:25:53,342 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 13:25:53,344 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 13:25:53,345 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 13:25:53,348 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 13:25:53,348 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 13:25:53,349 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 13:25:53,349 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 13:25:53,350 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 13:25:53,351 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 13:25:53,351 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 13:25:53,352 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 13:25:53,352 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 13:25:53,352 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 13:25:53,353 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 13:25:53,353 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 13:25:53,354 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf
[2020-10-16 13:25:53,376 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 13:25:53,376 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 13:25:53,377 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 13:25:53,378 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 13:25:53,378 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 13:25:53,378 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 13:25:53,378 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 13:25:53,378 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 13:25:53,379 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 13:25:53,379 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 13:25:53,379 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 13:25:53,379 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 13:25:53,379 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 13:25:53,380 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 13:25:53,380 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 13:25:53,380 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 13:25:53,380 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 13:25:53,380 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 13:25:53,381 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 13:25:53,381 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 13:25:53,381 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 13:25:53,381 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 13:25:53,381 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 13:25:53,382 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 13:25:53,382 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 13:25:53,382 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 13:25:53,382 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 13:25:53,382 INFO  L138        SettingsManager]:  * Override the interpolant automaton setting of the refinement strategy=true
[2020-10-16 13:25:53,383 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 13:25:53,383 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 13:25:53,383 INFO  L138        SettingsManager]:  * Interpolant automaton=MCR
[2020-10-16 13:25:53,677 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 13:25:53,689 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 13:25:53,692 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 13:25:53,694 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 13:25:53,694 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 13:25:53,695 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i
[2020-10-16 13:25:53,757 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f8cd2c9f1/996b7e040a50451ab3a1c38bf15ae274/FLAGa845710c0
[2020-10-16 13:25:54,322 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 13:25:54,327 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i
[2020-10-16 13:25:54,350 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f8cd2c9f1/996b7e040a50451ab3a1c38bf15ae274/FLAGa845710c0
[2020-10-16 13:25:54,559 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f8cd2c9f1/996b7e040a50451ab3a1c38bf15ae274
[2020-10-16 13:25:54,569 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 13:25:54,571 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 13:25:54,572 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 13:25:54,572 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 13:25:54,576 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 13:25:54,577 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:25:54" (1/1) ...
[2020-10-16 13:25:54,581 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b10973e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:54, skipping insertion in model container
[2020-10-16 13:25:54,582 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:25:54" (1/1) ...
[2020-10-16 13:25:54,589 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 13:25:54,637 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 13:25:55,187 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:25:55,202 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 13:25:55,260 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:25:55,346 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 13:25:55,347 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:55 WrapperNode
[2020-10-16 13:25:55,348 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 13:25:55,348 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 13:25:55,349 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 13:25:55,349 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 13:25:55,356 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:55" (1/1) ...
[2020-10-16 13:25:55,375 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:55" (1/1) ...
[2020-10-16 13:25:55,413 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 13:25:55,414 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 13:25:55,414 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 13:25:55,414 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 13:25:55,425 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:55" (1/1) ...
[2020-10-16 13:25:55,425 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:55" (1/1) ...
[2020-10-16 13:25:55,431 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:55" (1/1) ...
[2020-10-16 13:25:55,431 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:55" (1/1) ...
[2020-10-16 13:25:55,441 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:55" (1/1) ...
[2020-10-16 13:25:55,445 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:55" (1/1) ...
[2020-10-16 13:25:55,449 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:55" (1/1) ...
[2020-10-16 13:25:55,455 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 13:25:55,455 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 13:25:55,455 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 13:25:55,455 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 13:25:55,456 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:55" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/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
[2020-10-16 13:25:55,527 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 13:25:55,527 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 13:25:55,527 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 13:25:55,527 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 13:25:55,528 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 13:25:55,528 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 13:25:55,528 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 13:25:55,528 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 13:25:55,528 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 13:25:55,529 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 13:25:55,529 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 13:25:55,531 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 13:25:57,457 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 13:25:57,458 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 13:25:57,460 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:25:57 BoogieIcfgContainer
[2020-10-16 13:25:57,460 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 13:25:57,462 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 13:25:57,462 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 13:25:57,466 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 13:25:57,466 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:25:54" (1/3) ...
[2020-10-16 13:25:57,467 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d119916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:25:57, skipping insertion in model container
[2020-10-16 13:25:57,467 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:55" (2/3) ...
[2020-10-16 13:25:57,468 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d119916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:25:57, skipping insertion in model container
[2020-10-16 13:25:57,468 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:25:57" (3/3) ...
[2020-10-16 13:25:57,470 INFO  L111   eAbstractionObserver]: Analyzing ICFG rfi001_rmo.opt.i
[2020-10-16 13:25:57,483 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 13:25:57,483 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 13:25:57,492 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 13:25:57,493 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 13:25:57,521 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,521 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,522 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,522 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,522 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,522 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,523 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,523 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,523 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,523 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,523 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,525 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,525 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,526 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,526 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,526 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,526 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,527 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,527 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,527 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,527 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,527 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,528 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,528 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,528 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,528 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,528 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,528 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,529 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,529 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,535 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,536 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,540 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,540 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,540 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,540 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,542 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,542 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,542 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:25:57,545 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 13:25:57,561 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2020-10-16 13:25:57,585 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 13:25:57,585 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 13:25:57,585 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 13:25:57,585 INFO  L380      AbstractCegarLoop]: Backedges is MCR
[2020-10-16 13:25:57,586 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 13:25:57,586 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 13:25:57,586 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 13:25:57,586 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 13:25:57,602 INFO  L137   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 13:25:57,603 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 79 transitions, 168 flow
[2020-10-16 13:25:57,606 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 79 transitions, 168 flow
[2020-10-16 13:25:57,609 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow
[2020-10-16 13:25:57,656 INFO  L129       PetriNetUnfolder]: 2/77 cut-off events.
[2020-10-16 13:25:57,656 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 13:25:57,662 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. 
[2020-10-16 13:25:57,664 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1012
[2020-10-16 13:25:59,126 WARN  L193               SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 226 DAG size of output: 186
[2020-10-16 13:25:59,176 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term
[2020-10-16 13:25:59,177 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 13:25:59,179 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 13:25:59,180 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 13:25:59,990 WARN  L193               SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122
[2020-10-16 13:26:01,060 WARN  L193               SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63
[2020-10-16 13:26:01,186 WARN  L193               SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 58
[2020-10-16 13:26:01,950 WARN  L193               SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 109
[2020-10-16 13:26:02,258 WARN  L193               SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 106
[2020-10-16 13:26:02,931 WARN  L193               SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 118
[2020-10-16 13:26:03,283 WARN  L193               SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 115
[2020-10-16 13:26:03,785 WARN  L193               SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 124
[2020-10-16 13:26:04,126 WARN  L193               SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 124
[2020-10-16 13:26:04,390 WARN  L193               SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83
[2020-10-16 13:26:04,526 WARN  L193               SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2020-10-16 13:26:04,533 INFO  L132        LiptonReduction]: Checked pairs total: 2627
[2020-10-16 13:26:04,533 INFO  L134        LiptonReduction]: Total number of compositions: 71
[2020-10-16 13:26:04,540 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 20 transitions, 50 flow
[2020-10-16 13:26:04,563 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 187 states.
[2020-10-16 13:26:04,565 INFO  L276                IsEmpty]: Start isEmpty. Operand 187 states.
[2020-10-16 13:26:04,572 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 13:26:04,572 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:26:04,573 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 13:26:04,573 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:26:04,579 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:26:04,580 INFO  L82        PathProgramCache]: Analyzing trace with hash 876717738, now seen corresponding path program 1 times
[2020-10-16 13:26:04,609 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:26:04,610 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808326992]
[2020-10-16 13:26:04,610 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:26:04,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:26:04,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:26:04,842 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808326992]
[2020-10-16 13:26:04,843 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:26:04,843 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:26:04,844 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1025842737]
[2020-10-16 13:26:04,845 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:26:04,849 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:26:04,862 INFO  L258    McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions.
[2020-10-16 13:26:04,863 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:26:04,867 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:26:04,868 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:26:04,868 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:26:04,882 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:26:04,883 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:26:04,884 INFO  L87              Difference]: Start difference. First operand 187 states. Second operand 3 states.
[2020-10-16 13:26:04,973 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:26:04,976 INFO  L93              Difference]: Finished difference Result 162 states and 385 transitions.
[2020-10-16 13:26:04,977 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:26:04,978 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 13:26:04,979 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:26:05,000 INFO  L225             Difference]: With dead ends: 162
[2020-10-16 13:26:05,000 INFO  L226             Difference]: Without dead ends: 132
[2020-10-16 13:26:05,004 INFO  L677         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
[2020-10-16 13:26:05,031 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2020-10-16 13:26:05,065 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132.
[2020-10-16 13:26:05,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 132 states.
[2020-10-16 13:26:05,070 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 306 transitions.
[2020-10-16 13:26:05,072 INFO  L78                 Accepts]: Start accepts. Automaton has 132 states and 306 transitions. Word has length 5
[2020-10-16 13:26:05,072 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:26:05,072 INFO  L481      AbstractCegarLoop]: Abstraction has 132 states and 306 transitions.
[2020-10-16 13:26:05,072 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:26:05,072 INFO  L276                IsEmpty]: Start isEmpty. Operand 132 states and 306 transitions.
[2020-10-16 13:26:05,073 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-16 13:26:05,073 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:26:05,073 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:26:05,073 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 13:26:05,074 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:26:05,074 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:26:05,074 INFO  L82        PathProgramCache]: Analyzing trace with hash 712187279, now seen corresponding path program 1 times
[2020-10-16 13:26:05,075 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:26:05,075 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990977414]
[2020-10-16 13:26:05,075 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:26:05,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:26:05,236 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:26:05,237 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990977414]
[2020-10-16 13:26:05,237 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:26:05,237 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:26:05,238 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1846766698]
[2020-10-16 13:26:05,238 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:26:05,239 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:26:05,241 INFO  L258    McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions.
[2020-10-16 13:26:05,241 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:26:05,242 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:26:05,243 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:26:05,244 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:26:05,244 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:26:05,244 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:26:05,244 INFO  L87              Difference]: Start difference. First operand 132 states and 306 transitions. Second operand 4 states.
[2020-10-16 13:26:05,289 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:26:05,290 INFO  L93              Difference]: Finished difference Result 127 states and 292 transitions.
[2020-10-16 13:26:05,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:26:05,291 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 7
[2020-10-16 13:26:05,291 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:26:05,293 INFO  L225             Difference]: With dead ends: 127
[2020-10-16 13:26:05,293 INFO  L226             Difference]: Without dead ends: 127
[2020-10-16 13:26:05,295 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:26:05,296 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2020-10-16 13:26:05,304 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127.
[2020-10-16 13:26:05,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 127 states.
[2020-10-16 13:26:05,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 292 transitions.
[2020-10-16 13:26:05,307 INFO  L78                 Accepts]: Start accepts. Automaton has 127 states and 292 transitions. Word has length 7
[2020-10-16 13:26:05,307 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:26:05,307 INFO  L481      AbstractCegarLoop]: Abstraction has 127 states and 292 transitions.
[2020-10-16 13:26:05,307 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:26:05,307 INFO  L276                IsEmpty]: Start isEmpty. Operand 127 states and 292 transitions.
[2020-10-16 13:26:05,308 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2020-10-16 13:26:05,308 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:26:05,308 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:26:05,308 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 13:26:05,309 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:26:05,309 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:26:05,309 INFO  L82        PathProgramCache]: Analyzing trace with hash 602881578, now seen corresponding path program 1 times
[2020-10-16 13:26:05,311 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:26:05,312 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683326224]
[2020-10-16 13:26:05,312 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:26:05,343 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:26:05,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:26:05,380 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683326224]
[2020-10-16 13:26:05,380 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:26:05,381 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:26:05,381 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [405483672]
[2020-10-16 13:26:05,381 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:26:05,382 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:26:05,384 INFO  L258    McrAutomatonBuilder]: Finished intersection with 10 states and 10 transitions.
[2020-10-16 13:26:05,384 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:26:05,406 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:26:05,407 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:26:05,407 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:26:05,407 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:26:05,408 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:26:05,408 INFO  L87              Difference]: Start difference. First operand 127 states and 292 transitions. Second operand 3 states.
[2020-10-16 13:26:05,418 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:26:05,418 INFO  L93              Difference]: Finished difference Result 122 states and 278 transitions.
[2020-10-16 13:26:05,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:26:05,420 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 8
[2020-10-16 13:26:05,420 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:26:05,421 INFO  L225             Difference]: With dead ends: 122
[2020-10-16 13:26:05,421 INFO  L226             Difference]: Without dead ends: 122
[2020-10-16 13:26:05,422 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:26:05,423 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 122 states.
[2020-10-16 13:26:05,429 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122.
[2020-10-16 13:26:05,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 122 states.
[2020-10-16 13:26:05,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 278 transitions.
[2020-10-16 13:26:05,431 INFO  L78                 Accepts]: Start accepts. Automaton has 122 states and 278 transitions. Word has length 8
[2020-10-16 13:26:05,431 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:26:05,431 INFO  L481      AbstractCegarLoop]: Abstraction has 122 states and 278 transitions.
[2020-10-16 13:26:05,431 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:26:05,431 INFO  L276                IsEmpty]: Start isEmpty. Operand 122 states and 278 transitions.
[2020-10-16 13:26:05,432 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 13:26:05,432 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:26:05,433 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:26:05,433 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 13:26:05,433 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:26:05,433 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:26:05,433 INFO  L82        PathProgramCache]: Analyzing trace with hash 1509459439, now seen corresponding path program 1 times
[2020-10-16 13:26:05,435 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:26:05,435 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844735070]
[2020-10-16 13:26:05,435 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:26:05,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:26:05,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:26:05,684 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844735070]
[2020-10-16 13:26:05,685 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:26:05,685 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:26:05,685 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [140654838]
[2020-10-16 13:26:05,685 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:26:05,687 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:26:05,689 INFO  L258    McrAutomatonBuilder]: Finished intersection with 13 states and 15 transitions.
[2020-10-16 13:26:05,689 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:26:05,702 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term
[2020-10-16 13:26:05,702 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:05,704 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:05,711 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:05,713 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:05,718 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:05,724 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:05,729 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:05,736 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:26:05,738 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:05,739 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:05,743 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:05,796 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1649#(or (not (= (mod ~y$w_buff0_used~0 256) 0)) (and (<= ~y~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd0~0)))]
[2020-10-16 13:26:05,796 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 13:26:05,797 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:26:05,797 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 13:26:05,797 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 13:26:05,797 INFO  L87              Difference]: Start difference. First operand 122 states and 278 transitions. Second operand 6 states.
[2020-10-16 13:26:05,940 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:26:05,941 INFO  L93              Difference]: Finished difference Result 145 states and 335 transitions.
[2020-10-16 13:26:05,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 13:26:05,943 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 9
[2020-10-16 13:26:05,943 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:26:05,946 INFO  L225             Difference]: With dead ends: 145
[2020-10-16 13:26:05,946 INFO  L226             Difference]: Without dead ends: 145
[2020-10-16 13:26:05,947 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2020-10-16 13:26:05,948 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2020-10-16 13:26:05,955 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118.
[2020-10-16 13:26:05,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 118 states.
[2020-10-16 13:26:05,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 266 transitions.
[2020-10-16 13:26:05,957 INFO  L78                 Accepts]: Start accepts. Automaton has 118 states and 266 transitions. Word has length 9
[2020-10-16 13:26:05,957 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:26:05,957 INFO  L481      AbstractCegarLoop]: Abstraction has 118 states and 266 transitions.
[2020-10-16 13:26:05,957 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 13:26:05,957 INFO  L276                IsEmpty]: Start isEmpty. Operand 118 states and 266 transitions.
[2020-10-16 13:26:05,958 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 13:26:05,959 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:26:05,959 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:26:05,959 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 13:26:05,959 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:26:05,960 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:26:05,960 INFO  L82        PathProgramCache]: Analyzing trace with hash -1108467314, now seen corresponding path program 1 times
[2020-10-16 13:26:05,964 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:26:05,964 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039064912]
[2020-10-16 13:26:05,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:26:06,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:26:06,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:26:06,082 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039064912]
[2020-10-16 13:26:06,084 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:26:06,084 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:26:06,084 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1966290176]
[2020-10-16 13:26:06,085 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:26:06,086 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:26:06,089 INFO  L258    McrAutomatonBuilder]: Finished intersection with 17 states and 21 transitions.
[2020-10-16 13:26:06,090 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:26:06,112 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,136 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,151 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2039#(= (mod ~main$tmp_guard0~0 256) 0), 2040#(not (= 2 ~__unbuffered_cnt~0))]
[2020-10-16 13:26:06,151 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 13:26:06,152 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:26:06,152 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 13:26:06,152 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 13:26:06,152 INFO  L87              Difference]: Start difference. First operand 118 states and 266 transitions. Second operand 6 states.
[2020-10-16 13:26:06,199 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:26:06,199 INFO  L93              Difference]: Finished difference Result 75 states and 150 transitions.
[2020-10-16 13:26:06,200 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 13:26:06,200 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 11
[2020-10-16 13:26:06,200 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:26:06,201 INFO  L225             Difference]: With dead ends: 75
[2020-10-16 13:26:06,201 INFO  L226             Difference]: Without dead ends: 45
[2020-10-16 13:26:06,201 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2020-10-16 13:26:06,202 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2020-10-16 13:26:06,205 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2020-10-16 13:26:06,205 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2020-10-16 13:26:06,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions.
[2020-10-16 13:26:06,206 INFO  L78                 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 11
[2020-10-16 13:26:06,206 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:26:06,206 INFO  L481      AbstractCegarLoop]: Abstraction has 45 states and 72 transitions.
[2020-10-16 13:26:06,206 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 13:26:06,206 INFO  L276                IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions.
[2020-10-16 13:26:06,207 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 13:26:06,207 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:26:06,207 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:26:06,208 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 13:26:06,208 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:26:06,208 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:26:06,208 INFO  L82        PathProgramCache]: Analyzing trace with hash 325930313, now seen corresponding path program 1 times
[2020-10-16 13:26:06,211 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:26:06,211 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154799945]
[2020-10-16 13:26:06,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:26:06,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:26:06,559 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:26:06,559 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154799945]
[2020-10-16 13:26:06,559 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:26:06,560 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 13:26:06,560 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [477073956]
[2020-10-16 13:26:06,560 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:26:06,564 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:26:06,600 INFO  L258    McrAutomatonBuilder]: Finished intersection with 21 states and 24 transitions.
[2020-10-16 13:26:06,600 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:26:06,623 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term
[2020-10-16 13:26:06,624 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,625 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term
[2020-10-16 13:26:06,625 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,627 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:26:06,627 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,629 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:26:06,630 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,631 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,632 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,633 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,642 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,644 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,648 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,653 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,655 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,668 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:26:06,672 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,678 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,680 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,685 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,690 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,692 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,707 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:26:06,715 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:26:06,719 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,720 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,724 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,738 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:26:06,754 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term
[2020-10-16 13:26:06,754 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,758 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,759 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,765 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,766 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,767 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:26:06,769 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:26:06,770 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,782 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:26:06,789 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,791 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,799 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,802 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,809 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,811 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,821 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:26:06,827 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:26:06,842 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:26:06,857 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,858 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,868 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,874 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:26:06,881 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:26:06,887 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,892 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:26:06,895 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,896 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,937 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:26:06,938 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,939 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,940 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,946 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,947 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,955 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,956 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:26:06,956 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:26:06,962 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:26:06,965 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,967 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,968 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,974 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:26:06,980 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:26:06,991 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:26:06,992 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:26:07,002 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:26:07,002 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:26:07,075 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2218#(and (or (and (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))) (and (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0))) (not (= 2 ~y$w_buff1~0)))]
[2020-10-16 13:26:07,076 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 13:26:07,076 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:26:07,076 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 13:26:07,076 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2020-10-16 13:26:07,077 INFO  L87              Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 9 states.
[2020-10-16 13:26:07,250 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:26:07,250 INFO  L93              Difference]: Finished difference Result 59 states and 90 transitions.
[2020-10-16 13:26:07,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-16 13:26:07,251 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 16
[2020-10-16 13:26:07,251 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:26:07,252 INFO  L225             Difference]: With dead ends: 59
[2020-10-16 13:26:07,252 INFO  L226             Difference]: Without dead ends: 47
[2020-10-16 13:26:07,253 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2020-10-16 13:26:07,254 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2020-10-16 13:26:07,256 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41.
[2020-10-16 13:26:07,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2020-10-16 13:26:07,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions.
[2020-10-16 13:26:07,256 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 16
[2020-10-16 13:26:07,257 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:26:07,257 INFO  L481      AbstractCegarLoop]: Abstraction has 41 states and 64 transitions.
[2020-10-16 13:26:07,257 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 13:26:07,257 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions.
[2020-10-16 13:26:07,258 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 13:26:07,258 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:26:07,258 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:26:07,258 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 13:26:07,258 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:26:07,259 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:26:07,259 INFO  L82        PathProgramCache]: Analyzing trace with hash 1111057993, now seen corresponding path program 2 times
[2020-10-16 13:26:07,260 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:26:07,260 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047655675]
[2020-10-16 13:26:07,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:26:07,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:26:07,310 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:26:07,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:26:07,355 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:26:07,389 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 13:26:07,390 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 13:26:07,390 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 13:26:07,391 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 13:26:07,402 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L797-->L805: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In-1023413333 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In-1023413333 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In-1023413333 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In-1023413333 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and (= 0 ~y$w_buff0_used~0_Out-1023413333) .cse0 .cse1) (and .cse2 (= ~y$w_buff0_used~0_In-1023413333 ~y$w_buff0_used~0_Out-1023413333))) (= ~y$r_buff1_thd0~0_In-1023413333 ~y$r_buff1_thd0~0_Out-1023413333) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1023413333| ULTIMATE.start_assume_abort_if_not_~cond_Out-1023413333) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1023413333| (mod ~main$tmp_guard0~0_In-1023413333 256)) (= ~y$r_buff0_thd0~0_Out-1023413333 ~y$r_buff0_thd0~0_In-1023413333) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1023413333 0)) (or (and (= ~y~0_Out-1023413333 ~y$w_buff0~0_In-1023413333) .cse0 .cse1) (and (or (and .cse3 (= ~y~0_Out-1023413333 ~y~0_In-1023413333)) (and .cse4 (= ~y$w_buff1~0_In-1023413333 ~y~0_Out-1023413333) .cse5)) .cse2)) (or (and .cse3 (= ~y$w_buff1_used~0_Out-1023413333 ~y$w_buff1_used~0_In-1023413333)) (and .cse4 (= ~y$w_buff1_used~0_Out-1023413333 0) .cse5)))))  InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1023413333, ~y$w_buff1~0=~y$w_buff1~0_In-1023413333, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1023413333, ~y$w_buff0~0=~y$w_buff0~0_In-1023413333, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1023413333, ~y~0=~y~0_In-1023413333, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1023413333, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1023413333}  OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1023413333, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1023413333|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1023413333|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1023413333|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-1023413333|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1023413333, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1023413333|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1023413333|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1023413333|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1023413333, ~y$w_buff1~0=~y$w_buff1~0_In-1023413333, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1023413333, ~y$w_buff0~0=~y$w_buff0~0_In-1023413333, ~y~0=~y~0_Out-1023413333, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1023413333, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1023413333}  AuxVars[]  AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite16, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-16 13:26:07,407 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,407 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,409 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,409 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,409 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,409 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,410 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,410 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,410 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,410 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,410 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,411 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,411 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,411 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,412 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,412 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,412 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,412 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,412 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,412 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,413 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,413 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,413 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,414 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,414 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,414 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,414 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,414 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,415 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,415 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,415 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,415 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,415 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,416 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,416 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,416 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,416 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,416 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,417 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,417 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,417 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,417 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,417 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,417 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,418 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:26:07,418 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:26:07,474 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:26:07 BasicIcfg
[2020-10-16 13:26:07,475 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 13:26:07,477 INFO  L168              Benchmark]: Toolchain (without parser) took 12905.70 ms. Allocated memory was 146.8 MB in the beginning and 342.9 MB in the end (delta: 196.1 MB). Free memory was 101.3 MB in the beginning and 185.8 MB in the end (delta: -84.6 MB). Peak memory consumption was 111.5 MB. Max. memory is 7.1 GB.
[2020-10-16 13:26:07,477 INFO  L168              Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-10-16 13:26:07,478 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 775.96 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 157.1 MB in the end (delta: -56.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB.
[2020-10-16 13:26:07,479 INFO  L168              Benchmark]: Boogie Procedure Inliner took 65.22 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2020-10-16 13:26:07,480 INFO  L168              Benchmark]: Boogie Preprocessor took 41.01 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 13:26:07,481 INFO  L168              Benchmark]: RCFGBuilder took 2005.21 ms. Allocated memory was 203.4 MB in the beginning and 246.9 MB in the end (delta: 43.5 MB). Free memory was 151.8 MB in the beginning and 196.3 MB in the end (delta: -44.5 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB.
[2020-10-16 13:26:07,482 INFO  L168              Benchmark]: TraceAbstraction took 10013.11 ms. Allocated memory was 246.9 MB in the beginning and 342.9 MB in the end (delta: 95.9 MB). Free memory was 196.3 MB in the beginning and 185.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 106.4 MB. Max. memory is 7.1 GB.
[2020-10-16 13:26:07,486 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 775.96 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 157.1 MB in the end (delta: -56.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 65.22 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 41.01 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2005.21 ms. Allocated memory was 203.4 MB in the beginning and 246.9 MB in the end (delta: 43.5 MB). Free memory was 151.8 MB in the beginning and 196.3 MB in the end (delta: -44.5 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 10013.11 ms. Allocated memory was 246.9 MB in the beginning and 342.9 MB in the end (delta: 95.9 MB). Free memory was 196.3 MB in the beginning and 185.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 106.4 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    535 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 36 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.9s, 84 PlacesBefore, 27 PlacesAfterwards, 79 TransitionsBefore, 20 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 71 TotalNumberOfCompositions, 2627 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L697]               0  int __unbuffered_cnt = 0;
[L699]               0  int __unbuffered_p1_EAX = 0;
[L701]               0  int __unbuffered_p1_EBX = 0;
[L702]               0  _Bool main$tmp_guard0;
[L703]               0  _Bool main$tmp_guard1;
[L705]               0  int x = 0;
[L707]               0  int y = 0;
[L708]               0  _Bool y$flush_delayed;
[L709]               0  int y$mem_tmp;
[L710]               0  _Bool y$r_buff0_thd0;
[L711]               0  _Bool y$r_buff0_thd1;
[L712]               0  _Bool y$r_buff0_thd2;
[L713]               0  _Bool y$r_buff1_thd0;
[L714]               0  _Bool y$r_buff1_thd1;
[L715]               0  _Bool y$r_buff1_thd2;
[L716]               0  _Bool y$read_delayed;
[L717]               0  int *y$read_delayed_var;
[L718]               0  int y$w_buff0;
[L719]               0  _Bool y$w_buff0_used;
[L720]               0  int y$w_buff1;
[L721]               0  _Bool y$w_buff1_used;
[L723]               0  int z = 0;
[L724]               0  _Bool weak$$choice0;
[L725]               0  _Bool weak$$choice2;
[L791]               0  pthread_t t1611;
[L792]  FCALL, FORK  0  pthread_create(&t1611, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0]
[L793]               0  pthread_t t1612;
[L794]  FCALL, FORK  0  pthread_create(&t1612, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0]
[L749]               2  y$w_buff1 = y$w_buff0
[L750]               2  y$w_buff0 = 2
[L751]               2  y$w_buff1_used = y$w_buff0_used
[L752]               2  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    2  !expression
[L7]                 2  __VERIFIER_error()
[L754]               2  y$r_buff1_thd0 = y$r_buff0_thd0
[L755]               2  y$r_buff1_thd1 = y$r_buff0_thd1
[L756]               2  y$r_buff1_thd2 = y$r_buff0_thd2
[L757]               2  y$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L760]               2  z = 1
[L763]               2  __unbuffered_p1_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L766]               2  __unbuffered_p1_EBX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L729]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L732]               1  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L735]  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)
[L735]               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)
[L736]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L736]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L737]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L737]               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
[L738]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L738]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L739]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L739]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L742]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L744]               1  return 0;
[L769]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L769]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L770]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L770]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L771]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L771]               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
[L772]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L772]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L773]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L773]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L776]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L778]               2  return 0;
[L796]               0  main$tmp_guard0 = __unbuffered_cnt == 2
        VAL             [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L807]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L808]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L809]               0  y$flush_delayed = weak$$choice2
[L810]               0  y$mem_tmp = y
[L811]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L811]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L812]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L812]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L813]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L813]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L813]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1
[L813]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L813]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L813]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L814]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L814]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L814]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L814]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L815]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L815]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L815]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L815]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L816]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L816]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L817]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L817]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L818]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
[L819]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L819]               0  y = y$flush_delayed ? y$mem_tmp : y
[L820]               0  y$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.8s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 85 SDtfs, 113 SDslu, 120 SDs, 0 SdLazy, 105 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 4443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...