/usr/bin/java -Xmx16000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i


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


This is Ultimate 0.1.25-11af1e5
[2020-10-11 15:10:22,177 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-11 15:10:22,180 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-11 15:10:22,225 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-11 15:10:22,225 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-11 15:10:22,236 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-11 15:10:22,237 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-11 15:10:22,240 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-11 15:10:22,243 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-11 15:10:22,246 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-11 15:10:22,247 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-11 15:10:22,249 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-11 15:10:22,250 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-11 15:10:22,253 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-11 15:10:22,254 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-11 15:10:22,256 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-11 15:10:22,257 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-11 15:10:22,259 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-11 15:10:22,260 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-11 15:10:22,267 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-11 15:10:22,269 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-11 15:10:22,271 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-11 15:10:22,273 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-11 15:10:22,273 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-11 15:10:22,277 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-11 15:10:22,278 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-11 15:10:22,278 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-11 15:10:22,281 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-11 15:10:22,281 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-11 15:10:22,282 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-11 15:10:22,282 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-11 15:10:22,283 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-11 15:10:22,284 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-11 15:10:22,284 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-11 15:10:22,286 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-11 15:10:22,286 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-11 15:10:22,286 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-11 15:10:22,287 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-11 15:10:22,287 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-11 15:10:22,288 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-11 15:10:22,289 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-11 15:10:22,290 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-11 15:10:22,332 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-11 15:10:22,332 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-11 15:10:22,334 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-11 15:10:22,334 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-11 15:10:22,334 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-11 15:10:22,334 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-11 15:10:22,335 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-11 15:10:22,335 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-11 15:10:22,335 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-11 15:10:22,335 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-11 15:10:22,336 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-11 15:10:22,337 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-11 15:10:22,337 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-11 15:10:22,337 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-11 15:10:22,337 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-11 15:10:22,338 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-11 15:10:22,338 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-11 15:10:22,338 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-11 15:10:22,338 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-11 15:10:22,338 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-11 15:10:22,339 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-11 15:10:22,339 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 15:10:22,339 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-11 15:10:22,339 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-11 15:10:22,339 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-11 15:10:22,340 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-11 15:10:22,340 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-11 15:10:22,340 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-11 15:10:22,340 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-11 15:10:22,340 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-11 15:10:22,652 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-11 15:10:22,665 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-11 15:10:22,668 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-11 15:10:22,670 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-11 15:10:22,671 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-11 15:10:22,671 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i
[2020-10-11 15:10:22,736 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b14423c/419bbef0a3f44362999f26a0d8ca2a07/FLAGb3d55a688
[2020-10-11 15:10:23,215 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-11 15:10:23,216 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i
[2020-10-11 15:10:23,238 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b14423c/419bbef0a3f44362999f26a0d8ca2a07/FLAGb3d55a688
[2020-10-11 15:10:23,575 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b14423c/419bbef0a3f44362999f26a0d8ca2a07
[2020-10-11 15:10:23,586 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-11 15:10:23,587 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-11 15:10:23,588 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-11 15:10:23,588 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-11 15:10:23,591 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-11 15:10:23,592 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:10:23" (1/1) ...
[2020-10-11 15:10:23,594 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d18a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:23, skipping insertion in model container
[2020-10-11 15:10:23,595 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:10:23" (1/1) ...
[2020-10-11 15:10:23,601 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-11 15:10:23,652 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-11 15:10:24,162 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 15:10:24,174 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-11 15:10:24,232 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 15:10:24,307 INFO  L208         MainTranslator]: Completed translation
[2020-10-11 15:10:24,307 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:24 WrapperNode
[2020-10-11 15:10:24,307 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-11 15:10:24,308 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-11 15:10:24,308 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-11 15:10:24,309 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-11 15:10:24,318 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:24" (1/1) ...
[2020-10-11 15:10:24,337 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:24" (1/1) ...
[2020-10-11 15:10:24,377 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-11 15:10:24,378 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-11 15:10:24,378 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-11 15:10:24,378 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-11 15:10:24,394 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:24" (1/1) ...
[2020-10-11 15:10:24,394 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:24" (1/1) ...
[2020-10-11 15:10:24,401 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:24" (1/1) ...
[2020-10-11 15:10:24,401 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:24" (1/1) ...
[2020-10-11 15:10:24,412 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:24" (1/1) ...
[2020-10-11 15:10:24,416 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:24" (1/1) ...
[2020-10-11 15:10:24,423 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:24" (1/1) ...
[2020-10-11 15:10:24,428 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-11 15:10:24,431 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-11 15:10:24,431 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-11 15:10:24,431 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-11 15:10:24,432 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:24" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 15:10:24,497 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-11 15:10:24,497 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-11 15:10:24,497 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-11 15:10:24,497 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-11 15:10:24,498 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-11 15:10:24,498 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-11 15:10:24,498 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-11 15:10:24,499 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-11 15:10:24,499 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-11 15:10:24,500 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-11 15:10:24,500 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-11 15:10:24,501 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-11 15:10:24,501 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-11 15:10:24,503 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-11 15:10:26,395 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-11 15:10:26,396 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-11 15:10:26,398 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:10:26 BoogieIcfgContainer
[2020-10-11 15:10:26,399 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-11 15:10:26,400 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-11 15:10:26,400 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-11 15:10:26,404 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-11 15:10:26,404 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:10:23" (1/3) ...
[2020-10-11 15:10:26,406 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e44547e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:10:26, skipping insertion in model container
[2020-10-11 15:10:26,406 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:24" (2/3) ...
[2020-10-11 15:10:26,406 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e44547e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:10:26, skipping insertion in model container
[2020-10-11 15:10:26,407 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:10:26" (3/3) ...
[2020-10-11 15:10:26,408 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe031_pso.opt.i
[2020-10-11 15:10:26,422 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-11 15:10:26,422 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-11 15:10:26,431 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-11 15:10:26,432 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-11 15:10:26,463 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,463 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,463 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,464 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,464 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,464 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,465 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,465 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,465 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,465 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,467 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,467 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,467 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,468 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,468 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,468 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,469 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,469 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,469 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,469 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,470 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,470 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,470 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,470 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,471 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,471 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,471 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,471 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,472 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,472 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,472 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,476 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,477 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,477 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,477 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,477 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,478 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,478 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,478 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,478 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,478 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,480 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,481 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,481 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,481 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,481 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,481 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,482 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,482 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,482 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,482 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,482 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,483 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,484 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,485 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,485 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,485 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 15:10:26,503 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-11 15:10:26,527 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-11 15:10:26,527 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-11 15:10:26,527 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-11 15:10:26,527 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-11 15:10:26,527 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-11 15:10:26,528 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-11 15:10:26,528 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-11 15:10:26,528 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-11 15:10:26,544 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-11 15:10:26,547 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow
[2020-10-11 15:10:26,551 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 197 flow
[2020-10-11 15:10:26,553 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow
[2020-10-11 15:10:26,602 INFO  L129       PetriNetUnfolder]: 2/88 cut-off events.
[2020-10-11 15:10:26,602 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 15:10:26,607 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. 
[2020-10-11 15:10:26,610 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1536
[2020-10-11 15:10:27,030 WARN  L193               SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-11 15:10:27,307 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-11 15:10:27,308 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 15:10:27,310 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-11 15:10:27,311 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 15:10:27,347 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-11 15:10:27,348 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 15:10:27,350 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-11 15:10:27,350 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 15:10:27,392 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term
[2020-10-11 15:10:27,392 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:27,394 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term
[2020-10-11 15:10:27,394 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:27,424 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-11 15:10:27,424 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 15:10:27,426 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-11 15:10:27,426 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 15:10:28,573 WARN  L193               SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 226 DAG size of output: 186
[2020-10-11 15:10:28,593 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term
[2020-10-11 15:10:28,593 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 15:10:28,595 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-11 15:10:28,595 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 15:10:29,383 WARN  L193               SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122
[2020-10-11 15:10:29,639 WARN  L193               SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42
[2020-10-11 15:10:29,700 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-11 15:10:29,700 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 15:10:29,702 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-11 15:10:29,702 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 15:10:29,725 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-11 15:10:29,725 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 15:10:29,726 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-11 15:10:29,727 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 15:10:29,783 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 15:10:29,784 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:29,841 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 15:10:29,842 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:30,180 WARN  L193               SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-11 15:10:30,239 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 15:10:30,240 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:30,434 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 15:10:30,435 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:30,438 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 15:10:30,439 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:30,443 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 15:10:30,447 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 15:10:30,453 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 15:10:30,454 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 15:10:30,489 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 15:10:30,490 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:30,491 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 15:10:30,491 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:30,497 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 15:10:30,498 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 15:10:30,501 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 15:10:30,502 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 15:10:30,656 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 15:10:30,656 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:30,657 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 15:10:30,658 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:30,660 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 15:10:30,661 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 15:10:30,663 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 15:10:30,663 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 15:10:30,678 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 15:10:30,679 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:30,680 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 15:10:30,680 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 15:10:30,683 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 15:10:30,683 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 15:10:30,686 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 15:10:30,686 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 15:10:31,664 WARN  L193               SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85
[2020-10-11 15:10:31,771 WARN  L193               SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-11 15:10:31,779 INFO  L132        LiptonReduction]: Checked pairs total: 4104
[2020-10-11 15:10:31,779 INFO  L134        LiptonReduction]: Total number of compositions: 77
[2020-10-11 15:10:31,786 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow
[2020-10-11 15:10:31,842 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 770 states.
[2020-10-11 15:10:31,844 INFO  L276                IsEmpty]: Start isEmpty. Operand 770 states.
[2020-10-11 15:10:31,851 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-11 15:10:31,852 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:31,853 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:31,853 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:31,859 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:31,859 INFO  L82        PathProgramCache]: Analyzing trace with hash -755541581, now seen corresponding path program 1 times
[2020-10-11 15:10:31,869 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:31,870 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177520100]
[2020-10-11 15:10:31,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:32,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 15:10:32,124 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-11 15:10:32,125 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177520100]
[2020-10-11 15:10:32,126 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 15:10:32,126 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 15:10:32,127 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608557891]
[2020-10-11 15:10:32,132 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 15:10:32,132 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 15:10:32,147 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 15:10:32,148 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 15:10:32,150 INFO  L87              Difference]: Start difference. First operand 770 states. Second operand 3 states.
[2020-10-11 15:10:32,276 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 15:10:32,276 INFO  L93              Difference]: Finished difference Result 650 states and 2028 transitions.
[2020-10-11 15:10:32,277 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 15:10:32,279 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-11 15:10:32,279 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 15:10:32,308 INFO  L225             Difference]: With dead ends: 650
[2020-10-11 15:10:32,308 INFO  L226             Difference]: Without dead ends: 550
[2020-10-11 15:10:32,310 INFO  L673         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-11 15:10:32,340 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 550 states.
[2020-10-11 15:10:32,436 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550.
[2020-10-11 15:10:32,437 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 550 states.
[2020-10-11 15:10:32,451 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions.
[2020-10-11 15:10:32,456 INFO  L78                 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7
[2020-10-11 15:10:32,460 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 15:10:32,460 INFO  L481      AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions.
[2020-10-11 15:10:32,461 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 15:10:32,461 INFO  L276                IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions.
[2020-10-11 15:10:32,463 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-11 15:10:32,465 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:32,465 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:32,465 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-11 15:10:32,466 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:32,466 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:32,466 INFO  L82        PathProgramCache]: Analyzing trace with hash 1585839773, now seen corresponding path program 1 times
[2020-10-11 15:10:32,467 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:32,467 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010716612]
[2020-10-11 15:10:32,467 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:32,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 15:10:32,623 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-11 15:10:32,623 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010716612]
[2020-10-11 15:10:32,623 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 15:10:32,624 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 15:10:32,624 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311230212]
[2020-10-11 15:10:32,625 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 15:10:32,626 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 15:10:32,626 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 15:10:32,626 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 15:10:32,626 INFO  L87              Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 5 states.
[2020-10-11 15:10:32,739 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 15:10:32,739 INFO  L93              Difference]: Finished difference Result 640 states and 1895 transitions.
[2020-10-11 15:10:32,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 15:10:32,745 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 10
[2020-10-11 15:10:32,745 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 15:10:32,754 INFO  L225             Difference]: With dead ends: 640
[2020-10-11 15:10:32,754 INFO  L226             Difference]: Without dead ends: 540
[2020-10-11 15:10:32,755 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-11 15:10:32,762 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 540 states.
[2020-10-11 15:10:32,789 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540.
[2020-10-11 15:10:32,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 540 states.
[2020-10-11 15:10:32,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1655 transitions.
[2020-10-11 15:10:32,793 INFO  L78                 Accepts]: Start accepts. Automaton has 540 states and 1655 transitions. Word has length 10
[2020-10-11 15:10:32,793 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 15:10:32,793 INFO  L481      AbstractCegarLoop]: Abstraction has 540 states and 1655 transitions.
[2020-10-11 15:10:32,798 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 15:10:32,798 INFO  L276                IsEmpty]: Start isEmpty. Operand 540 states and 1655 transitions.
[2020-10-11 15:10:32,805 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-11 15:10:32,805 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:32,805 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:32,805 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-11 15:10:32,805 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:32,806 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:32,806 INFO  L82        PathProgramCache]: Analyzing trace with hash -1692580395, now seen corresponding path program 1 times
[2020-10-11 15:10:32,806 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:32,806 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641928476]
[2020-10-11 15:10:32,806 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:32,894 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 15:10:32,964 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-11 15:10:32,965 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641928476]
[2020-10-11 15:10:32,965 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 15:10:32,965 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 15:10:32,966 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035259098]
[2020-10-11 15:10:32,966 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 15:10:32,966 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 15:10:32,966 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 15:10:32,967 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 15:10:32,967 INFO  L87              Difference]: Start difference. First operand 540 states and 1655 transitions. Second operand 5 states.
[2020-10-11 15:10:33,105 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 15:10:33,105 INFO  L93              Difference]: Finished difference Result 591 states and 1734 transitions.
[2020-10-11 15:10:33,106 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 15:10:33,106 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 11
[2020-10-11 15:10:33,106 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 15:10:33,109 INFO  L225             Difference]: With dead ends: 591
[2020-10-11 15:10:33,110 INFO  L226             Difference]: Without dead ends: 496
[2020-10-11 15:10:33,110 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-11 15:10:33,112 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 496 states.
[2020-10-11 15:10:33,122 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496.
[2020-10-11 15:10:33,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 496 states.
[2020-10-11 15:10:33,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1491 transitions.
[2020-10-11 15:10:33,125 INFO  L78                 Accepts]: Start accepts. Automaton has 496 states and 1491 transitions. Word has length 11
[2020-10-11 15:10:33,125 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 15:10:33,125 INFO  L481      AbstractCegarLoop]: Abstraction has 496 states and 1491 transitions.
[2020-10-11 15:10:33,126 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 15:10:33,126 INFO  L276                IsEmpty]: Start isEmpty. Operand 496 states and 1491 transitions.
[2020-10-11 15:10:33,127 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-11 15:10:33,127 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:33,127 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:33,127 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-11 15:10:33,128 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:33,128 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:33,128 INFO  L82        PathProgramCache]: Analyzing trace with hash -1418867355, now seen corresponding path program 1 times
[2020-10-11 15:10:33,128 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:33,129 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736552885]
[2020-10-11 15:10:33,129 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:33,168 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 15:10:33,250 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-11 15:10:33,250 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736552885]
[2020-10-11 15:10:33,251 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 15:10:33,251 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 15:10:33,251 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788788378]
[2020-10-11 15:10:33,251 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 15:10:33,252 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 15:10:33,252 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 15:10:33,252 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-11 15:10:33,252 INFO  L87              Difference]: Start difference. First operand 496 states and 1491 transitions. Second operand 6 states.
[2020-10-11 15:10:33,385 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 15:10:33,385 INFO  L93              Difference]: Finished difference Result 535 states and 1568 transitions.
[2020-10-11 15:10:33,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 15:10:33,386 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 13
[2020-10-11 15:10:33,386 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 15:10:33,390 INFO  L225             Difference]: With dead ends: 535
[2020-10-11 15:10:33,390 INFO  L226             Difference]: Without dead ends: 490
[2020-10-11 15:10:33,390 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2020-10-11 15:10:33,393 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 490 states.
[2020-10-11 15:10:33,403 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490.
[2020-10-11 15:10:33,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 490 states.
[2020-10-11 15:10:33,405 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1469 transitions.
[2020-10-11 15:10:33,406 INFO  L78                 Accepts]: Start accepts. Automaton has 490 states and 1469 transitions. Word has length 13
[2020-10-11 15:10:33,406 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 15:10:33,406 INFO  L481      AbstractCegarLoop]: Abstraction has 490 states and 1469 transitions.
[2020-10-11 15:10:33,406 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 15:10:33,406 INFO  L276                IsEmpty]: Start isEmpty. Operand 490 states and 1469 transitions.
[2020-10-11 15:10:33,407 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-11 15:10:33,407 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:33,407 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:33,408 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-11 15:10:33,408 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:33,408 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:33,408 INFO  L82        PathProgramCache]: Analyzing trace with hash -1176297680, now seen corresponding path program 1 times
[2020-10-11 15:10:33,408 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:33,409 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105306013]
[2020-10-11 15:10:33,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:33,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 15:10:33,507 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-11 15:10:33,508 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105306013]
[2020-10-11 15:10:33,508 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 15:10:33,508 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 15:10:33,509 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494209674]
[2020-10-11 15:10:33,509 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 15:10:33,509 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 15:10:33,510 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 15:10:33,510 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-11 15:10:33,510 INFO  L87              Difference]: Start difference. First operand 490 states and 1469 transitions. Second operand 5 states.
[2020-10-11 15:10:33,618 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 15:10:33,619 INFO  L93              Difference]: Finished difference Result 532 states and 1554 transitions.
[2020-10-11 15:10:33,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 15:10:33,620 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-11 15:10:33,620 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 15:10:33,624 INFO  L225             Difference]: With dead ends: 532
[2020-10-11 15:10:33,624 INFO  L226             Difference]: Without dead ends: 484
[2020-10-11 15:10:33,625 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-11 15:10:33,627 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 484 states.
[2020-10-11 15:10:33,638 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484.
[2020-10-11 15:10:33,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 484 states.
[2020-10-11 15:10:33,640 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1447 transitions.
[2020-10-11 15:10:33,641 INFO  L78                 Accepts]: Start accepts. Automaton has 484 states and 1447 transitions. Word has length 13
[2020-10-11 15:10:33,641 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 15:10:33,641 INFO  L481      AbstractCegarLoop]: Abstraction has 484 states and 1447 transitions.
[2020-10-11 15:10:33,641 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 15:10:33,641 INFO  L276                IsEmpty]: Start isEmpty. Operand 484 states and 1447 transitions.
[2020-10-11 15:10:33,642 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-11 15:10:33,642 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:33,642 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:33,643 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-11 15:10:33,643 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:33,643 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:33,643 INFO  L82        PathProgramCache]: Analyzing trace with hash -885223039, now seen corresponding path program 1 times
[2020-10-11 15:10:33,643 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:33,644 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039672800]
[2020-10-11 15:10:33,644 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:33,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 15:10:33,849 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-11 15:10:33,850 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039672800]
[2020-10-11 15:10:33,850 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 15:10:33,850 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 15:10:33,851 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485573051]
[2020-10-11 15:10:33,851 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 15:10:33,852 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 15:10:33,852 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 15:10:33,852 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 15:10:33,852 INFO  L87              Difference]: Start difference. First operand 484 states and 1447 transitions. Second operand 6 states.
[2020-10-11 15:10:33,946 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 15:10:33,947 INFO  L93              Difference]: Finished difference Result 738 states and 2115 transitions.
[2020-10-11 15:10:33,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 15:10:33,948 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 13
[2020-10-11 15:10:33,948 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 15:10:33,953 INFO  L225             Difference]: With dead ends: 738
[2020-10-11 15:10:33,954 INFO  L226             Difference]: Without dead ends: 512
[2020-10-11 15:10:33,954 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2020-10-11 15:10:33,958 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 512 states.
[2020-10-11 15:10:33,971 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 458.
[2020-10-11 15:10:33,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 458 states.
[2020-10-11 15:10:33,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1314 transitions.
[2020-10-11 15:10:33,975 INFO  L78                 Accepts]: Start accepts. Automaton has 458 states and 1314 transitions. Word has length 13
[2020-10-11 15:10:33,976 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 15:10:33,976 INFO  L481      AbstractCegarLoop]: Abstraction has 458 states and 1314 transitions.
[2020-10-11 15:10:33,976 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 15:10:33,976 INFO  L276                IsEmpty]: Start isEmpty. Operand 458 states and 1314 transitions.
[2020-10-11 15:10:33,978 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-11 15:10:33,978 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:33,978 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:33,978 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-11 15:10:33,978 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:33,979 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:33,979 INFO  L82        PathProgramCache]: Analyzing trace with hash -1502303116, now seen corresponding path program 1 times
[2020-10-11 15:10:33,979 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:33,980 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732453945]
[2020-10-11 15:10:33,980 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:34,059 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 15:10:34,200 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-11 15:10:34,201 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732453945]
[2020-10-11 15:10:34,201 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 15:10:34,201 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 15:10:34,202 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490427891]
[2020-10-11 15:10:34,203 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 15:10:34,203 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 15:10:34,204 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 15:10:34,204 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-11 15:10:34,204 INFO  L87              Difference]: Start difference. First operand 458 states and 1314 transitions. Second operand 6 states.
[2020-10-11 15:10:34,366 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 15:10:34,366 INFO  L93              Difference]: Finished difference Result 578 states and 1589 transitions.
[2020-10-11 15:10:34,367 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 15:10:34,367 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 14
[2020-10-11 15:10:34,367 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 15:10:34,370 INFO  L225             Difference]: With dead ends: 578
[2020-10-11 15:10:34,370 INFO  L226             Difference]: Without dead ends: 320
[2020-10-11 15:10:34,371 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2020-10-11 15:10:34,372 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 320 states.
[2020-10-11 15:10:34,380 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 284.
[2020-10-11 15:10:34,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 284 states.
[2020-10-11 15:10:34,382 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 769 transitions.
[2020-10-11 15:10:34,382 INFO  L78                 Accepts]: Start accepts. Automaton has 284 states and 769 transitions. Word has length 14
[2020-10-11 15:10:34,382 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 15:10:34,382 INFO  L481      AbstractCegarLoop]: Abstraction has 284 states and 769 transitions.
[2020-10-11 15:10:34,382 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 15:10:34,383 INFO  L276                IsEmpty]: Start isEmpty. Operand 284 states and 769 transitions.
[2020-10-11 15:10:34,383 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-11 15:10:34,384 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:34,384 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:34,384 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-11 15:10:34,384 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:34,384 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:34,385 INFO  L82        PathProgramCache]: Analyzing trace with hash -1671456319, now seen corresponding path program 1 times
[2020-10-11 15:10:34,385 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:34,385 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785378610]
[2020-10-11 15:10:34,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:34,420 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 15:10:34,477 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-11 15:10:34,477 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785378610]
[2020-10-11 15:10:34,478 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 15:10:34,478 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 15:10:34,478 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573655201]
[2020-10-11 15:10:34,478 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 15:10:34,479 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 15:10:34,479 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 15:10:34,479 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 15:10:34,479 INFO  L87              Difference]: Start difference. First operand 284 states and 769 transitions. Second operand 4 states.
[2020-10-11 15:10:34,516 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 15:10:34,516 INFO  L93              Difference]: Finished difference Result 274 states and 646 transitions.
[2020-10-11 15:10:34,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 15:10:34,517 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-11 15:10:34,517 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 15:10:34,518 INFO  L225             Difference]: With dead ends: 274
[2020-10-11 15:10:34,519 INFO  L226             Difference]: Without dead ends: 204
[2020-10-11 15:10:34,521 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 15:10:34,522 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2020-10-11 15:10:34,527 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204.
[2020-10-11 15:10:34,527 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 204 states.
[2020-10-11 15:10:34,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 471 transitions.
[2020-10-11 15:10:34,529 INFO  L78                 Accepts]: Start accepts. Automaton has 204 states and 471 transitions. Word has length 14
[2020-10-11 15:10:34,529 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 15:10:34,529 INFO  L481      AbstractCegarLoop]: Abstraction has 204 states and 471 transitions.
[2020-10-11 15:10:34,529 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 15:10:34,529 INFO  L276                IsEmpty]: Start isEmpty. Operand 204 states and 471 transitions.
[2020-10-11 15:10:34,530 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-11 15:10:34,530 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:34,530 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:34,531 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-11 15:10:34,531 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:34,531 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:34,531 INFO  L82        PathProgramCache]: Analyzing trace with hash 685420267, now seen corresponding path program 1 times
[2020-10-11 15:10:34,531 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:34,532 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653736828]
[2020-10-11 15:10:34,532 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:34,581 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 15:10:34,659 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-11 15:10:34,659 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653736828]
[2020-10-11 15:10:34,659 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 15:10:34,660 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 15:10:34,660 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604812837]
[2020-10-11 15:10:34,661 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 15:10:34,661 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 15:10:34,661 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 15:10:34,662 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 15:10:34,662 INFO  L87              Difference]: Start difference. First operand 204 states and 471 transitions. Second operand 5 states.
[2020-10-11 15:10:34,704 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 15:10:34,705 INFO  L93              Difference]: Finished difference Result 158 states and 317 transitions.
[2020-10-11 15:10:34,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 15:10:34,706 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-11 15:10:34,707 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 15:10:34,708 INFO  L225             Difference]: With dead ends: 158
[2020-10-11 15:10:34,708 INFO  L226             Difference]: Without dead ends: 120
[2020-10-11 15:10:34,708 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 15:10:34,709 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2020-10-11 15:10:34,714 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120.
[2020-10-11 15:10:34,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 120 states.
[2020-10-11 15:10:34,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 231 transitions.
[2020-10-11 15:10:34,715 INFO  L78                 Accepts]: Start accepts. Automaton has 120 states and 231 transitions. Word has length 15
[2020-10-11 15:10:34,715 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 15:10:34,715 INFO  L481      AbstractCegarLoop]: Abstraction has 120 states and 231 transitions.
[2020-10-11 15:10:34,715 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 15:10:34,716 INFO  L276                IsEmpty]: Start isEmpty. Operand 120 states and 231 transitions.
[2020-10-11 15:10:34,716 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-11 15:10:34,716 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:34,716 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:34,717 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-11 15:10:34,717 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:34,717 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:34,717 INFO  L82        PathProgramCache]: Analyzing trace with hash -436155594, now seen corresponding path program 1 times
[2020-10-11 15:10:34,717 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:34,718 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855725907]
[2020-10-11 15:10:34,718 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:34,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 15:10:34,808 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-11 15:10:34,809 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855725907]
[2020-10-11 15:10:34,809 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 15:10:34,809 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 15:10:34,810 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881715174]
[2020-10-11 15:10:34,810 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 15:10:34,810 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 15:10:34,811 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 15:10:34,811 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 15:10:34,811 INFO  L87              Difference]: Start difference. First operand 120 states and 231 transitions. Second operand 6 states.
[2020-10-11 15:10:34,871 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 15:10:34,871 INFO  L93              Difference]: Finished difference Result 98 states and 186 transitions.
[2020-10-11 15:10:34,872 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 15:10:34,873 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2020-10-11 15:10:34,873 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 15:10:34,874 INFO  L225             Difference]: With dead ends: 98
[2020-10-11 15:10:34,874 INFO  L226             Difference]: Without dead ends: 72
[2020-10-11 15:10:34,875 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-11 15:10:34,875 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2020-10-11 15:10:34,878 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72.
[2020-10-11 15:10:34,878 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 72 states.
[2020-10-11 15:10:34,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 133 transitions.
[2020-10-11 15:10:34,879 INFO  L78                 Accepts]: Start accepts. Automaton has 72 states and 133 transitions. Word has length 17
[2020-10-11 15:10:34,880 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 15:10:34,880 INFO  L481      AbstractCegarLoop]: Abstraction has 72 states and 133 transitions.
[2020-10-11 15:10:34,880 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 15:10:34,881 INFO  L276                IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions.
[2020-10-11 15:10:34,881 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-11 15:10:34,882 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:34,882 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:34,882 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-11 15:10:34,882 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:34,883 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:34,883 INFO  L82        PathProgramCache]: Analyzing trace with hash -1050728128, now seen corresponding path program 1 times
[2020-10-11 15:10:34,883 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:34,884 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288856631]
[2020-10-11 15:10:34,884 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:34,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 15:10:35,011 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-11 15:10:35,012 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288856631]
[2020-10-11 15:10:35,012 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 15:10:35,012 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 15:10:35,013 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732459122]
[2020-10-11 15:10:35,013 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 15:10:35,013 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 15:10:35,014 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 15:10:35,014 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-11 15:10:35,014 INFO  L87              Difference]: Start difference. First operand 72 states and 133 transitions. Second operand 7 states.
[2020-10-11 15:10:35,126 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 15:10:35,126 INFO  L93              Difference]: Finished difference Result 119 states and 225 transitions.
[2020-10-11 15:10:35,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 15:10:35,127 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 21
[2020-10-11 15:10:35,127 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 15:10:35,128 INFO  L225             Difference]: With dead ends: 119
[2020-10-11 15:10:35,128 INFO  L226             Difference]: Without dead ends: 60
[2020-10-11 15:10:35,128 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2020-10-11 15:10:35,128 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2020-10-11 15:10:35,130 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2020-10-11 15:10:35,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 60 states.
[2020-10-11 15:10:35,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 109 transitions.
[2020-10-11 15:10:35,131 INFO  L78                 Accepts]: Start accepts. Automaton has 60 states and 109 transitions. Word has length 21
[2020-10-11 15:10:35,131 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 15:10:35,131 INFO  L481      AbstractCegarLoop]: Abstraction has 60 states and 109 transitions.
[2020-10-11 15:10:35,131 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 15:10:35,131 INFO  L276                IsEmpty]: Start isEmpty. Operand 60 states and 109 transitions.
[2020-10-11 15:10:35,132 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-11 15:10:35,132 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:35,132 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:35,132 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-11 15:10:35,132 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:35,133 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:35,133 INFO  L82        PathProgramCache]: Analyzing trace with hash 96282604, now seen corresponding path program 2 times
[2020-10-11 15:10:35,133 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:35,133 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804825873]
[2020-10-11 15:10:35,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:35,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 15:10:35,201 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-11 15:10:35,201 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804825873]
[2020-10-11 15:10:35,201 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 15:10:35,201 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 15:10:35,202 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367860556]
[2020-10-11 15:10:35,202 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 15:10:35,202 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 15:10:35,202 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 15:10:35,203 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-11 15:10:35,203 INFO  L87              Difference]: Start difference. First operand 60 states and 109 transitions. Second operand 5 states.
[2020-10-11 15:10:35,236 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 15:10:35,237 INFO  L93              Difference]: Finished difference Result 83 states and 148 transitions.
[2020-10-11 15:10:35,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 15:10:35,237 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 21
[2020-10-11 15:10:35,237 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 15:10:35,238 INFO  L225             Difference]: With dead ends: 83
[2020-10-11 15:10:35,238 INFO  L226             Difference]: Without dead ends: 36
[2020-10-11 15:10:35,238 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-11 15:10:35,239 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2020-10-11 15:10:35,239 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2020-10-11 15:10:35,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2020-10-11 15:10:35,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions.
[2020-10-11 15:10:35,240 INFO  L78                 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21
[2020-10-11 15:10:35,240 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 15:10:35,240 INFO  L481      AbstractCegarLoop]: Abstraction has 36 states and 53 transitions.
[2020-10-11 15:10:35,240 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 15:10:35,241 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions.
[2020-10-11 15:10:35,241 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-11 15:10:35,241 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 15:10:35,241 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 15:10:35,241 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-11 15:10:35,242 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 15:10:35,242 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 15:10:35,242 INFO  L82        PathProgramCache]: Analyzing trace with hash 1870510084, now seen corresponding path program 3 times
[2020-10-11 15:10:35,242 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 15:10:35,242 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424368747]
[2020-10-11 15:10:35,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 15:10:35,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 15:10:35,274 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 15:10:35,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 15:10:35,304 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 15:10:35,342 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-11 15:10:35,342 INFO  L519         BasicCegarLoop]: Counterexample might be feasible
[2020-10-11 15:10:35,343 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-11 15:10:35,371 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-11 15:10:35,372 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,373 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-11 15:10:35,374 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,375 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-11 15:10:35,375 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,375 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-11 15:10:35,375 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,376 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-11 15:10:35,376 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,376 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-11 15:10:35,376 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,377 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-11 15:10:35,377 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,378 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-11 15:10:35,378 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,378 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-11 15:10:35,378 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,378 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-11 15:10:35,378 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,378 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-11 15:10:35,379 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,379 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-11 15:10:35,379 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,380 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-11 15:10:35,380 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,380 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-11 15:10:35,380 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,381 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-11 15:10:35,381 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,381 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-11 15:10:35,381 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,381 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-11 15:10:35,381 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,382 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-11 15:10:35,382 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,387 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-11 15:10:35,387 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,387 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-11 15:10:35,387 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,387 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-11 15:10:35,388 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,388 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-11 15:10:35,388 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,388 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-11 15:10:35,388 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,388 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-11 15:10:35,389 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,389 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-11 15:10:35,389 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,389 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-11 15:10:35,389 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,389 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-11 15:10:35,389 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,390 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-11 15:10:35,390 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 15:10:35,475 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:10:35 BasicIcfg
[2020-10-11 15:10:35,475 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-11 15:10:35,477 INFO  L168              Benchmark]: Toolchain (without parser) took 11889.24 ms. Allocated memory was 246.9 MB in the beginning and 501.2 MB in the end (delta: 254.3 MB). Free memory was 199.6 MB in the beginning and 398.7 MB in the end (delta: -199.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 14.2 GB.
[2020-10-11 15:10:35,477 INFO  L168              Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 246.9 MB. Free memory is still 220.8 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-11 15:10:35,480 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 719.62 ms. Allocated memory was 246.9 MB in the beginning and 305.1 MB in the end (delta: 58.2 MB). Free memory was 199.6 MB in the beginning and 253.4 MB in the end (delta: -53.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB.
[2020-10-11 15:10:35,481 INFO  L168              Benchmark]: Boogie Procedure Inliner took 69.36 ms. Allocated memory is still 305.1 MB. Free memory was 253.4 MB in the beginning and 248.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB.
[2020-10-11 15:10:35,482 INFO  L168              Benchmark]: Boogie Preprocessor took 50.78 ms. Allocated memory is still 305.1 MB. Free memory was 248.4 MB in the beginning and 245.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 15:10:35,482 INFO  L168              Benchmark]: RCFGBuilder took 1968.09 ms. Allocated memory was 305.1 MB in the beginning and 351.8 MB in the end (delta: 46.7 MB). Free memory was 245.9 MB in the beginning and 197.0 MB in the end (delta: 48.9 MB). Peak memory consumption was 95.6 MB. Max. memory is 14.2 GB.
[2020-10-11 15:10:35,483 INFO  L168              Benchmark]: TraceAbstraction took 9074.65 ms. Allocated memory was 351.8 MB in the beginning and 501.2 MB in the end (delta: 149.4 MB). Free memory was 197.0 MB in the beginning and 398.7 MB in the end (delta: -201.7 MB). There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-11 15:10:35,488 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.22 ms. Allocated memory is still 246.9 MB. Free memory is still 220.8 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 719.62 ms. Allocated memory was 246.9 MB in the beginning and 305.1 MB in the end (delta: 58.2 MB). Free memory was 199.6 MB in the beginning and 253.4 MB in the end (delta: -53.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 69.36 ms. Allocated memory is still 305.1 MB. Free memory was 253.4 MB in the beginning and 248.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 50.78 ms. Allocated memory is still 305.1 MB. Free memory was 248.4 MB in the beginning and 245.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 1968.09 ms. Allocated memory was 305.1 MB in the beginning and 351.8 MB in the end (delta: 46.7 MB). Free memory was 245.9 MB in the beginning and 197.0 MB in the end (delta: 48.9 MB). Peak memory consumption was 95.6 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 9074.65 ms. Allocated memory was 351.8 MB in the beginning and 501.2 MB in the end (delta: 149.4 MB). Free memory was 197.0 MB in the beginning and 398.7 MB in the end (delta: -201.7 MB). There was no memory consumed. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1043 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 147 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.2s, 99 PlacesBefore, 36 PlacesAfterwards, 91 TransitionsBefore, 27 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 4104 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p0_EAX = 0;
[L701]               0  _Bool main$tmp_guard0;
[L702]               0  _Bool main$tmp_guard1;
[L704]               0  int x = 0;
[L706]               0  int y = 0;
[L707]               0  _Bool y$flush_delayed;
[L708]               0  int y$mem_tmp;
[L709]               0  _Bool y$r_buff0_thd0;
[L710]               0  _Bool y$r_buff0_thd1;
[L711]               0  _Bool y$r_buff0_thd2;
[L712]               0  _Bool y$r_buff0_thd3;
[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$r_buff1_thd3;
[L717]               0  _Bool y$read_delayed;
[L718]               0  int *y$read_delayed_var;
[L719]               0  int y$w_buff0;
[L720]               0  _Bool y$w_buff0_used;
[L721]               0  int y$w_buff1;
[L722]               0  _Bool y$w_buff1_used;
[L724]               0  int z = 0;
[L725]               0  _Bool weak$$choice0;
[L726]               0  _Bool weak$$choice2;
[L804]               0  pthread_t t2522;
[L805]  FCALL, FORK  0  pthread_create(&t2522, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L806]               0  pthread_t t2523;
[L807]  FCALL, FORK  0  pthread_create(&t2523, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L808]               0  pthread_t t2524;
[L809]  FCALL, FORK  0  pthread_create(&t2524, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L767]               3  y$w_buff1 = y$w_buff0
[L768]               3  y$w_buff0 = 2
[L769]               3  y$w_buff1_used = y$w_buff0_used
[L770]               3  y$w_buff0_used = (_Bool)1
[L7]    COND FALSE   3  !(!expression)
[L772]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L773]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L774]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L775]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L776]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L779]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L730]               1  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2]
[L735]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2]
[L747]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2]
[L750]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2]
[L753]  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)
[L753]               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)
[L754]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L754]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L755]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L755]               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
[L756]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L756]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L757]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L757]               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
[L740]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L742]               1  return 0;
[L760]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L762]               2  return 0;
[L782]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L782]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L782]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L782]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L783]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L783]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L784]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L784]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L785]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L785]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L786]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L786]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L789]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L791]               3  return 0;
[L811]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
[L815]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L815]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L816]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L816]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L817]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L817]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L818]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L818]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L819]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L819]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L822]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L823]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L824]               0  y$flush_delayed = weak$$choice2
[L825]               0  y$mem_tmp = y
[L826]  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)
[L826]               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)
[L827]  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))
[L827]  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 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L827]  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))
[L827]               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))
[L828]  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))
[L828]  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)
[L828]  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))
[L828]               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))
[L829]  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))
[L829]               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))
[L830]  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))
[L830]  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)
[L830]  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))
[L830]               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))
[L831]  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))
[L831]               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))
[L832]  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))
[L832]               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))
[L833]               0  main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0)
[L834]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L834]               0  y = y$flush_delayed ? y$mem_tmp : y
[L835]               0  y$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 323 SDtfs, 382 SDslu, 611 SDs, 0 SdLazy, 315 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 90 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 13248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...