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


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:12:22,356 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:12:22,360 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:12:22,401 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:12:22,401 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:12:22,407 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:12:22,409 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:12:22,414 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:12:22,419 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:12:22,423 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:12:22,424 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:12:22,425 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:12:22,426 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:12:22,427 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:12:22,428 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:12:22,429 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:12:22,429 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:12:22,430 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:12:22,432 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:12:22,433 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:12:22,435 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:12:22,436 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:12:22,437 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:12:22,438 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:12:22,440 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:12:22,441 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:12:22,441 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:12:22,442 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:12:22,442 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:12:22,443 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:12:22,443 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:12:22,444 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:12:22,445 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:12:22,446 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:12:22,447 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:12:22,447 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:12:22,447 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:12:22,448 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:12:22,448 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:12:22,449 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:12:22,450 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:12:22,450 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-16 11:12:22,472 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 11:12:22,472 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:12:22,474 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:12:22,474 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 11:12:22,474 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 11:12:22,474 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:12:22,475 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 11:12:22,475 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 11:12:22,475 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 11:12:22,475 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 11:12:22,475 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:12:22,476 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:12:22,476 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:12:22,476 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 11:12:22,476 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 11:12:22,476 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 11:12:22,476 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:12:22,477 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:12:22,477 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 11:12:22,477 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 11:12:22,477 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 11:12:22,478 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:12:22,478 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:12:22,478 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:12:22,478 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:12:22,478 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 11:12:22,479 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:12:22,479 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:12:22,479 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-16 11:12:22,479 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:12:22,770 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:12:22,783 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:12:22,786 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:12:22,788 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 11:12:22,788 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 11:12:22,789 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i
[2020-10-16 11:12:22,853 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7f57cd4b5/db596af1d87e461892725bcd8aeb75b9/FLAGfcf3a46b9
[2020-10-16 11:12:23,375 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 11:12:23,376 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i
[2020-10-16 11:12:23,394 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7f57cd4b5/db596af1d87e461892725bcd8aeb75b9/FLAGfcf3a46b9
[2020-10-16 11:12:23,616 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7f57cd4b5/db596af1d87e461892725bcd8aeb75b9
[2020-10-16 11:12:23,627 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:12:23,629 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:12:23,630 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:12:23,630 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:12:23,634 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:12:23,635 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:12:23" (1/1) ...
[2020-10-16 11:12:23,638 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5288b682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:23, skipping insertion in model container
[2020-10-16 11:12:23,638 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:12:23" (1/1) ...
[2020-10-16 11:12:23,646 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 11:12:23,715 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:12:24,278 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:12:24,303 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 11:12:24,406 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:12:24,482 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 11:12:24,482 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:24 WrapperNode
[2020-10-16 11:12:24,483 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:12:24,483 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:12:24,484 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:12:24,484 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:12:24,492 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:24" (1/1) ...
[2020-10-16 11:12:24,511 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:24" (1/1) ...
[2020-10-16 11:12:24,552 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:12:24,553 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:12:24,553 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:12:24,553 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:12:24,564 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:24" (1/1) ...
[2020-10-16 11:12:24,567 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:24" (1/1) ...
[2020-10-16 11:12:24,576 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:24" (1/1) ...
[2020-10-16 11:12:24,576 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:24" (1/1) ...
[2020-10-16 11:12:24,591 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:24" (1/1) ...
[2020-10-16 11:12:24,607 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:24" (1/1) ...
[2020-10-16 11:12:24,612 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:24" (1/1) ...
[2020-10-16 11:12:24,625 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:12:24,625 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:12:24,625 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:12:24,625 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:12:24,628 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:24" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:12:24,694 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:12:24,694 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:12:24,694 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:12:24,694 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:12:24,694 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:12:24,695 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:12:24,695 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:12:24,695 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:12:24,695 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 11:12:24,695 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 11:12:24,696 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:12:24,696 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:12:24,696 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:12:24,700 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 11:12:26,710 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:12:26,711 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:12:26,713 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:12:26 BoogieIcfgContainer
[2020-10-16 11:12:26,713 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:12:26,715 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:12:26,715 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:12:26,719 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:12:26,719 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:12:23" (1/3) ...
[2020-10-16 11:12:26,720 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d10bece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:12:26, skipping insertion in model container
[2020-10-16 11:12:26,720 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:24" (2/3) ...
[2020-10-16 11:12:26,721 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d10bece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:12:26, skipping insertion in model container
[2020-10-16 11:12:26,721 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:12:26" (3/3) ...
[2020-10-16 11:12:26,723 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix042_power.opt.i
[2020-10-16 11:12:26,735 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:12:26,735 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:12:26,743 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:12:26,744 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:12:26,774 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,774 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,775 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,775 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,775 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,776 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,776 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,776 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,776 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,777 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,777 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,777 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,777 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,778 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,778 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,778 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,778 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,779 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,779 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,779 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,780 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,780 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,780 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,780 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,780 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,781 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,781 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,781 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,781 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,782 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,782 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,782 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,782 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,782 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,783 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,783 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,787 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,787 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,787 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,788 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,791 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,791 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,791 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,791 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,791 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,792 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,792 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,792 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,792 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,792 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,795 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,796 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,796 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,796 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,796 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,796 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,797 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,797 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,797 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,797 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,797 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,798 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:12:26,799 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:12:26,813 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 11:12:26,833 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:12:26,833 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 11:12:26,833 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:12:26,833 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:12:26,833 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:12:26,833 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 11:12:26,833 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:12:26,834 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:12:26,848 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:12:26,851 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 207 flow
[2020-10-16 11:12:26,854 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 207 flow
[2020-10-16 11:12:26,856 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow
[2020-10-16 11:12:26,907 INFO  L129       PetriNetUnfolder]: 2/93 cut-off events.
[2020-10-16 11:12:26,907 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:12:26,913 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. 
[2020-10-16 11:12:26,916 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1692
[2020-10-16 11:12:27,164 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:12:27,164 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:27,364 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:12:27,365 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:27,425 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:12:27,426 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:27,428 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:12:27,429 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:27,456 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:12:27,457 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:27,459 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:12:27,459 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:28,674 WARN  L193               SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 228 DAG size of output: 188
[2020-10-16 11:12:28,692 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term
[2020-10-16 11:12:28,693 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:28,694 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:12:28,694 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:29,571 WARN  L193               SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125
[2020-10-16 11:12:29,778 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:12:29,779 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:29,781 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:12:29,781 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:29,814 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:12:29,815 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:29,816 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:12:29,817 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:30,271 WARN  L193               SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:12:30,425 WARN  L193               SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 11:12:30,644 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:30,645 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:30,647 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:30,647 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:30,650 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:30,651 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:30,653 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:30,653 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:30,670 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:30,670 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:30,671 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:30,672 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:30,675 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:30,676 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:12:30,678 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:30,678 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:12:30,766 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:30,767 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:30,768 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:30,769 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:30,771 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:30,771 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:30,774 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:30,774 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:30,789 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:30,790 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:30,791 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:30,791 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:30,794 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:30,794 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:12:30,796 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:30,797 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:12:30,980 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:30,981 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:30,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:30,982 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:30,986 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:30,986 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:12:30,994 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:30,994 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:12:31,018 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:31,020 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:31,022 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:31,022 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:31,024 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:31,026 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:31,029 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:31,029 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:31,455 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:31,456 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:31,457 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:31,457 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:31,461 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:31,462 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:12:31,467 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:31,468 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:12:31,483 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:31,484 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:31,484 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:31,485 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:12:31,489 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:12:31,490 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:31,492 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:12:31,494 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:12:32,298 WARN  L193               SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91
[2020-10-16 11:12:32,421 WARN  L193               SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 89
[2020-10-16 11:12:32,431 INFO  L132        LiptonReduction]: Checked pairs total: 4657
[2020-10-16 11:12:32,432 INFO  L134        LiptonReduction]: Total number of compositions: 79
[2020-10-16 11:12:32,439 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow
[2020-10-16 11:12:32,496 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 890 states.
[2020-10-16 11:12:32,498 INFO  L276                IsEmpty]: Start isEmpty. Operand 890 states.
[2020-10-16 11:12:32,506 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-16 11:12:32,506 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:32,507 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:12:32,508 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:32,514 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:32,514 INFO  L82        PathProgramCache]: Analyzing trace with hash -964678123, now seen corresponding path program 1 times
[2020-10-16 11:12:32,525 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:32,526 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422219543]
[2020-10-16 11:12:32,526 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:32,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:12:32,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:12:32,796 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422219543]
[2020-10-16 11:12:32,797 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:12:32,798 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:12:32,798 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748246634]
[2020-10-16 11:12:32,804 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:12:32,804 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:12:32,819 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:12:32,820 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:12:32,821 INFO  L87              Difference]: Start difference. First operand 890 states. Second operand 3 states.
[2020-10-16 11:12:32,929 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:12:32,929 INFO  L93              Difference]: Finished difference Result 770 states and 2434 transitions.
[2020-10-16 11:12:32,930 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:12:32,932 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-16 11:12:32,932 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:12:32,963 INFO  L225             Difference]: With dead ends: 770
[2020-10-16 11:12:32,963 INFO  L226             Difference]: Without dead ends: 650
[2020-10-16 11:12:32,965 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:12:32,992 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 650 states.
[2020-10-16 11:12:33,057 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650.
[2020-10-16 11:12:33,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 650 states.
[2020-10-16 11:12:33,065 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions.
[2020-10-16 11:12:33,066 INFO  L78                 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7
[2020-10-16 11:12:33,067 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:12:33,067 INFO  L481      AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions.
[2020-10-16 11:12:33,068 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:12:33,068 INFO  L276                IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions.
[2020-10-16 11:12:33,070 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 11:12:33,070 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:33,070 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:12:33,071 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:12:33,071 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:33,071 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:33,071 INFO  L82        PathProgramCache]: Analyzing trace with hash -1097435749, now seen corresponding path program 1 times
[2020-10-16 11:12:33,072 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:33,072 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412292336]
[2020-10-16 11:12:33,072 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:33,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:12:33,204 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:12:33,204 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412292336]
[2020-10-16 11:12:33,205 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:12:33,205 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:12:33,205 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204717218]
[2020-10-16 11:12:33,207 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:12:33,207 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:12:33,207 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:12:33,208 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:12:33,208 INFO  L87              Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand 4 states.
[2020-10-16 11:12:33,289 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:12:33,290 INFO  L93              Difference]: Finished difference Result 730 states and 2192 transitions.
[2020-10-16 11:12:33,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:12:33,291 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-16 11:12:33,291 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:12:33,298 INFO  L225             Difference]: With dead ends: 730
[2020-10-16 11:12:33,298 INFO  L226             Difference]: Without dead ends: 610
[2020-10-16 11:12:33,299 INFO  L677         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-16 11:12:33,302 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 610 states.
[2020-10-16 11:12:33,319 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610.
[2020-10-16 11:12:33,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 610 states.
[2020-10-16 11:12:33,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1886 transitions.
[2020-10-16 11:12:33,323 INFO  L78                 Accepts]: Start accepts. Automaton has 610 states and 1886 transitions. Word has length 10
[2020-10-16 11:12:33,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:12:33,324 INFO  L481      AbstractCegarLoop]: Abstraction has 610 states and 1886 transitions.
[2020-10-16 11:12:33,324 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:12:33,324 INFO  L276                IsEmpty]: Start isEmpty. Operand 610 states and 1886 transitions.
[2020-10-16 11:12:33,326 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 11:12:33,326 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:33,326 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:12:33,327 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:12:33,327 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:33,327 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:33,327 INFO  L82        PathProgramCache]: Analyzing trace with hash 339258869, now seen corresponding path program 1 times
[2020-10-16 11:12:33,328 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:33,328 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489267769]
[2020-10-16 11:12:33,328 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:33,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:12:33,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:12:33,515 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489267769]
[2020-10-16 11:12:33,516 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:12:33,516 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:12:33,518 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473738596]
[2020-10-16 11:12:33,518 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:12:33,518 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:12:33,519 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:12:33,519 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:12:33,519 INFO  L87              Difference]: Start difference. First operand 610 states and 1886 transitions. Second operand 5 states.
[2020-10-16 11:12:33,584 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:12:33,585 INFO  L93              Difference]: Finished difference Result 670 states and 1999 transitions.
[2020-10-16 11:12:33,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:12:33,586 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 11
[2020-10-16 11:12:33,586 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:12:33,590 INFO  L225             Difference]: With dead ends: 670
[2020-10-16 11:12:33,591 INFO  L226             Difference]: Without dead ends: 570
[2020-10-16 11:12:33,591 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:12:33,594 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 570 states.
[2020-10-16 11:12:33,606 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570.
[2020-10-16 11:12:33,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 570 states.
[2020-10-16 11:12:33,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1744 transitions.
[2020-10-16 11:12:33,610 INFO  L78                 Accepts]: Start accepts. Automaton has 570 states and 1744 transitions. Word has length 11
[2020-10-16 11:12:33,610 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:12:33,610 INFO  L481      AbstractCegarLoop]: Abstraction has 570 states and 1744 transitions.
[2020-10-16 11:12:33,610 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:12:33,610 INFO  L276                IsEmpty]: Start isEmpty. Operand 570 states and 1744 transitions.
[2020-10-16 11:12:33,612 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:12:33,612 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:33,613 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:12:33,613 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:12:33,613 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:33,613 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:33,613 INFO  L82        PathProgramCache]: Analyzing trace with hash 1927062368, now seen corresponding path program 1 times
[2020-10-16 11:12:33,614 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:33,614 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716671066]
[2020-10-16 11:12:33,614 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:33,674 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:12:33,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:12:33,771 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716671066]
[2020-10-16 11:12:33,771 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:12:33,771 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:12:33,772 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853784491]
[2020-10-16 11:12:33,772 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:12:33,772 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:12:33,772 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:12:33,773 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:12:33,773 INFO  L87              Difference]: Start difference. First operand 570 states and 1744 transitions. Second operand 6 states.
[2020-10-16 11:12:33,918 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:12:33,918 INFO  L93              Difference]: Finished difference Result 618 states and 1824 transitions.
[2020-10-16 11:12:33,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:12:33,919 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 12
[2020-10-16 11:12:33,919 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:12:33,925 INFO  L225             Difference]: With dead ends: 618
[2020-10-16 11:12:33,925 INFO  L226             Difference]: Without dead ends: 538
[2020-10-16 11:12:33,926 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:12:33,929 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 538 states.
[2020-10-16 11:12:33,943 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538.
[2020-10-16 11:12:33,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 538 states.
[2020-10-16 11:12:33,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1624 transitions.
[2020-10-16 11:12:33,949 INFO  L78                 Accepts]: Start accepts. Automaton has 538 states and 1624 transitions. Word has length 12
[2020-10-16 11:12:33,949 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:12:33,949 INFO  L481      AbstractCegarLoop]: Abstraction has 538 states and 1624 transitions.
[2020-10-16 11:12:33,950 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:12:33,950 INFO  L276                IsEmpty]: Start isEmpty. Operand 538 states and 1624 transitions.
[2020-10-16 11:12:33,951 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 11:12:33,951 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:33,952 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:12:33,952 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:12:33,952 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:33,953 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:33,953 INFO  L82        PathProgramCache]: Analyzing trace with hash -1896370169, now seen corresponding path program 1 times
[2020-10-16 11:12:33,953 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:33,953 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713484275]
[2020-10-16 11:12:33,954 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:33,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:12:34,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:12:34,125 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713484275]
[2020-10-16 11:12:34,125 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:12:34,126 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:12:34,126 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954763481]
[2020-10-16 11:12:34,126 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:12:34,127 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:12:34,127 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:12:34,128 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:12:34,129 INFO  L87              Difference]: Start difference. First operand 538 states and 1624 transitions. Second operand 7 states.
[2020-10-16 11:12:34,299 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:12:34,299 INFO  L93              Difference]: Finished difference Result 658 states and 1938 transitions.
[2020-10-16 11:12:34,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 11:12:34,300 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 14
[2020-10-16 11:12:34,300 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:12:34,305 INFO  L225             Difference]: With dead ends: 658
[2020-10-16 11:12:34,305 INFO  L226             Difference]: Without dead ends: 594
[2020-10-16 11:12:34,308 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90
[2020-10-16 11:12:34,310 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 594 states.
[2020-10-16 11:12:34,330 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594.
[2020-10-16 11:12:34,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 594 states.
[2020-10-16 11:12:34,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 1774 transitions.
[2020-10-16 11:12:34,337 INFO  L78                 Accepts]: Start accepts. Automaton has 594 states and 1774 transitions. Word has length 14
[2020-10-16 11:12:34,337 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:12:34,337 INFO  L481      AbstractCegarLoop]: Abstraction has 594 states and 1774 transitions.
[2020-10-16 11:12:34,337 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:12:34,337 INFO  L276                IsEmpty]: Start isEmpty. Operand 594 states and 1774 transitions.
[2020-10-16 11:12:34,339 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 11:12:34,339 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:34,339 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:12:34,339 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:12:34,339 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:34,339 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:34,340 INFO  L82        PathProgramCache]: Analyzing trace with hash 775167457, now seen corresponding path program 1 times
[2020-10-16 11:12:34,340 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:34,340 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370318866]
[2020-10-16 11:12:34,340 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:34,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:12:34,463 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:12:34,464 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370318866]
[2020-10-16 11:12:34,464 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:12:34,464 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:12:34,464 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630216785]
[2020-10-16 11:12:34,465 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:12:34,466 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:12:34,466 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:12:34,466 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:12:34,466 INFO  L87              Difference]: Start difference. First operand 594 states and 1774 transitions. Second operand 4 states.
[2020-10-16 11:12:34,504 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:12:34,504 INFO  L93              Difference]: Finished difference Result 564 states and 1487 transitions.
[2020-10-16 11:12:34,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:12:34,506 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-16 11:12:34,507 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:12:34,509 INFO  L225             Difference]: With dead ends: 564
[2020-10-16 11:12:34,509 INFO  L226             Difference]: Without dead ends: 420
[2020-10-16 11:12:34,510 INFO  L677         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-16 11:12:34,512 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 420 states.
[2020-10-16 11:12:34,521 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420.
[2020-10-16 11:12:34,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 420 states.
[2020-10-16 11:12:34,523 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1078 transitions.
[2020-10-16 11:12:34,523 INFO  L78                 Accepts]: Start accepts. Automaton has 420 states and 1078 transitions. Word has length 14
[2020-10-16 11:12:34,523 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:12:34,523 INFO  L481      AbstractCegarLoop]: Abstraction has 420 states and 1078 transitions.
[2020-10-16 11:12:34,523 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:12:34,524 INFO  L276                IsEmpty]: Start isEmpty. Operand 420 states and 1078 transitions.
[2020-10-16 11:12:34,525 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:12:34,525 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:34,525 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:12:34,525 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:12:34,526 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:34,526 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:34,526 INFO  L82        PathProgramCache]: Analyzing trace with hash -451538249, now seen corresponding path program 1 times
[2020-10-16 11:12:34,526 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:34,526 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142567969]
[2020-10-16 11:12:34,527 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:34,581 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:12:34,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:12:34,632 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142567969]
[2020-10-16 11:12:34,633 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:12:34,633 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:12:34,633 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133930590]
[2020-10-16 11:12:34,634 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:12:34,634 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:12:34,634 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:12:34,634 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:12:34,635 INFO  L87              Difference]: Start difference. First operand 420 states and 1078 transitions. Second operand 5 states.
[2020-10-16 11:12:34,676 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:12:34,676 INFO  L93              Difference]: Finished difference Result 323 states and 754 transitions.
[2020-10-16 11:12:34,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:12:34,677 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-16 11:12:34,677 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:12:34,679 INFO  L225             Difference]: With dead ends: 323
[2020-10-16 11:12:34,679 INFO  L226             Difference]: Without dead ends: 248
[2020-10-16 11:12:34,679 INFO  L677         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-16 11:12:34,680 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 248 states.
[2020-10-16 11:12:34,685 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248.
[2020-10-16 11:12:34,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 248 states.
[2020-10-16 11:12:34,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 562 transitions.
[2020-10-16 11:12:34,687 INFO  L78                 Accepts]: Start accepts. Automaton has 248 states and 562 transitions. Word has length 15
[2020-10-16 11:12:34,687 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:12:34,687 INFO  L481      AbstractCegarLoop]: Abstraction has 248 states and 562 transitions.
[2020-10-16 11:12:34,688 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:12:34,688 INFO  L276                IsEmpty]: Start isEmpty. Operand 248 states and 562 transitions.
[2020-10-16 11:12:34,688 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 11:12:34,689 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:34,689 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:12:34,689 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:12:34,689 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:34,689 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:34,689 INFO  L82        PathProgramCache]: Analyzing trace with hash -38316131, now seen corresponding path program 1 times
[2020-10-16 11:12:34,690 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:34,690 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917350792]
[2020-10-16 11:12:34,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:34,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:12:34,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:12:34,767 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917350792]
[2020-10-16 11:12:34,767 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:12:34,767 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:12:34,767 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396252431]
[2020-10-16 11:12:34,768 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:12:34,768 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:12:34,768 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:12:34,768 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:12:34,769 INFO  L87              Difference]: Start difference. First operand 248 states and 562 transitions. Second operand 6 states.
[2020-10-16 11:12:34,841 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:12:34,842 INFO  L93              Difference]: Finished difference Result 334 states and 733 transitions.
[2020-10-16 11:12:34,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:12:34,843 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2020-10-16 11:12:34,843 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:12:34,845 INFO  L225             Difference]: With dead ends: 334
[2020-10-16 11:12:34,845 INFO  L226             Difference]: Without dead ends: 218
[2020-10-16 11:12:34,846 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:12:34,847 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2020-10-16 11:12:34,852 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212.
[2020-10-16 11:12:34,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 212 states.
[2020-10-16 11:12:34,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 449 transitions.
[2020-10-16 11:12:34,854 INFO  L78                 Accepts]: Start accepts. Automaton has 212 states and 449 transitions. Word has length 18
[2020-10-16 11:12:34,854 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:12:34,855 INFO  L481      AbstractCegarLoop]: Abstraction has 212 states and 449 transitions.
[2020-10-16 11:12:34,855 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:12:34,855 INFO  L276                IsEmpty]: Start isEmpty. Operand 212 states and 449 transitions.
[2020-10-16 11:12:34,856 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 11:12:34,856 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:34,856 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:12:34,856 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:12:34,856 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:34,856 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:34,857 INFO  L82        PathProgramCache]: Analyzing trace with hash -669464805, now seen corresponding path program 2 times
[2020-10-16 11:12:34,857 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:34,857 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20264773]
[2020-10-16 11:12:34,857 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:34,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:12:34,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:12:34,929 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20264773]
[2020-10-16 11:12:34,929 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:12:34,929 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:12:34,929 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860754452]
[2020-10-16 11:12:34,930 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:12:34,930 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:12:34,931 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:12:34,931 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:12:34,931 INFO  L87              Difference]: Start difference. First operand 212 states and 449 transitions. Second operand 6 states.
[2020-10-16 11:12:34,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:12:34,992 INFO  L93              Difference]: Finished difference Result 181 states and 386 transitions.
[2020-10-16 11:12:34,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 11:12:34,992 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2020-10-16 11:12:34,993 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:12:34,994 INFO  L225             Difference]: With dead ends: 181
[2020-10-16 11:12:34,994 INFO  L226             Difference]: Without dead ends: 105
[2020-10-16 11:12:34,994 INFO  L677         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-16 11:12:34,995 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 105 states.
[2020-10-16 11:12:34,997 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93.
[2020-10-16 11:12:34,997 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2020-10-16 11:12:34,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 186 transitions.
[2020-10-16 11:12:34,998 INFO  L78                 Accepts]: Start accepts. Automaton has 93 states and 186 transitions. Word has length 18
[2020-10-16 11:12:34,999 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:12:34,999 INFO  L481      AbstractCegarLoop]: Abstraction has 93 states and 186 transitions.
[2020-10-16 11:12:34,999 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:12:34,999 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 186 transitions.
[2020-10-16 11:12:35,000 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 11:12:35,000 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:35,000 INFO  L422         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-16 11:12:35,000 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:12:35,001 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:35,001 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:35,001 INFO  L82        PathProgramCache]: Analyzing trace with hash 993953900, now seen corresponding path program 1 times
[2020-10-16 11:12:35,002 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:35,002 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880073663]
[2020-10-16 11:12:35,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:35,026 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:12:35,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:12:35,178 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880073663]
[2020-10-16 11:12:35,179 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:12:35,179 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-16 11:12:35,179 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392531276]
[2020-10-16 11:12:35,179 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-16 11:12:35,180 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:12:35,180 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-16 11:12:35,180 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2020-10-16 11:12:35,180 INFO  L87              Difference]: Start difference. First operand 93 states and 186 transitions. Second operand 10 states.
[2020-10-16 11:12:35,398 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:12:35,398 INFO  L93              Difference]: Finished difference Result 148 states and 277 transitions.
[2020-10-16 11:12:35,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-10-16 11:12:35,399 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 22
[2020-10-16 11:12:35,399 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:12:35,400 INFO  L225             Difference]: With dead ends: 148
[2020-10-16 11:12:35,400 INFO  L226             Difference]: Without dead ends: 72
[2020-10-16 11:12:35,400 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240
[2020-10-16 11:12:35,401 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2020-10-16 11:12:35,402 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 57.
[2020-10-16 11:12:35,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 57 states.
[2020-10-16 11:12:35,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 98 transitions.
[2020-10-16 11:12:35,403 INFO  L78                 Accepts]: Start accepts. Automaton has 57 states and 98 transitions. Word has length 22
[2020-10-16 11:12:35,403 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:12:35,403 INFO  L481      AbstractCegarLoop]: Abstraction has 57 states and 98 transitions.
[2020-10-16 11:12:35,404 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-16 11:12:35,404 INFO  L276                IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions.
[2020-10-16 11:12:35,404 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 11:12:35,404 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:35,404 INFO  L422         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-16 11:12:35,405 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 11:12:35,405 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:35,405 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:35,405 INFO  L82        PathProgramCache]: Analyzing trace with hash 1536670826, now seen corresponding path program 2 times
[2020-10-16 11:12:35,406 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:35,406 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335446127]
[2020-10-16 11:12:35,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:35,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:12:35,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:12:35,471 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335446127]
[2020-10-16 11:12:35,471 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:12:35,472 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:12:35,472 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477008896]
[2020-10-16 11:12:35,472 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:12:35,472 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:12:35,473 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:12:35,473 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:12:35,473 INFO  L87              Difference]: Start difference. First operand 57 states and 98 transitions. Second operand 5 states.
[2020-10-16 11:12:35,502 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:12:35,502 INFO  L93              Difference]: Finished difference Result 68 states and 111 transitions.
[2020-10-16 11:12:35,502 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:12:35,503 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 22
[2020-10-16 11:12:35,503 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:12:35,503 INFO  L225             Difference]: With dead ends: 68
[2020-10-16 11:12:35,503 INFO  L226             Difference]: Without dead ends: 49
[2020-10-16 11:12:35,504 INFO  L677         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-16 11:12:35,504 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2020-10-16 11:12:35,505 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49.
[2020-10-16 11:12:35,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2020-10-16 11:12:35,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions.
[2020-10-16 11:12:35,506 INFO  L78                 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 22
[2020-10-16 11:12:35,506 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:12:35,506 INFO  L481      AbstractCegarLoop]: Abstraction has 49 states and 82 transitions.
[2020-10-16 11:12:35,507 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:12:35,507 INFO  L276                IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions.
[2020-10-16 11:12:35,507 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 11:12:35,507 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:35,507 INFO  L422         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-16 11:12:35,507 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 11:12:35,508 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:35,508 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:35,508 INFO  L82        PathProgramCache]: Analyzing trace with hash 231945706, now seen corresponding path program 3 times
[2020-10-16 11:12:35,508 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:35,508 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684647268]
[2020-10-16 11:12:35,509 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:35,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:12:35,754 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:12:35,755 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684647268]
[2020-10-16 11:12:35,755 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:12:35,755 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-16 11:12:35,755 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709025664]
[2020-10-16 11:12:35,756 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 11:12:35,756 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:12:35,756 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 11:12:35,756 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:12:35,756 INFO  L87              Difference]: Start difference. First operand 49 states and 82 transitions. Second operand 9 states.
[2020-10-16 11:12:35,914 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:12:35,915 INFO  L93              Difference]: Finished difference Result 76 states and 121 transitions.
[2020-10-16 11:12:35,915 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 11:12:35,915 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 22
[2020-10-16 11:12:35,915 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:12:35,916 INFO  L225             Difference]: With dead ends: 76
[2020-10-16 11:12:35,916 INFO  L226             Difference]: Without dead ends: 49
[2020-10-16 11:12:35,916 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2020-10-16 11:12:35,916 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2020-10-16 11:12:35,917 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37.
[2020-10-16 11:12:35,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2020-10-16 11:12:35,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions.
[2020-10-16 11:12:35,918 INFO  L78                 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 22
[2020-10-16 11:12:35,918 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:12:35,918 INFO  L481      AbstractCegarLoop]: Abstraction has 37 states and 54 transitions.
[2020-10-16 11:12:35,918 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 11:12:35,918 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions.
[2020-10-16 11:12:35,919 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 11:12:35,919 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:12:35,919 INFO  L422         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-16 11:12:35,919 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 11:12:35,919 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:12:35,920 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:12:35,920 INFO  L82        PathProgramCache]: Analyzing trace with hash 1651388136, now seen corresponding path program 4 times
[2020-10-16 11:12:35,920 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:12:35,920 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852769611]
[2020-10-16 11:12:35,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:12:35,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:12:35,952 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:12:35,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:12:35,984 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:12:36,021 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:12:36,022 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:12:36,022 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 11:12:36,042 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,042 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,044 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,044 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,045 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,045 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,045 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,045 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,045 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,046 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,046 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,046 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,046 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,046 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,047 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,047 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,047 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,047 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,047 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,048 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,048 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,048 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,048 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,048 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,049 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,049 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,050 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,050 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,050 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,050 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,050 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,050 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,051 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,051 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,051 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,051 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,052 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,052 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,052 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,052 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,052 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,052 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,053 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,053 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,053 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,053 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,053 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,054 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,054 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,054 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,054 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,054 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,054 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,055 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,055 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,055 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,055 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:12:36,055 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:12:36,120 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:12:36 BasicIcfg
[2020-10-16 11:12:36,120 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:12:36,122 INFO  L168              Benchmark]: Toolchain (without parser) took 12493.71 ms. Allocated memory was 139.5 MB in the beginning and 376.4 MB in the end (delta: 237.0 MB). Free memory was 101.3 MB in the beginning and 180.9 MB in the end (delta: -79.6 MB). Peak memory consumption was 157.4 MB. Max. memory is 7.1 GB.
[2020-10-16 11:12:36,123 INFO  L168              Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-10-16 11:12:36,124 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 853.20 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 159.9 MB in the end (delta: -59.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB.
[2020-10-16 11:12:36,125 INFO  L168              Benchmark]: Boogie Procedure Inliner took 69.15 ms. Allocated memory is still 203.9 MB. Free memory was 159.2 MB in the beginning and 156.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
[2020-10-16 11:12:36,125 INFO  L168              Benchmark]: Boogie Preprocessor took 71.85 ms. Allocated memory is still 203.9 MB. Free memory was 156.5 MB in the beginning and 154.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB.
[2020-10-16 11:12:36,126 INFO  L168              Benchmark]: RCFGBuilder took 2088.34 ms. Allocated memory was 203.9 MB in the beginning and 249.0 MB in the end (delta: 45.1 MB). Free memory was 153.7 MB in the beginning and 200.4 MB in the end (delta: -46.7 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:12:36,127 INFO  L168              Benchmark]: TraceAbstraction took 9405.47 ms. Allocated memory was 249.0 MB in the beginning and 376.4 MB in the end (delta: 127.4 MB). Free memory was 200.4 MB in the beginning and 180.9 MB in the end (delta: 19.5 MB). Peak memory consumption was 146.9 MB. Max. memory is 7.1 GB.
[2020-10-16 11:12:36,132 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.24 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 853.20 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 159.9 MB in the end (delta: -59.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 69.15 ms. Allocated memory is still 203.9 MB. Free memory was 159.2 MB in the beginning and 156.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 71.85 ms. Allocated memory is still 203.9 MB. Free memory was 156.5 MB in the beginning and 154.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2088.34 ms. Allocated memory was 203.9 MB in the beginning and 249.0 MB in the end (delta: 45.1 MB). Free memory was 153.7 MB in the beginning and 200.4 MB in the end (delta: -46.7 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 9405.47 ms. Allocated memory was 249.0 MB in the beginning and 376.4 MB in the end (delta: 127.4 MB). Free memory was 200.4 MB in the beginning and 180.9 MB in the end (delta: 19.5 MB). Peak memory consumption was 146.9 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1106 VarBasedMoverChecksPositive, 62 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 147 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.5s, 104 PlacesBefore, 37 PlacesAfterwards, 96 TransitionsBefore, 28 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 79 TotalNumberOfCompositions, 4657 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p0_EAX = 0;
[L702]               0  int __unbuffered_p2_EAX = 0;
[L704]               0  int __unbuffered_p2_EBX = 0;
[L706]               0  int a = 0;
[L707]               0  _Bool main$tmp_guard0;
[L708]               0  _Bool main$tmp_guard1;
[L710]               0  int x = 0;
[L712]               0  int y = 0;
[L713]               0  _Bool y$flush_delayed;
[L714]               0  int y$mem_tmp;
[L715]               0  _Bool y$r_buff0_thd0;
[L716]               0  _Bool y$r_buff0_thd1;
[L717]               0  _Bool y$r_buff0_thd2;
[L718]               0  _Bool y$r_buff0_thd3;
[L719]               0  _Bool y$r_buff1_thd0;
[L720]               0  _Bool y$r_buff1_thd1;
[L721]               0  _Bool y$r_buff1_thd2;
[L722]               0  _Bool y$r_buff1_thd3;
[L723]               0  _Bool y$read_delayed;
[L724]               0  int *y$read_delayed_var;
[L725]               0  int y$w_buff0;
[L726]               0  _Bool y$w_buff0_used;
[L727]               0  int y$w_buff1;
[L728]               0  _Bool y$w_buff1_used;
[L730]               0  int z = 0;
[L731]               0  _Bool weak$$choice0;
[L732]               0  _Bool weak$$choice2;
[L814]               0  pthread_t t1108;
[L815]  FCALL, FORK  0  pthread_create(&t1108, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L816]               0  pthread_t t1109;
[L817]  FCALL, FORK  0  pthread_create(&t1109, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L818]               0  pthread_t t1110;
[L819]  FCALL, FORK  0  pthread_create(&t1110, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L771]               3  y$w_buff1 = y$w_buff0
[L772]               3  y$w_buff0 = 2
[L773]               3  y$w_buff1_used = y$w_buff0_used
[L774]               3  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    3  !expression
[L7]                 3  __VERIFIER_error()
[L776]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L777]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L778]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L779]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L780]               3  y$r_buff0_thd3 = (_Bool)1
[L783]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L786]               3  __unbuffered_p2_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L789]               3  __unbuffered_p2_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L736]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L739]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L751]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L744]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L746]               1  return 0;
[L754]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L792]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L792]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L793]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L793]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L794]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L794]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L795]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L795]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L796]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L796]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L799]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L801]               3  return 0;
[L757]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L757]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L758]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L758]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L759]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L759]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L760]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L760]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L761]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L761]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L764]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L766]               2  return 0;
[L821]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
[L825]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L825]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L825]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L825]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L826]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L826]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L827]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L827]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L828]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L828]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L829]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L829]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L832]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L833]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L834]               0  y$flush_delayed = weak$$choice2
[L835]               0  y$mem_tmp = y
[L836]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L836]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L837]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L837]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L838]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L838]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L839]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L839]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L839]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L839]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L840]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L840]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L841]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L841]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L841]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L841]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L842]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L842]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L842]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L842]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L843]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L844]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L844]               0  y = y$flush_delayed ? y$mem_tmp : y
[L845]               0  y$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 353 SDtfs, 450 SDslu, 907 SDs, 0 SdLazy, 429 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=890occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 21252 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...