/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/mix055_pso.opt.i


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


This is Ultimate 0.1.25-11af1e5
[2020-10-11 14:55:36,356 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-11 14:55:36,358 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-11 14:55:36,392 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-11 14:55:36,393 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-11 14:55:36,394 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-11 14:55:36,395 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-11 14:55:36,397 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-11 14:55:36,398 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-11 14:55:36,399 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-11 14:55:36,400 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-11 14:55:36,401 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-11 14:55:36,401 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-11 14:55:36,402 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-11 14:55:36,403 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-11 14:55:36,404 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-11 14:55:36,405 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-11 14:55:36,406 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-11 14:55:36,407 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-11 14:55:36,409 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-11 14:55:36,410 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-11 14:55:36,411 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-11 14:55:36,412 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-11 14:55:36,413 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-11 14:55:36,415 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-11 14:55:36,416 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-11 14:55:36,416 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-11 14:55:36,417 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-11 14:55:36,417 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-11 14:55:36,418 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-11 14:55:36,418 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-11 14:55:36,419 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-11 14:55:36,419 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-11 14:55:36,420 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-11 14:55:36,421 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-11 14:55:36,421 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-11 14:55:36,422 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-11 14:55:36,422 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-11 14:55:36,422 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-11 14:55:36,423 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-11 14:55:36,424 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-11 14:55:36,425 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 14:55:36,445 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-11 14:55:36,446 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-11 14:55:36,447 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-11 14:55:36,447 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-11 14:55:36,447 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-11 14:55:36,447 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-11 14:55:36,448 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-11 14:55:36,448 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-11 14:55:36,448 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-11 14:55:36,448 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-11 14:55:36,448 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-11 14:55:36,449 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-11 14:55:36,449 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-11 14:55:36,452 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-11 14:55:36,452 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-11 14:55:36,452 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-11 14:55:36,453 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-11 14:55:36,453 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-11 14:55:36,453 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-11 14:55:36,453 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-11 14:55:36,454 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-11 14:55:36,454 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 14:55:36,454 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-11 14:55:36,454 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-11 14:55:36,454 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-11 14:55:36,455 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-11 14:55:36,455 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-11 14:55:36,459 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-11 14:55:36,459 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-11 14:55:36,459 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-11 14:55:36,771 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-11 14:55:36,789 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-11 14:55:36,793 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-11 14:55:36,794 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-11 14:55:36,794 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-11 14:55:36,795 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i
[2020-10-11 14:55:36,861 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add8b27f9/1661ac48615843718058fa682cc118ed/FLAGae0c6da86
[2020-10-11 14:55:37,355 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-11 14:55:37,356 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i
[2020-10-11 14:55:37,390 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add8b27f9/1661ac48615843718058fa682cc118ed/FLAGae0c6da86
[2020-10-11 14:55:37,654 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add8b27f9/1661ac48615843718058fa682cc118ed
[2020-10-11 14:55:37,666 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-11 14:55:37,668 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-11 14:55:37,671 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-11 14:55:37,671 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-11 14:55:37,675 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-11 14:55:37,676 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:55:37" (1/1) ...
[2020-10-11 14:55:37,679 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466f23be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37, skipping insertion in model container
[2020-10-11 14:55:37,680 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:55:37" (1/1) ...
[2020-10-11 14:55:37,689 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-11 14:55:37,771 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-11 14:55:38,269 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:55:38,287 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-11 14:55:38,373 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:55:38,470 INFO  L208         MainTranslator]: Completed translation
[2020-10-11 14:55:38,471 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:38 WrapperNode
[2020-10-11 14:55:38,471 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-11 14:55:38,472 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-11 14:55:38,472 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-11 14:55:38,472 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-11 14:55:38,481 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:38" (1/1) ...
[2020-10-11 14:55:38,528 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:38" (1/1) ...
[2020-10-11 14:55:38,583 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-11 14:55:38,585 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-11 14:55:38,586 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-11 14:55:38,586 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-11 14:55:38,596 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:38" (1/1) ...
[2020-10-11 14:55:38,597 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:38" (1/1) ...
[2020-10-11 14:55:38,616 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:38" (1/1) ...
[2020-10-11 14:55:38,619 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:38" (1/1) ...
[2020-10-11 14:55:38,637 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:38" (1/1) ...
[2020-10-11 14:55:38,643 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:38" (1/1) ...
[2020-10-11 14:55:38,649 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:38" (1/1) ...
[2020-10-11 14:55:38,659 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-11 14:55:38,663 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-11 14:55:38,663 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-11 14:55:38,663 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-11 14:55:38,664 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:38" (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 14:55:38,740 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-11 14:55:38,741 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-11 14:55:38,742 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-11 14:55:38,742 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-11 14:55:38,742 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-11 14:55:38,743 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-11 14:55:38,743 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-11 14:55:38,744 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-11 14:55:38,744 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-11 14:55:38,745 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-11 14:55:38,745 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-11 14:55:38,745 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-11 14:55:38,745 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-11 14:55:38,745 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-11 14:55:38,745 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-11 14:55:38,747 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 14:55:40,646 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-11 14:55:40,647 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-11 14:55:40,649 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:55:40 BoogieIcfgContainer
[2020-10-11 14:55:40,649 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-11 14:55:40,650 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-11 14:55:40,650 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-11 14:55:40,653 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-11 14:55:40,654 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:55:37" (1/3) ...
[2020-10-11 14:55:40,654 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727e9379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:55:40, skipping insertion in model container
[2020-10-11 14:55:40,655 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:38" (2/3) ...
[2020-10-11 14:55:40,655 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727e9379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:55:40, skipping insertion in model container
[2020-10-11 14:55:40,655 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:55:40" (3/3) ...
[2020-10-11 14:55:40,657 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix055_pso.opt.i
[2020-10-11 14:55:40,668 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-11 14:55:40,668 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-11 14:55:40,675 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-11 14:55:40,676 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-11 14:55:40,704 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,704 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,704 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,705 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,705 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,705 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,706 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,706 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,706 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,706 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,706 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,707 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,707 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,707 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,707 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,708 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,708 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,708 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,708 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,709 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,709 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,709 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,709 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,710 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,710 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,710 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,711 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,711 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,711 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,711 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,711 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,712 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,712 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,712 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,712 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,713 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,713 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,713 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,713 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,713 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,714 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,714 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,717 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,718 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,718 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,718 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,718 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,719 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,719 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,719 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,719 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,719 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,725 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,726 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,726 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,726 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,726 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,726 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,727 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,727 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,727 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,727 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,727 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,728 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,730 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,730 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,731 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,731 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,733 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,733 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,733 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,733 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:55:40,747 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-11 14:55:40,767 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-11 14:55:40,767 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-11 14:55:40,767 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-11 14:55:40,767 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-11 14:55:40,767 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-11 14:55:40,767 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-11 14:55:40,768 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-11 14:55:40,768 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-11 14:55:40,781 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-11 14:55:40,783 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 236 flow
[2020-10-11 14:55:40,786 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 236 flow
[2020-10-11 14:55:40,788 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow
[2020-10-11 14:55:40,838 INFO  L129       PetriNetUnfolder]: 2/104 cut-off events.
[2020-10-11 14:55:40,838 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 14:55:40,843 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. 
[2020-10-11 14:55:40,847 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2352
[2020-10-11 14:55:41,169 WARN  L193               SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45
[2020-10-11 14:55:41,265 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:41,265 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,267 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:55:41,268 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,311 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:41,311 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,313 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:55:41,314 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,417 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:41,417 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,419 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:55:41,419 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,423 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-11 14:55:41,424 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:55:41,428 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term
[2020-10-11 14:55:41,428 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,478 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:41,479 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:41,483 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:41,484 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,485 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:41,485 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,489 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:41,489 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:55:41,492 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:41,492 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:55:41,494 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:41,494 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:55:41,496 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term
[2020-10-11 14:55:41,496 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,498 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:41,498 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,501 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:41,501 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,560 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:41,560 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:41,561 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term
[2020-10-11 14:55:41,561 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:41,582 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:41,583 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,583 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:55:41,584 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,634 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:41,635 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,636 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:55:41,636 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,656 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:41,657 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:41,657 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:55:41,658 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:42,836 WARN  L193               SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 228 DAG size of output: 188
[2020-10-11 14:55:42,858 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term
[2020-10-11 14:55:42,858 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:42,860 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:55:42,860 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:43,680 WARN  L193               SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125
[2020-10-11 14:55:43,711 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:43,711 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:43,712 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:55:43,712 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:43,731 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:43,731 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:43,732 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:55:43,732 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:43,783 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:55:43,783 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:43,784 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:43,784 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:43,786 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:43,787 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:55:43,789 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:55:43,790 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:55:43,804 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:55:43,805 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:43,806 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:43,806 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:43,807 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:43,808 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:55:43,809 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:55:43,810 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:55:43,848 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:55:43,848 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:43,849 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:43,849 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:43,851 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:43,852 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:55:43,853 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:55:43,853 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:55:43,866 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:55:43,867 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:43,868 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:43,868 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:43,869 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:43,870 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:55:43,871 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:55:43,872 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:55:44,080 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:44,081 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:44,082 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:55:44,082 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:44,104 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:44,104 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:44,105 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term
[2020-10-11 14:55:44,105 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:44,155 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:44,156 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:44,158 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:44,158 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:44,159 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:44,160 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:44,163 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:44,163 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:55:44,164 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:44,165 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:55:44,166 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:44,167 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:55:44,170 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term
[2020-10-11 14:55:44,170 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:44,173 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:44,173 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:44,175 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:44,175 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:44,222 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:55:44,223 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:44,224 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:55:44,224 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:44,227 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-11 14:55:44,227 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:55:44,251 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term
[2020-10-11 14:55:44,252 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:44,578 WARN  L193               SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2020-10-11 14:55:45,001 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:55:45,002 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:45,238 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-11 14:55:45,238 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:45,239 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term
[2020-10-11 14:55:45,240 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:45,240 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:45,241 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:45,244 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:45,245 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:45,248 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:45,248 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:45,250 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:45,250 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:45,258 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-11 14:55:45,259 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:45,262 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:45,262 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:45,263 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:45,264 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:45,285 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-11 14:55:45,285 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:55:45,287 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-11 14:55:45,287 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:45,333 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:55:45,334 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:45,554 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-11 14:55:45,554 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:55:45,556 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-11 14:55:45,556 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:45,591 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-11 14:55:45,594 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:45,596 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term
[2020-10-11 14:55:45,599 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:45,600 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:45,600 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:45,601 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:45,602 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:55:45,604 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:45,605 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:45,606 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:45,607 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:45,609 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-11 14:55:45,610 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:45,611 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:45,612 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:45,614 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-11 14:55:45,614 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:55:46,491 WARN  L193               SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93
[2020-10-11 14:55:46,607 WARN  L193               SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 91
[2020-10-11 14:55:46,618 INFO  L132        LiptonReduction]: Checked pairs total: 6555
[2020-10-11 14:55:46,618 INFO  L134        LiptonReduction]: Total number of compositions: 89
[2020-10-11 14:55:46,624 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow
[2020-10-11 14:55:46,816 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3082 states.
[2020-10-11 14:55:46,818 INFO  L276                IsEmpty]: Start isEmpty. Operand 3082 states.
[2020-10-11 14:55:46,826 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-11 14:55:46,826 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:46,827 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:55:46,827 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:46,833 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:46,833 INFO  L82        PathProgramCache]: Analyzing trace with hash -2065333905, now seen corresponding path program 1 times
[2020-10-11 14:55:46,843 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:46,843 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469749074]
[2020-10-11 14:55:46,843 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:46,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:47,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:55:47,082 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469749074]
[2020-10-11 14:55:47,082 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:47,083 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:55:47,083 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092209793]
[2020-10-11 14:55:47,088 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:55:47,088 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:47,102 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:55:47,103 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:55:47,105 INFO  L87              Difference]: Start difference. First operand 3082 states. Second operand 3 states.
[2020-10-11 14:55:47,217 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:47,217 INFO  L93              Difference]: Finished difference Result 2602 states and 10064 transitions.
[2020-10-11 14:55:47,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:55:47,219 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-11 14:55:47,220 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:47,259 INFO  L225             Difference]: With dead ends: 2602
[2020-10-11 14:55:47,260 INFO  L226             Difference]: Without dead ends: 2202
[2020-10-11 14:55:47,263 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 14:55:47,302 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2202 states.
[2020-10-11 14:55:47,410 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202.
[2020-10-11 14:55:47,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2202 states.
[2020-10-11 14:55:47,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions.
[2020-10-11 14:55:47,430 INFO  L78                 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9
[2020-10-11 14:55:47,431 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:47,431 INFO  L481      AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions.
[2020-10-11 14:55:47,432 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:55:47,432 INFO  L276                IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions.
[2020-10-11 14:55:47,441 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-11 14:55:47,441 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:47,441 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:55:47,442 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-11 14:55:47,442 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:47,442 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:47,443 INFO  L82        PathProgramCache]: Analyzing trace with hash 1342131682, now seen corresponding path program 1 times
[2020-10-11 14:55:47,443 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:47,443 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812704577]
[2020-10-11 14:55:47,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:47,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:47,603 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 14:55:47,603 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812704577]
[2020-10-11 14:55:47,604 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:47,604 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:55:47,604 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449532956]
[2020-10-11 14:55:47,606 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:55:47,606 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:47,606 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:55:47,606 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:55:47,607 INFO  L87              Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand 4 states.
[2020-10-11 14:55:47,673 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:47,674 INFO  L93              Difference]: Finished difference Result 2502 states and 9254 transitions.
[2020-10-11 14:55:47,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:55:47,674 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-11 14:55:47,675 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:47,694 INFO  L225             Difference]: With dead ends: 2502
[2020-10-11 14:55:47,694 INFO  L226             Difference]: Without dead ends: 2102
[2020-10-11 14:55:47,695 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:55:47,708 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2102 states.
[2020-10-11 14:55:47,819 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2102.
[2020-10-11 14:55:47,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2102 states.
[2020-10-11 14:55:47,832 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7964 transitions.
[2020-10-11 14:55:47,832 INFO  L78                 Accepts]: Start accepts. Automaton has 2102 states and 7964 transitions. Word has length 12
[2020-10-11 14:55:47,832 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:47,833 INFO  L481      AbstractCegarLoop]: Abstraction has 2102 states and 7964 transitions.
[2020-10-11 14:55:47,833 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:55:47,833 INFO  L276                IsEmpty]: Start isEmpty. Operand 2102 states and 7964 transitions.
[2020-10-11 14:55:47,835 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-11 14:55:47,835 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:47,835 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:55:47,835 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-11 14:55:47,836 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:47,840 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:47,843 INFO  L82        PathProgramCache]: Analyzing trace with hash -1343575012, now seen corresponding path program 1 times
[2020-10-11 14:55:47,843 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:47,843 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158715871]
[2020-10-11 14:55:47,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:47,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:47,969 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 14:55:47,970 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158715871]
[2020-10-11 14:55:47,970 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:47,970 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:55:47,971 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721984124]
[2020-10-11 14:55:47,971 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:55:47,971 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:47,971 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:55:47,972 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:55:47,972 INFO  L87              Difference]: Start difference. First operand 2102 states and 7964 transitions. Second operand 5 states.
[2020-10-11 14:55:48,084 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:48,084 INFO  L93              Difference]: Finished difference Result 2516 states and 9276 transitions.
[2020-10-11 14:55:48,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 14:55:48,085 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-11 14:55:48,085 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:48,104 INFO  L225             Difference]: With dead ends: 2516
[2020-10-11 14:55:48,104 INFO  L226             Difference]: Without dead ends: 2110
[2020-10-11 14:55:48,104 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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 14:55:48,115 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2110 states.
[2020-10-11 14:55:48,167 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2110.
[2020-10-11 14:55:48,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2110 states.
[2020-10-11 14:55:48,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 7940 transitions.
[2020-10-11 14:55:48,178 INFO  L78                 Accepts]: Start accepts. Automaton has 2110 states and 7940 transitions. Word has length 13
[2020-10-11 14:55:48,179 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:48,179 INFO  L481      AbstractCegarLoop]: Abstraction has 2110 states and 7940 transitions.
[2020-10-11 14:55:48,179 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:55:48,179 INFO  L276                IsEmpty]: Start isEmpty. Operand 2110 states and 7940 transitions.
[2020-10-11 14:55:48,181 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-11 14:55:48,182 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:48,182 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:55:48,182 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-11 14:55:48,182 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:48,182 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:48,182 INFO  L82        PathProgramCache]: Analyzing trace with hash 1298059037, now seen corresponding path program 1 times
[2020-10-11 14:55:48,183 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:48,183 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304406634]
[2020-10-11 14:55:48,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:48,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:48,313 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 14:55:48,315 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304406634]
[2020-10-11 14:55:48,315 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:48,315 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:55:48,316 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185646267]
[2020-10-11 14:55:48,316 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:55:48,316 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:48,317 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:55:48,317 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:55:48,317 INFO  L87              Difference]: Start difference. First operand 2110 states and 7940 transitions. Second operand 6 states.
[2020-10-11 14:55:48,478 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:48,478 INFO  L93              Difference]: Finished difference Result 2278 states and 8334 transitions.
[2020-10-11 14:55:48,479 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 14:55:48,479 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 14
[2020-10-11 14:55:48,480 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:48,496 INFO  L225             Difference]: With dead ends: 2278
[2020-10-11 14:55:48,496 INFO  L226             Difference]: Without dead ends: 1998
[2020-10-11 14:55:48,496 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-11 14:55:48,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1998 states.
[2020-10-11 14:55:48,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1934.
[2020-10-11 14:55:48,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1934 states.
[2020-10-11 14:55:48,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 7220 transitions.
[2020-10-11 14:55:48,561 INFO  L78                 Accepts]: Start accepts. Automaton has 1934 states and 7220 transitions. Word has length 14
[2020-10-11 14:55:48,561 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:48,561 INFO  L481      AbstractCegarLoop]: Abstraction has 1934 states and 7220 transitions.
[2020-10-11 14:55:48,561 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:55:48,562 INFO  L276                IsEmpty]: Start isEmpty. Operand 1934 states and 7220 transitions.
[2020-10-11 14:55:48,564 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-11 14:55:48,564 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:48,564 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:55:48,565 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-11 14:55:48,565 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:48,565 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:48,565 INFO  L82        PathProgramCache]: Analyzing trace with hash 1610053253, now seen corresponding path program 1 times
[2020-10-11 14:55:48,565 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:48,566 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128637332]
[2020-10-11 14:55:48,566 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:48,632 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:48,723 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 14:55:48,724 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128637332]
[2020-10-11 14:55:48,724 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:48,725 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:55:48,725 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429341768]
[2020-10-11 14:55:48,725 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:55:48,726 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:48,726 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:55:48,726 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:55:48,726 INFO  L87              Difference]: Start difference. First operand 1934 states and 7220 transitions. Second operand 5 states.
[2020-10-11 14:55:48,819 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:48,819 INFO  L93              Difference]: Finished difference Result 2160 states and 7898 transitions.
[2020-10-11 14:55:48,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 14:55:48,820 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-11 14:55:48,821 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:48,835 INFO  L225             Difference]: With dead ends: 2160
[2020-10-11 14:55:48,835 INFO  L226             Difference]: Without dead ends: 1950
[2020-10-11 14:55:48,836 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 14:55:48,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1950 states.
[2020-10-11 14:55:48,882 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1950.
[2020-10-11 14:55:48,882 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1950 states.
[2020-10-11 14:55:48,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 7276 transitions.
[2020-10-11 14:55:48,890 INFO  L78                 Accepts]: Start accepts. Automaton has 1950 states and 7276 transitions. Word has length 15
[2020-10-11 14:55:48,890 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:48,891 INFO  L481      AbstractCegarLoop]: Abstraction has 1950 states and 7276 transitions.
[2020-10-11 14:55:48,891 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:55:48,891 INFO  L276                IsEmpty]: Start isEmpty. Operand 1950 states and 7276 transitions.
[2020-10-11 14:55:48,894 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-11 14:55:48,894 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:48,894 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:55:48,894 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-11 14:55:48,894 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:48,894 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:48,895 INFO  L82        PathProgramCache]: Analyzing trace with hash 1351736453, now seen corresponding path program 2 times
[2020-10-11 14:55:48,895 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:48,895 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603523777]
[2020-10-11 14:55:48,895 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:48,913 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:49,057 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 14:55:49,057 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603523777]
[2020-10-11 14:55:49,057 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:49,058 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:55:49,058 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717494741]
[2020-10-11 14:55:49,058 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:55:49,058 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:49,059 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:55:49,059 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:55:49,059 INFO  L87              Difference]: Start difference. First operand 1950 states and 7276 transitions. Second operand 6 states.
[2020-10-11 14:55:49,284 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:49,284 INFO  L93              Difference]: Finished difference Result 2268 states and 8286 transitions.
[2020-10-11 14:55:49,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 14:55:49,286 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2020-10-11 14:55:49,286 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:49,301 INFO  L225             Difference]: With dead ends: 2268
[2020-10-11 14:55:49,301 INFO  L226             Difference]: Without dead ends: 2002
[2020-10-11 14:55:49,302 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90
[2020-10-11 14:55:49,310 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2002 states.
[2020-10-11 14:55:49,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1986.
[2020-10-11 14:55:49,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1986 states.
[2020-10-11 14:55:49,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 7332 transitions.
[2020-10-11 14:55:49,356 INFO  L78                 Accepts]: Start accepts. Automaton has 1986 states and 7332 transitions. Word has length 15
[2020-10-11 14:55:49,356 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:49,356 INFO  L481      AbstractCegarLoop]: Abstraction has 1986 states and 7332 transitions.
[2020-10-11 14:55:49,356 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:55:49,356 INFO  L276                IsEmpty]: Start isEmpty. Operand 1986 states and 7332 transitions.
[2020-10-11 14:55:49,360 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-11 14:55:49,360 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:49,360 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:55:49,360 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-11 14:55:49,360 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:49,361 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:49,361 INFO  L82        PathProgramCache]: Analyzing trace with hash 666758434, now seen corresponding path program 1 times
[2020-10-11 14:55:49,361 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:49,361 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467448461]
[2020-10-11 14:55:49,361 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:49,399 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:49,450 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 14:55:49,451 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467448461]
[2020-10-11 14:55:49,451 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:49,451 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:55:49,452 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037674389]
[2020-10-11 14:55:49,452 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:55:49,452 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:49,452 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:55:49,452 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:55:49,453 INFO  L87              Difference]: Start difference. First operand 1986 states and 7332 transitions. Second operand 4 states.
[2020-10-11 14:55:49,551 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:49,551 INFO  L93              Difference]: Finished difference Result 2042 states and 6886 transitions.
[2020-10-11 14:55:49,552 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:55:49,552 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2020-10-11 14:55:49,552 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:49,575 INFO  L225             Difference]: With dead ends: 2042
[2020-10-11 14:55:49,575 INFO  L226             Difference]: Without dead ends: 1578
[2020-10-11 14:55:49,575 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 14:55:49,582 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1578 states.
[2020-10-11 14:55:49,611 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578.
[2020-10-11 14:55:49,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1578 states.
[2020-10-11 14:55:49,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 5292 transitions.
[2020-10-11 14:55:49,616 INFO  L78                 Accepts]: Start accepts. Automaton has 1578 states and 5292 transitions. Word has length 16
[2020-10-11 14:55:49,616 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:49,617 INFO  L481      AbstractCegarLoop]: Abstraction has 1578 states and 5292 transitions.
[2020-10-11 14:55:49,617 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:55:49,617 INFO  L276                IsEmpty]: Start isEmpty. Operand 1578 states and 5292 transitions.
[2020-10-11 14:55:49,621 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-11 14:55:49,621 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:49,621 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 14:55:49,621 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-11 14:55:49,621 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:49,622 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:49,622 INFO  L82        PathProgramCache]: Analyzing trace with hash -1803367302, now seen corresponding path program 1 times
[2020-10-11 14:55:49,622 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:49,622 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519344980]
[2020-10-11 14:55:49,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:49,695 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:49,772 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 14:55:49,773 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519344980]
[2020-10-11 14:55:49,773 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:49,773 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:55:49,773 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500991494]
[2020-10-11 14:55:49,774 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:55:49,774 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:49,774 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:55:49,774 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:55:49,774 INFO  L87              Difference]: Start difference. First operand 1578 states and 5292 transitions. Second operand 5 states.
[2020-10-11 14:55:49,831 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:49,831 INFO  L93              Difference]: Finished difference Result 1314 states and 4010 transitions.
[2020-10-11 14:55:49,832 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 14:55:49,832 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2020-10-11 14:55:49,832 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:49,836 INFO  L225             Difference]: With dead ends: 1314
[2020-10-11 14:55:49,836 INFO  L226             Difference]: Without dead ends: 1012
[2020-10-11 14:55:49,837 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 14:55:49,842 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1012 states.
[2020-10-11 14:55:49,858 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012.
[2020-10-11 14:55:49,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1012 states.
[2020-10-11 14:55:49,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3028 transitions.
[2020-10-11 14:55:49,861 INFO  L78                 Accepts]: Start accepts. Automaton has 1012 states and 3028 transitions. Word has length 17
[2020-10-11 14:55:49,862 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:49,862 INFO  L481      AbstractCegarLoop]: Abstraction has 1012 states and 3028 transitions.
[2020-10-11 14:55:49,862 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:55:49,862 INFO  L276                IsEmpty]: Start isEmpty. Operand 1012 states and 3028 transitions.
[2020-10-11 14:55:49,864 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-11 14:55:49,864 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:49,865 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:55:49,865 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-11 14:55:49,865 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:49,865 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:49,865 INFO  L82        PathProgramCache]: Analyzing trace with hash 690303399, now seen corresponding path program 1 times
[2020-10-11 14:55:49,869 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:49,869 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179925548]
[2020-10-11 14:55:49,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:49,905 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:49,996 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 14:55:49,997 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179925548]
[2020-10-11 14:55:49,997 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:49,997 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 14:55:49,998 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765607522]
[2020-10-11 14:55:49,998 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 14:55:49,998 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:49,998 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 14:55:49,999 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:55:49,999 INFO  L87              Difference]: Start difference. First operand 1012 states and 3028 transitions. Second operand 7 states.
[2020-10-11 14:55:50,145 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:50,146 INFO  L93              Difference]: Finished difference Result 1429 states and 4231 transitions.
[2020-10-11 14:55:50,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:55:50,146 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 19
[2020-10-11 14:55:50,147 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:50,150 INFO  L225             Difference]: With dead ends: 1429
[2020-10-11 14:55:50,150 INFO  L226             Difference]: Without dead ends: 1151
[2020-10-11 14:55:50,150 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2020-10-11 14:55:50,154 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1151 states.
[2020-10-11 14:55:50,171 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1151.
[2020-10-11 14:55:50,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1151 states.
[2020-10-11 14:55:50,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 3409 transitions.
[2020-10-11 14:55:50,175 INFO  L78                 Accepts]: Start accepts. Automaton has 1151 states and 3409 transitions. Word has length 19
[2020-10-11 14:55:50,175 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:50,175 INFO  L481      AbstractCegarLoop]: Abstraction has 1151 states and 3409 transitions.
[2020-10-11 14:55:50,175 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 14:55:50,175 INFO  L276                IsEmpty]: Start isEmpty. Operand 1151 states and 3409 transitions.
[2020-10-11 14:55:50,178 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-11 14:55:50,178 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:50,178 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:55:50,178 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-11 14:55:50,178 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:50,179 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:50,179 INFO  L82        PathProgramCache]: Analyzing trace with hash 1923521869, now seen corresponding path program 2 times
[2020-10-11 14:55:50,179 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:50,179 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76047509]
[2020-10-11 14:55:50,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:50,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:50,267 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 14:55:50,267 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76047509]
[2020-10-11 14:55:50,268 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:50,268 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:55:50,268 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412767863]
[2020-10-11 14:55:50,269 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:55:50,269 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:50,269 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:55:50,269 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:55:50,269 INFO  L87              Difference]: Start difference. First operand 1151 states and 3409 transitions. Second operand 6 states.
[2020-10-11 14:55:50,381 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:50,382 INFO  L93              Difference]: Finished difference Result 1718 states and 4862 transitions.
[2020-10-11 14:55:50,382 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:55:50,382 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2020-10-11 14:55:50,383 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:50,387 INFO  L225             Difference]: With dead ends: 1718
[2020-10-11 14:55:50,387 INFO  L226             Difference]: Without dead ends: 1540
[2020-10-11 14:55:50,387 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-11 14:55:50,392 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1540 states.
[2020-10-11 14:55:50,415 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1245.
[2020-10-11 14:55:50,415 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1245 states.
[2020-10-11 14:55:50,418 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 3633 transitions.
[2020-10-11 14:55:50,419 INFO  L78                 Accepts]: Start accepts. Automaton has 1245 states and 3633 transitions. Word has length 19
[2020-10-11 14:55:50,419 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:50,419 INFO  L481      AbstractCegarLoop]: Abstraction has 1245 states and 3633 transitions.
[2020-10-11 14:55:50,419 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:55:50,419 INFO  L276                IsEmpty]: Start isEmpty. Operand 1245 states and 3633 transitions.
[2020-10-11 14:55:50,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-11 14:55:50,422 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:50,422 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:55:50,422 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-11 14:55:50,422 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:50,423 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:50,423 INFO  L82        PathProgramCache]: Analyzing trace with hash -217914650, now seen corresponding path program 1 times
[2020-10-11 14:55:50,423 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:50,423 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649068167]
[2020-10-11 14:55:50,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:50,447 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:50,499 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 14:55:50,499 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649068167]
[2020-10-11 14:55:50,500 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:50,500 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:55:50,500 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226342263]
[2020-10-11 14:55:50,500 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:55:50,500 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:50,500 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:55:50,501 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:55:50,501 INFO  L87              Difference]: Start difference. First operand 1245 states and 3633 transitions. Second operand 6 states.
[2020-10-11 14:55:50,561 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:50,562 INFO  L93              Difference]: Finished difference Result 1050 states and 2997 transitions.
[2020-10-11 14:55:50,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:55:50,563 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2020-10-11 14:55:50,563 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:50,565 INFO  L225             Difference]: With dead ends: 1050
[2020-10-11 14:55:50,565 INFO  L226             Difference]: Without dead ends: 907
[2020-10-11 14:55:50,566 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 14:55:50,569 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 907 states.
[2020-10-11 14:55:50,583 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907.
[2020-10-11 14:55:50,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 907 states.
[2020-10-11 14:55:50,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 2631 transitions.
[2020-10-11 14:55:50,586 INFO  L78                 Accepts]: Start accepts. Automaton has 907 states and 2631 transitions. Word has length 19
[2020-10-11 14:55:50,587 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:50,587 INFO  L481      AbstractCegarLoop]: Abstraction has 907 states and 2631 transitions.
[2020-10-11 14:55:50,587 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:55:50,587 INFO  L276                IsEmpty]: Start isEmpty. Operand 907 states and 2631 transitions.
[2020-10-11 14:55:50,589 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-11 14:55:50,590 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:50,590 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, 1]
[2020-10-11 14:55:50,590 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-11 14:55:50,590 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:50,590 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:50,590 INFO  L82        PathProgramCache]: Analyzing trace with hash -2147199299, now seen corresponding path program 1 times
[2020-10-11 14:55:50,591 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:50,591 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081163328]
[2020-10-11 14:55:50,591 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:50,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:50,677 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 14:55:50,678 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081163328]
[2020-10-11 14:55:50,678 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:50,678 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 14:55:50,678 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942362932]
[2020-10-11 14:55:50,678 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 14:55:50,679 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:50,679 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 14:55:50,679 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:55:50,679 INFO  L87              Difference]: Start difference. First operand 907 states and 2631 transitions. Second operand 7 states.
[2020-10-11 14:55:50,746 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:50,746 INFO  L93              Difference]: Finished difference Result 864 states and 2540 transitions.
[2020-10-11 14:55:50,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-11 14:55:50,747 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 22
[2020-10-11 14:55:50,747 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:50,749 INFO  L225             Difference]: With dead ends: 864
[2020-10-11 14:55:50,749 INFO  L226             Difference]: Without dead ends: 662
[2020-10-11 14:55:50,750 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-11 14:55:50,752 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2020-10-11 14:55:50,762 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 610.
[2020-10-11 14:55:50,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 610 states.
[2020-10-11 14:55:50,764 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1772 transitions.
[2020-10-11 14:55:50,764 INFO  L78                 Accepts]: Start accepts. Automaton has 610 states and 1772 transitions. Word has length 22
[2020-10-11 14:55:50,764 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:50,764 INFO  L481      AbstractCegarLoop]: Abstraction has 610 states and 1772 transitions.
[2020-10-11 14:55:50,764 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 14:55:50,765 INFO  L276                IsEmpty]: Start isEmpty. Operand 610 states and 1772 transitions.
[2020-10-11 14:55:50,766 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-11 14:55:50,766 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:50,767 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, 1, 1, 1, 1, 1]
[2020-10-11 14:55:50,767 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-11 14:55:50,767 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:50,767 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:50,767 INFO  L82        PathProgramCache]: Analyzing trace with hash -531363650, now seen corresponding path program 1 times
[2020-10-11 14:55:50,768 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:50,768 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009422253]
[2020-10-11 14:55:50,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:50,787 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:50,833 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 14:55:50,833 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009422253]
[2020-10-11 14:55:50,833 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:50,834 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:55:50,834 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634267562]
[2020-10-11 14:55:50,834 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:55:50,834 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:50,835 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:55:50,835 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:55:50,835 INFO  L87              Difference]: Start difference. First operand 610 states and 1772 transitions. Second operand 5 states.
[2020-10-11 14:55:50,869 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:50,870 INFO  L93              Difference]: Finished difference Result 787 states and 2250 transitions.
[2020-10-11 14:55:50,870 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:55:50,870 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 26
[2020-10-11 14:55:50,870 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:50,872 INFO  L225             Difference]: With dead ends: 787
[2020-10-11 14:55:50,872 INFO  L226             Difference]: Without dead ends: 332
[2020-10-11 14:55:50,872 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 14:55:50,873 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 332 states.
[2020-10-11 14:55:50,878 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332.
[2020-10-11 14:55:50,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 332 states.
[2020-10-11 14:55:50,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 868 transitions.
[2020-10-11 14:55:50,880 INFO  L78                 Accepts]: Start accepts. Automaton has 332 states and 868 transitions. Word has length 26
[2020-10-11 14:55:50,880 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:50,880 INFO  L481      AbstractCegarLoop]: Abstraction has 332 states and 868 transitions.
[2020-10-11 14:55:50,880 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:55:50,880 INFO  L276                IsEmpty]: Start isEmpty. Operand 332 states and 868 transitions.
[2020-10-11 14:55:50,881 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-11 14:55:50,881 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:50,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, 1, 1, 1, 1, 1]
[2020-10-11 14:55:50,882 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-11 14:55:50,882 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:50,882 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:50,882 INFO  L82        PathProgramCache]: Analyzing trace with hash -250477544, now seen corresponding path program 2 times
[2020-10-11 14:55:50,883 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:50,883 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399695634]
[2020-10-11 14:55:50,883 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:50,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:55:51,149 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 14:55:51,150 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399695634]
[2020-10-11 14:55:51,150 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:55:51,150 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-11 14:55:51,151 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329091198]
[2020-10-11 14:55:51,151 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-11 14:55:51,151 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:55:51,151 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-11 14:55:51,152 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2020-10-11 14:55:51,152 INFO  L87              Difference]: Start difference. First operand 332 states and 868 transitions. Second operand 9 states.
[2020-10-11 14:55:51,410 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:55:51,411 INFO  L93              Difference]: Finished difference Result 447 states and 1133 transitions.
[2020-10-11 14:55:51,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 14:55:51,411 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 26
[2020-10-11 14:55:51,412 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:55:51,412 INFO  L225             Difference]: With dead ends: 447
[2020-10-11 14:55:51,413 INFO  L226             Difference]: Without dead ends: 344
[2020-10-11 14:55:51,413 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156
[2020-10-11 14:55:51,417 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 344 states.
[2020-10-11 14:55:51,422 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 292.
[2020-10-11 14:55:51,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 292 states.
[2020-10-11 14:55:51,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 740 transitions.
[2020-10-11 14:55:51,424 INFO  L78                 Accepts]: Start accepts. Automaton has 292 states and 740 transitions. Word has length 26
[2020-10-11 14:55:51,425 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:55:51,425 INFO  L481      AbstractCegarLoop]: Abstraction has 292 states and 740 transitions.
[2020-10-11 14:55:51,425 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-11 14:55:51,425 INFO  L276                IsEmpty]: Start isEmpty. Operand 292 states and 740 transitions.
[2020-10-11 14:55:51,427 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-11 14:55:51,427 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:55:51,428 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, 1, 1, 1, 1, 1]
[2020-10-11 14:55:51,428 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-11 14:55:51,428 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:55:51,428 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:55:51,429 INFO  L82        PathProgramCache]: Analyzing trace with hash -694662336, now seen corresponding path program 3 times
[2020-10-11 14:55:51,429 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:55:51,430 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375036858]
[2020-10-11 14:55:51,430 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:55:51,486 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:55:51,486 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:55:51,601 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:55:51,602 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:55:51,647 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-11 14:55:51,647 INFO  L519         BasicCegarLoop]: Counterexample might be feasible
[2020-10-11 14:55:51,647 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-11 14:55:51,676 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 14:55:51,676 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,679 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 14:55:51,680 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,680 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 14:55:51,680 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,680 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 14:55:51,680 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,680 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 14:55:51,681 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,681 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 14:55:51,681 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,682 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 14:55:51,682 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,682 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 14:55:51,682 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,682 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 14:55:51,682 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,683 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 14:55:51,683 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,683 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 14:55:51,683 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,683 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 14:55:51,683 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,684 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 14:55:51,685 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,685 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 14:55:51,685 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,685 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 14:55:51,685 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,685 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 14:55:51,685 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,686 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 14:55:51,686 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,690 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 14:55:51,690 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,690 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 14:55:51,690 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,690 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 14:55:51,691 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,691 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 14:55:51,691 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,691 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 14:55:51,691 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,692 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 14:55:51,692 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,692 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 14:55:51,692 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,692 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 14:55:51,692 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,692 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 14:55:51,693 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,693 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 14:55:51,693 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,693 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 14:55:51,693 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,693 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 14:55:51,693 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:55:51,761 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:55:51 BasicIcfg
[2020-10-11 14:55:51,761 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-11 14:55:51,763 INFO  L168              Benchmark]: Toolchain (without parser) took 14095.24 ms. Allocated memory was 249.0 MB in the beginning and 576.2 MB in the end (delta: 327.2 MB). Free memory was 204.2 MB in the beginning and 489.2 MB in the end (delta: -285.1 MB). Peak memory consumption was 391.6 MB. Max. memory is 14.2 GB.
[2020-10-11 14:55:51,763 INFO  L168              Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-11 14:55:51,764 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 800.77 ms. Allocated memory was 249.0 MB in the beginning and 307.8 MB in the end (delta: 58.7 MB). Free memory was 204.2 MB in the beginning and 259.9 MB in the end (delta: -55.7 MB). Peak memory consumption was 33.5 MB. Max. memory is 14.2 GB.
[2020-10-11 14:55:51,765 INFO  L168              Benchmark]: Boogie Procedure Inliner took 112.96 ms. Allocated memory is still 307.8 MB. Free memory was 259.9 MB in the beginning and 257.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 14:55:51,765 INFO  L168              Benchmark]: Boogie Preprocessor took 74.20 ms. Allocated memory is still 307.8 MB. Free memory was 257.4 MB in the beginning and 254.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 14:55:51,766 INFO  L168              Benchmark]: RCFGBuilder took 1986.03 ms. Allocated memory was 307.8 MB in the beginning and 354.9 MB in the end (delta: 47.2 MB). Free memory was 254.9 MB in the beginning and 202.3 MB in the end (delta: 52.6 MB). Peak memory consumption was 101.4 MB. Max. memory is 14.2 GB.
[2020-10-11 14:55:51,767 INFO  L168              Benchmark]: TraceAbstraction took 11111.26 ms. Allocated memory was 354.9 MB in the beginning and 576.2 MB in the end (delta: 221.2 MB). Free memory was 202.3 MB in the beginning and 489.2 MB in the end (delta: -286.9 MB). Peak memory consumption was 283.8 MB. Max. memory is 14.2 GB.
[2020-10-11 14:55:51,770 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.21 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 800.77 ms. Allocated memory was 249.0 MB in the beginning and 307.8 MB in the end (delta: 58.7 MB). Free memory was 204.2 MB in the beginning and 259.9 MB in the end (delta: -55.7 MB). Peak memory consumption was 33.5 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 112.96 ms. Allocated memory is still 307.8 MB. Free memory was 259.9 MB in the beginning and 257.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 74.20 ms. Allocated memory is still 307.8 MB. Free memory was 257.4 MB in the beginning and 254.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 1986.03 ms. Allocated memory was 307.8 MB in the beginning and 354.9 MB in the end (delta: 47.2 MB). Free memory was 254.9 MB in the beginning and 202.3 MB in the end (delta: 52.6 MB). Peak memory consumption was 101.4 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 11111.26 ms. Allocated memory was 354.9 MB in the beginning and 576.2 MB in the end (delta: 221.2 MB). Free memory was 202.3 MB in the beginning and 489.2 MB in the end (delta: -286.9 MB). Peak memory consumption was 283.8 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1465 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 154 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.8s, 119 PlacesBefore, 45 PlacesAfterwards, 108 TransitionsBefore, 33 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 6555 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p1_EAX = 0;
[L703]               0  int __unbuffered_p3_EAX = 0;
[L705]               0  int a = 0;
[L706]               0  _Bool main$tmp_guard0;
[L707]               0  _Bool main$tmp_guard1;
[L709]               0  int x = 0;
[L711]               0  int y = 0;
[L713]               0  int z = 0;
[L714]               0  _Bool z$flush_delayed;
[L715]               0  int z$mem_tmp;
[L716]               0  _Bool z$r_buff0_thd0;
[L717]               0  _Bool z$r_buff0_thd1;
[L718]               0  _Bool z$r_buff0_thd2;
[L719]               0  _Bool z$r_buff0_thd3;
[L720]               0  _Bool z$r_buff0_thd4;
[L721]               0  _Bool z$r_buff1_thd0;
[L722]               0  _Bool z$r_buff1_thd1;
[L723]               0  _Bool z$r_buff1_thd2;
[L724]               0  _Bool z$r_buff1_thd3;
[L725]               0  _Bool z$r_buff1_thd4;
[L726]               0  _Bool z$read_delayed;
[L727]               0  int *z$read_delayed_var;
[L728]               0  int z$w_buff0;
[L729]               0  _Bool z$w_buff0_used;
[L730]               0  int z$w_buff1;
[L731]               0  _Bool z$w_buff1_used;
[L732]               0  _Bool weak$$choice0;
[L733]               0  _Bool weak$$choice2;
[L825]               0  pthread_t t1469;
[L826]  FCALL, FORK  0  pthread_create(&t1469, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L827]               0  pthread_t t1470;
[L828]  FCALL, FORK  0  pthread_create(&t1470, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L829]               0  pthread_t t1471;
[L830]  FCALL, FORK  0  pthread_create(&t1471, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L831]               0  pthread_t t1472;
[L832]  FCALL, FORK  0  pthread_create(&t1472, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L787]               4  z$w_buff1 = z$w_buff0
[L788]               4  z$w_buff0 = 2
[L789]               4  z$w_buff1_used = z$w_buff0_used
[L790]               4  z$w_buff0_used = (_Bool)1
[L7]    COND TRUE    4  !expression
[L7]                 4  __VERIFIER_error()
[L792]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L793]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L794]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L795]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L796]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L797]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L800]               4  __unbuffered_p3_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L737]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L740]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L745]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L747]               1  return 0;
[L752]               2  x = 2
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L755]               2  __unbuffered_p1_EAX = y
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L760]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L762]               2  return 0;
[L767]               3  y = 1
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L770]               3  z = 1
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L803]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L803]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L804]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L804]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L805]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L805]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L806]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L806]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L807]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L807]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L810]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L812]               4  return 0;
[L773]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L773]  EXPR         3  z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L773]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L773]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L774]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L774]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L775]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L775]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L776]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L776]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L777]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L777]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L780]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L782]               3  return 0;
[L834]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L3]    COND FALSE   0  !(!cond)
[L838]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L838]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L839]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L839]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L840]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L840]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L841]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L841]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L842]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L842]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L845]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L846]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L847]               0  z$flush_delayed = weak$$choice2
[L848]               0  z$mem_tmp = z
[L849]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L849]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L850]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L850]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)
[L850]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0
[L850]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)
[L850]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L850]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L851]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L851]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L852]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L852]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L853]  EXPR         0  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L853]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L854]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L854]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L855]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L855]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L855]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0
[L855]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L855]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L855]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L856]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0)
[L857]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L857]               0  z = z$flush_delayed ? z$mem_tmp : z
[L858]               0  z$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 557 SDtfs, 692 SDslu, 1360 SDs, 0 SdLazy, 481 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred 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.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 479 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 26535 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...