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


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


This is Ultimate 0.1.25-1d1d2b5
[2020-10-21 22:01:25,014 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-21 22:01:25,018 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-21 22:01:25,062 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-21 22:01:25,062 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-21 22:01:25,071 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-21 22:01:25,074 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-21 22:01:25,078 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-21 22:01:25,081 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-21 22:01:25,084 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-21 22:01:25,085 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-21 22:01:25,086 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-21 22:01:25,086 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-21 22:01:25,089 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-21 22:01:25,092 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-21 22:01:25,093 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-21 22:01:25,095 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-21 22:01:25,096 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-21 22:01:25,097 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-21 22:01:25,106 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-21 22:01:25,108 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-21 22:01:25,110 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-21 22:01:25,111 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-21 22:01:25,111 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-21 22:01:25,124 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-21 22:01:25,125 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-21 22:01:25,128 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-21 22:01:25,129 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-21 22:01:25,129 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-21 22:01:25,130 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-21 22:01:25,130 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-21 22:01:25,134 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-21 22:01:25,135 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-21 22:01:25,136 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-21 22:01:25,137 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-21 22:01:25,137 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-21 22:01:25,141 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-21 22:01:25,141 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-21 22:01:25,141 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-21 22:01:25,144 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-21 22:01:25,145 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-21 22:01:25,146 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-21 22:01:25,176 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-21 22:01:25,176 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-21 22:01:25,177 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-21 22:01:25,177 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-21 22:01:25,178 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-21 22:01:25,178 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-21 22:01:25,178 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-21 22:01:25,178 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-21 22:01:25,179 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-21 22:01:25,179 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-21 22:01:25,179 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-21 22:01:25,179 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-21 22:01:25,179 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-21 22:01:25,179 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-21 22:01:25,180 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-21 22:01:25,180 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-21 22:01:25,180 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-21 22:01:25,180 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-21 22:01:25,180 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-21 22:01:25,181 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-21 22:01:25,181 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-21 22:01:25,181 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-21 22:01:25,181 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-21 22:01:25,181 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-21 22:01:25,182 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-21 22:01:25,182 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-21 22:01:25,182 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-21 22:01:25,182 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-21 22:01:25,182 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-21 22:01:25,182 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-21 22:01:25,501 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-21 22:01:25,513 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-21 22:01:25,518 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-21 22:01:25,519 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-21 22:01:25,520 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-21 22:01:25,520 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i
[2020-10-21 22:01:25,593 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b909fa0/bb81461bf56949ebb34fec7af0e7271d/FLAG5a0f7c2b9
[2020-10-21 22:01:26,107 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-21 22:01:26,107 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i
[2020-10-21 22:01:26,123 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b909fa0/bb81461bf56949ebb34fec7af0e7271d/FLAG5a0f7c2b9
[2020-10-21 22:01:26,450 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b909fa0/bb81461bf56949ebb34fec7af0e7271d
[2020-10-21 22:01:26,458 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-21 22:01:26,464 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-21 22:01:26,465 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-21 22:01:26,465 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-21 22:01:26,469 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-21 22:01:26,470 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:01:26" (1/1) ...
[2020-10-21 22:01:26,472 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583129f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:26, skipping insertion in model container
[2020-10-21 22:01:26,473 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:01:26" (1/1) ...
[2020-10-21 22:01:26,483 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-21 22:01:26,551 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-21 22:01:27,177 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-21 22:01:27,191 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-21 22:01:27,299 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-21 22:01:27,385 INFO  L208         MainTranslator]: Completed translation
[2020-10-21 22:01:27,385 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:27 WrapperNode
[2020-10-21 22:01:27,386 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-21 22:01:27,386 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-21 22:01:27,387 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-21 22:01:27,387 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-21 22:01:27,396 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:27" (1/1) ...
[2020-10-21 22:01:27,416 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:27" (1/1) ...
[2020-10-21 22:01:27,448 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-21 22:01:27,448 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-21 22:01:27,449 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-21 22:01:27,449 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-21 22:01:27,459 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:27" (1/1) ...
[2020-10-21 22:01:27,459 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:27" (1/1) ...
[2020-10-21 22:01:27,464 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:27" (1/1) ...
[2020-10-21 22:01:27,465 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:27" (1/1) ...
[2020-10-21 22:01:27,487 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:27" (1/1) ...
[2020-10-21 22:01:27,499 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:27" (1/1) ...
[2020-10-21 22:01:27,503 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:27" (1/1) ...
[2020-10-21 22:01:27,508 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-21 22:01:27,518 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-21 22:01:27,518 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-21 22:01:27,518 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-21 22:01:27,519 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:27" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-21 22:01:27,599 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-21 22:01:27,599 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-21 22:01:27,599 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-21 22:01:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-21 22:01:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-21 22:01:27,600 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-21 22:01:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-21 22:01:27,600 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-21 22:01:27,601 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-21 22:01:27,601 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-21 22:01:27,601 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-10-21 22:01:27,601 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-21 22:01:27,601 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-21 22:01:27,601 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-21 22:01:27,603 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-21 22:01:29,667 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-21 22:01:29,668 INFO  L298             CfgBuilder]: Removed 14 assume(true) statements.
[2020-10-21 22:01:29,671 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:01:29 BoogieIcfgContainer
[2020-10-21 22:01:29,671 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-21 22:01:29,672 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-21 22:01:29,672 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-21 22:01:29,676 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-21 22:01:29,676 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:01:26" (1/3) ...
[2020-10-21 22:01:29,677 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79331271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:01:29, skipping insertion in model container
[2020-10-21 22:01:29,677 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:27" (2/3) ...
[2020-10-21 22:01:29,677 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79331271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:01:29, skipping insertion in model container
[2020-10-21 22:01:29,678 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:01:29" (3/3) ...
[2020-10-21 22:01:29,679 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe013_power.opt.i
[2020-10-21 22:01:29,691 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-21 22:01:29,691 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-21 22:01:29,699 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-21 22:01:29,700 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-21 22:01:29,731 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,732 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,732 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,732 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,733 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,733 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,733 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,733 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,733 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,733 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,734 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,734 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,734 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,734 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,734 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,734 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,735 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,735 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,735 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,735 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,735 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,735 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,737 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,737 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,737 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,737 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,737 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,737 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,738 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,738 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,738 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,738 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,738 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,738 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,739 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,740 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,741 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,741 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,742 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,742 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,742 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,742 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,742 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,743 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,743 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,743 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,743 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,743 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,744 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,744 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,744 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,744 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,744 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,745 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,745 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,745 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,745 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,745 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,746 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,746 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,746 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,747 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,747 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,747 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,747 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,747 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,748 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,748 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,748 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,748 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,748 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,749 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,749 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,753 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,754 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,754 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,754 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,754 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,754 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,755 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,755 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,755 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,755 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,760 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,760 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,760 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,760 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,761 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,761 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,761 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,761 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,761 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,762 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,762 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,762 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,762 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,762 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,763 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,763 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,763 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,763 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,763 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,764 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,764 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,764 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,764 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,764 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,765 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,765 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,765 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,772 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,772 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,772 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,772 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,773 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,773 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,773 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,773 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,773 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,774 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,774 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,774 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,774 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,774 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:29,776 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-21 22:01:29,790 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-21 22:01:29,811 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-21 22:01:29,811 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-21 22:01:29,811 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-21 22:01:29,812 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-21 22:01:29,812 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-21 22:01:29,812 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-21 22:01:29,812 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-21 22:01:29,812 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-21 22:01:29,826 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-21 22:01:29,829 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow
[2020-10-21 22:01:29,832 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow
[2020-10-21 22:01:29,834 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow
[2020-10-21 22:01:29,880 INFO  L129       PetriNetUnfolder]: 3/98 cut-off events.
[2020-10-21 22:01:29,880 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-21 22:01:29,885 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. 
[2020-10-21 22:01:29,888 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1754
[2020-10-21 22:01:30,042 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:30,043 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:30,051 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,052 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:30,055 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,055 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:30,058 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,058 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:30,062 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:30,063 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,068 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,068 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,075 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,075 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,136 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,137 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:01:30,140 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:30,141 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,370 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:30,370 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,372 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,372 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,373 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,373 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,464 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:30,464 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:30,467 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,467 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:30,469 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,469 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:30,471 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,472 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:30,474 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:30,474 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,476 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,476 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,478 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,479 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,518 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,519 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:01:30,521 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:30,522 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,636 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,636 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:01:30,638 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:30,639 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,674 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:30,675 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:30,677 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,677 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:30,678 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,678 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:30,679 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,680 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:30,682 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:30,683 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,684 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,684 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,687 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,688 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,751 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:30,752 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:30,759 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,759 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:30,762 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,762 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:30,765 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,765 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:30,768 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:30,768 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,770 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,771 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,774 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,775 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:30,832 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:30,832 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:01:30,835 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:30,835 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:31,401 WARN  L193               SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-21 22:01:31,556 WARN  L193               SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-21 22:01:31,600 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:31,600 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:01:31,603 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:31,603 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:31,641 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:31,641 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:31,646 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:31,646 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:31,648 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:31,649 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:31,650 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:31,650 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:31,652 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:31,653 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:31,654 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:31,655 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:31,656 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:31,657 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,011 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,011 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,012 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,012 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,014 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,014 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,015 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:32,016 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,028 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,029 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,030 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,030 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,032 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,032 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:32,034 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:32,034 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:32,107 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,107 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-21 22:01:32,110 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:32,110 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,142 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,142 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,144 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,145 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:32,147 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,147 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:32,148 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,149 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:32,150 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:32,151 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,152 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,153 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,154 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,154 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,455 WARN  L193               SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-21 22:01:32,560 WARN  L193               SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-21 22:01:32,604 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,605 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,607 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,607 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:32,609 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,609 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:32,610 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,611 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:32,612 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:32,612 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,614 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,614 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,615 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,615 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,643 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,644 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-21 22:01:32,646 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:32,646 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,679 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-21 22:01:32,679 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,741 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:32,742 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,743 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,743 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,745 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,745 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,747 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:32,747 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,760 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:32,760 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,761 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,762 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,763 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,763 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:32,765 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:32,765 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:32,884 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:32,884 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,886 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,886 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:32,887 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,887 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:32,888 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,889 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:32,890 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:32,891 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,892 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,893 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,893 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,894 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,926 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,926 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-21 22:01:32,928 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:32,928 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:32,981 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:32,982 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,983 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,983 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:32,984 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:32,984 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:33,040 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:33,040 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-21 22:01:33,042 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:33,043 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:33,065 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,065 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:33,070 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:33,071 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:33,071 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:33,072 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:33,073 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:33,073 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:33,075 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:33,105 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:33,106 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:33,106 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:33,109 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:33,109 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:33,174 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-21 22:01:33,174 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:33,229 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:33,230 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:33,231 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:33,231 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:33,232 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:33,232 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:33,293 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:33,294 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,294 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:33,295 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,296 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:33,297 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:33,298 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:33,310 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,311 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:33,311 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,312 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:33,313 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,313 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:33,314 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:33,315 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:33,356 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-21 22:01:33,356 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:33,380 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,381 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:33,382 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,382 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:33,384 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,384 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:33,385 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:33,386 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:33,396 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,396 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:33,397 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,397 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:33,399 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:33,399 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:33,400 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:33,400 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:34,533 WARN  L193               SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114
[2020-10-21 22:01:34,721 WARN  L193               SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 110
[2020-10-21 22:01:34,732 INFO  L131        LiptonReduction]: Checked pairs total: 4709
[2020-10-21 22:01:34,732 INFO  L133        LiptonReduction]: Total number of compositions: 90
[2020-10-21 22:01:34,743 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow
[2020-10-21 22:01:34,805 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states.
[2020-10-21 22:01:34,807 INFO  L276                IsEmpty]: Start isEmpty. Operand 778 states.
[2020-10-21 22:01:34,816 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-21 22:01:34,816 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:34,817 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-21 22:01:34,817 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:34,823 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:34,823 INFO  L82        PathProgramCache]: Analyzing trace with hash 961056384, now seen corresponding path program 1 times
[2020-10-21 22:01:34,833 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:34,833 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289259843]
[2020-10-21 22:01:34,834 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:34,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:35,054 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-21 22:01:35,055 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289259843]
[2020-10-21 22:01:35,056 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:35,056 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-21 22:01:35,057 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269409589]
[2020-10-21 22:01:35,062 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-21 22:01:35,063 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:35,079 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-21 22:01:35,079 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:01:35,082 INFO  L87              Difference]: Start difference. First operand 778 states. Second operand 3 states.
[2020-10-21 22:01:35,172 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:35,172 INFO  L93              Difference]: Finished difference Result 650 states and 2028 transitions.
[2020-10-21 22:01:35,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-21 22:01:35,174 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-21 22:01:35,175 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:35,197 INFO  L225             Difference]: With dead ends: 650
[2020-10-21 22:01:35,198 INFO  L226             Difference]: Without dead ends: 550
[2020-10-21 22:01:35,199 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-21 22:01:35,229 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 550 states.
[2020-10-21 22:01:35,304 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550.
[2020-10-21 22:01:35,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 550 states.
[2020-10-21 22:01:35,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions.
[2020-10-21 22:01:35,313 INFO  L78                 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 5
[2020-10-21 22:01:35,313 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:35,313 INFO  L481      AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions.
[2020-10-21 22:01:35,313 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-21 22:01:35,314 INFO  L276                IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions.
[2020-10-21 22:01:35,315 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-21 22:01:35,316 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:35,316 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:35,316 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-21 22:01:35,317 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:35,317 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:35,317 INFO  L82        PathProgramCache]: Analyzing trace with hash -584427679, now seen corresponding path program 1 times
[2020-10-21 22:01:35,317 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:35,318 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434835424]
[2020-10-21 22:01:35,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:35,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:35,502 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-21 22:01:35,502 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434835424]
[2020-10-21 22:01:35,502 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:35,502 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:01:35,503 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58378604]
[2020-10-21 22:01:35,504 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:35,505 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:35,505 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:35,505 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:35,505 INFO  L87              Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states.
[2020-10-21 22:01:35,562 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:35,563 INFO  L93              Difference]: Finished difference Result 610 states and 1806 transitions.
[2020-10-21 22:01:35,563 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:35,563 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-21 22:01:35,563 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:35,569 INFO  L225             Difference]: With dead ends: 610
[2020-10-21 22:01:35,569 INFO  L226             Difference]: Without dead ends: 510
[2020-10-21 22:01:35,570 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-21 22:01:35,574 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 510 states.
[2020-10-21 22:01:35,599 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510.
[2020-10-21 22:01:35,599 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 510 states.
[2020-10-21 22:01:35,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1551 transitions.
[2020-10-21 22:01:35,603 INFO  L78                 Accepts]: Start accepts. Automaton has 510 states and 1551 transitions. Word has length 10
[2020-10-21 22:01:35,604 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:35,604 INFO  L481      AbstractCegarLoop]: Abstraction has 510 states and 1551 transitions.
[2020-10-21 22:01:35,604 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:35,605 INFO  L276                IsEmpty]: Start isEmpty. Operand 510 states and 1551 transitions.
[2020-10-21 22:01:35,607 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-21 22:01:35,607 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:35,607 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:35,608 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-21 22:01:35,608 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:35,608 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:35,608 INFO  L82        PathProgramCache]: Analyzing trace with hash -971571790, now seen corresponding path program 1 times
[2020-10-21 22:01:35,609 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:35,609 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248642485]
[2020-10-21 22:01:35,609 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:35,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:35,698 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-21 22:01:35,699 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248642485]
[2020-10-21 22:01:35,699 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:35,699 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:01:35,699 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738399723]
[2020-10-21 22:01:35,700 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:35,700 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:35,700 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:35,700 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:35,701 INFO  L87              Difference]: Start difference. First operand 510 states and 1551 transitions. Second operand 4 states.
[2020-10-21 22:01:35,737 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:35,738 INFO  L93              Difference]: Finished difference Result 580 states and 1702 transitions.
[2020-10-21 22:01:35,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:35,739 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-21 22:01:35,739 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:35,743 INFO  L225             Difference]: With dead ends: 580
[2020-10-21 22:01:35,743 INFO  L226             Difference]: Without dead ends: 500
[2020-10-21 22:01:35,744 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-21 22:01:35,746 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 500 states.
[2020-10-21 22:01:35,758 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500.
[2020-10-21 22:01:35,759 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 500 states.
[2020-10-21 22:01:35,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1513 transitions.
[2020-10-21 22:01:35,762 INFO  L78                 Accepts]: Start accepts. Automaton has 500 states and 1513 transitions. Word has length 11
[2020-10-21 22:01:35,762 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:35,762 INFO  L481      AbstractCegarLoop]: Abstraction has 500 states and 1513 transitions.
[2020-10-21 22:01:35,763 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:35,763 INFO  L276                IsEmpty]: Start isEmpty. Operand 500 states and 1513 transitions.
[2020-10-21 22:01:35,765 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-21 22:01:35,765 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:35,766 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:35,766 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-21 22:01:35,766 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:35,766 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:35,766 INFO  L82        PathProgramCache]: Analyzing trace with hash -2052600820, now seen corresponding path program 1 times
[2020-10-21 22:01:35,767 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:35,767 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847337491]
[2020-10-21 22:01:35,767 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:35,795 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:35,851 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-21 22:01:35,851 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847337491]
[2020-10-21 22:01:35,852 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:35,852 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:01:35,852 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681317277]
[2020-10-21 22:01:35,853 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:01:35,853 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:35,853 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:01:35,853 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:35,854 INFO  L87              Difference]: Start difference. First operand 500 states and 1513 transitions. Second operand 5 states.
[2020-10-21 22:01:35,918 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:35,918 INFO  L93              Difference]: Finished difference Result 659 states and 1958 transitions.
[2020-10-21 22:01:35,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:35,919 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-21 22:01:35,919 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:35,922 INFO  L225             Difference]: With dead ends: 659
[2020-10-21 22:01:35,922 INFO  L226             Difference]: Without dead ends: 344
[2020-10-21 22:01:35,923 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2020-10-21 22:01:35,924 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 344 states.
[2020-10-21 22:01:35,933 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344.
[2020-10-21 22:01:35,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 344 states.
[2020-10-21 22:01:35,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 977 transitions.
[2020-10-21 22:01:35,935 INFO  L78                 Accepts]: Start accepts. Automaton has 344 states and 977 transitions. Word has length 12
[2020-10-21 22:01:35,935 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:35,936 INFO  L481      AbstractCegarLoop]: Abstraction has 344 states and 977 transitions.
[2020-10-21 22:01:35,936 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:01:35,936 INFO  L276                IsEmpty]: Start isEmpty. Operand 344 states and 977 transitions.
[2020-10-21 22:01:35,937 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:01:35,937 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:35,937 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:35,938 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-21 22:01:35,938 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:35,938 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:35,938 INFO  L82        PathProgramCache]: Analyzing trace with hash 1682078331, now seen corresponding path program 1 times
[2020-10-21 22:01:35,938 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:35,939 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132941257]
[2020-10-21 22:01:35,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:35,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:36,048 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-21 22:01:36,048 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132941257]
[2020-10-21 22:01:36,049 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:36,049 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:01:36,052 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521866699]
[2020-10-21 22:01:36,053 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:36,053 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:36,053 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:36,053 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:36,054 INFO  L87              Difference]: Start difference. First operand 344 states and 977 transitions. Second operand 4 states.
[2020-10-21 22:01:36,111 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:36,112 INFO  L93              Difference]: Finished difference Result 320 states and 798 transitions.
[2020-10-21 22:01:36,112 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:36,112 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-21 22:01:36,113 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:36,114 INFO  L225             Difference]: With dead ends: 320
[2020-10-21 22:01:36,115 INFO  L226             Difference]: Without dead ends: 252
[2020-10-21 22:01:36,115 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-21 22:01:36,117 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 252 states.
[2020-10-21 22:01:36,122 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252.
[2020-10-21 22:01:36,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 252 states.
[2020-10-21 22:01:36,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 621 transitions.
[2020-10-21 22:01:36,124 INFO  L78                 Accepts]: Start accepts. Automaton has 252 states and 621 transitions. Word has length 14
[2020-10-21 22:01:36,124 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:36,124 INFO  L481      AbstractCegarLoop]: Abstraction has 252 states and 621 transitions.
[2020-10-21 22:01:36,125 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:36,125 INFO  L276                IsEmpty]: Start isEmpty. Operand 252 states and 621 transitions.
[2020-10-21 22:01:36,126 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-21 22:01:36,126 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:36,126 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:36,126 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-21 22:01:36,126 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:36,126 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:36,127 INFO  L82        PathProgramCache]: Analyzing trace with hash 1546774926, now seen corresponding path program 1 times
[2020-10-21 22:01:36,127 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:36,127 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907688095]
[2020-10-21 22:01:36,127 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:36,177 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:36,242 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-21 22:01:36,242 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907688095]
[2020-10-21 22:01:36,242 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:36,243 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:01:36,243 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811768535]
[2020-10-21 22:01:36,245 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:01:36,245 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:36,245 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:01:36,246 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:36,246 INFO  L87              Difference]: Start difference. First operand 252 states and 621 transitions. Second operand 5 states.
[2020-10-21 22:01:36,344 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:36,344 INFO  L93              Difference]: Finished difference Result 194 states and 428 transitions.
[2020-10-21 22:01:36,345 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:36,345 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2020-10-21 22:01:36,345 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:36,346 INFO  L225             Difference]: With dead ends: 194
[2020-10-21 22:01:36,346 INFO  L226             Difference]: Without dead ends: 156
[2020-10-21 22:01:36,347 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-21 22:01:36,348 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2020-10-21 22:01:36,351 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156.
[2020-10-21 22:01:36,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 156 states.
[2020-10-21 22:01:36,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 337 transitions.
[2020-10-21 22:01:36,353 INFO  L78                 Accepts]: Start accepts. Automaton has 156 states and 337 transitions. Word has length 16
[2020-10-21 22:01:36,353 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:36,354 INFO  L481      AbstractCegarLoop]: Abstraction has 156 states and 337 transitions.
[2020-10-21 22:01:36,354 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:01:36,354 INFO  L276                IsEmpty]: Start isEmpty. Operand 156 states and 337 transitions.
[2020-10-21 22:01:36,355 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-21 22:01:36,355 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:36,356 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-21 22:01:36,356 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-21 22:01:36,356 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:36,356 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:36,357 INFO  L82        PathProgramCache]: Analyzing trace with hash 1212340015, now seen corresponding path program 1 times
[2020-10-21 22:01:36,357 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:36,357 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795524424]
[2020-10-21 22:01:36,358 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:36,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:36,522 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-21 22:01:36,523 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795524424]
[2020-10-21 22:01:36,523 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:36,523 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-21 22:01:36,523 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698853993]
[2020-10-21 22:01:36,524 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:01:36,524 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:36,524 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:01:36,524 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:36,524 INFO  L87              Difference]: Start difference. First operand 156 states and 337 transitions. Second operand 6 states.
[2020-10-21 22:01:36,587 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:36,588 INFO  L93              Difference]: Finished difference Result 132 states and 287 transitions.
[2020-10-21 22:01:36,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:01:36,588 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2020-10-21 22:01:36,589 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:36,590 INFO  L225             Difference]: With dead ends: 132
[2020-10-21 22:01:36,590 INFO  L226             Difference]: Without dead ends: 122
[2020-10-21 22:01:36,590 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-21 22:01:36,591 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 122 states.
[2020-10-21 22:01:36,593 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122.
[2020-10-21 22:01:36,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 122 states.
[2020-10-21 22:01:36,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 269 transitions.
[2020-10-21 22:01:36,594 INFO  L78                 Accepts]: Start accepts. Automaton has 122 states and 269 transitions. Word has length 18
[2020-10-21 22:01:36,595 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:36,595 INFO  L481      AbstractCegarLoop]: Abstraction has 122 states and 269 transitions.
[2020-10-21 22:01:36,595 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:01:36,595 INFO  L276                IsEmpty]: Start isEmpty. Operand 122 states and 269 transitions.
[2020-10-21 22:01:36,596 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-21 22:01:36,596 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:36,596 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]
[2020-10-21 22:01:36,596 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-21 22:01:36,596 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:36,596 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:36,597 INFO  L82        PathProgramCache]: Analyzing trace with hash 1559739241, now seen corresponding path program 1 times
[2020-10-21 22:01:36,597 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:36,597 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975327843]
[2020-10-21 22:01:36,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:36,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:36,707 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-21 22:01:36,707 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975327843]
[2020-10-21 22:01:36,708 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:36,708 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:01:36,708 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957822437]
[2020-10-21 22:01:36,708 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:36,709 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:36,709 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:36,709 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:36,709 INFO  L87              Difference]: Start difference. First operand 122 states and 269 transitions. Second operand 4 states.
[2020-10-21 22:01:36,730 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:36,731 INFO  L93              Difference]: Finished difference Result 152 states and 326 transitions.
[2020-10-21 22:01:36,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-21 22:01:36,731 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 21
[2020-10-21 22:01:36,732 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:36,732 INFO  L225             Difference]: With dead ends: 152
[2020-10-21 22:01:36,732 INFO  L226             Difference]: Without dead ends: 62
[2020-10-21 22:01:36,733 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-21 22:01:36,733 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 62 states.
[2020-10-21 22:01:36,734 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62.
[2020-10-21 22:01:36,735 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 62 states.
[2020-10-21 22:01:36,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions.
[2020-10-21 22:01:36,735 INFO  L78                 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 21
[2020-10-21 22:01:36,735 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:36,736 INFO  L481      AbstractCegarLoop]: Abstraction has 62 states and 113 transitions.
[2020-10-21 22:01:36,736 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:36,736 INFO  L276                IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions.
[2020-10-21 22:01:36,736 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-21 22:01:36,736 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:36,737 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]
[2020-10-21 22:01:36,737 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-21 22:01:36,737 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:36,737 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:36,737 INFO  L82        PathProgramCache]: Analyzing trace with hash -926669961, now seen corresponding path program 2 times
[2020-10-21 22:01:36,738 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:36,738 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788763610]
[2020-10-21 22:01:36,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:36,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-21 22:01:36,793 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-21 22:01:36,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-21 22:01:36,847 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-21 22:01:36,906 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-21 22:01:36,907 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-21 22:01:36,907 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-21 22:01:36,937 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-21 22:01:36,938 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,938 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-21 22:01:36,939 WARN  L224     RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [773]
[2020-10-21 22:01:36,940 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-21 22:01:36,940 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,941 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-21 22:01:36,941 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,941 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-21 22:01:36,941 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,941 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-21 22:01:36,942 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,942 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-21 22:01:36,942 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,943 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-21 22:01:36,943 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,943 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-21 22:01:36,943 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,943 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-21 22:01:36,944 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,944 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-21 22:01:36,944 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,944 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-21 22:01:36,944 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,944 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-21 22:01:36,945 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,945 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-21 22:01:36,945 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,945 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-21 22:01:36,945 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,946 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-21 22:01:36,946 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,946 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-21 22:01:36,946 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,952 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-21 22:01:36,953 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,953 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-21 22:01:36,953 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,953 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-21 22:01:36,953 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,953 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-21 22:01:36,953 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,953 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-21 22:01:36,953 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,956 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-21 22:01:36,956 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,957 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-21 22:01:36,957 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,957 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-21 22:01:36,957 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,957 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-21 22:01:36,957 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,958 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-21 22:01:36,958 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:36,958 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-21 22:01:36,958 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:37,059 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:01:37 BasicIcfg
[2020-10-21 22:01:37,060 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-21 22:01:37,062 INFO  L168              Benchmark]: Toolchain (without parser) took 10602.39 ms. Allocated memory was 140.5 MB in the beginning and 391.6 MB in the end (delta: 251.1 MB). Free memory was 101.7 MB in the beginning and 247.6 MB in the end (delta: -145.9 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:37,063 INFO  L168              Benchmark]: CDTParser took 3.22 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB.
[2020-10-21 22:01:37,065 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 921.16 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 100.9 MB in the beginning and 154.8 MB in the end (delta: -53.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:37,066 INFO  L168              Benchmark]: Boogie Procedure Inliner took 61.67 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:37,070 INFO  L168              Benchmark]: Boogie Preprocessor took 69.51 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 149.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:37,070 INFO  L168              Benchmark]: RCFGBuilder took 2152.99 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 149.3 MB in the beginning and 178.3 MB in the end (delta: -29.0 MB). Peak memory consumption was 98.3 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:37,075 INFO  L168              Benchmark]: TraceAbstraction took 7387.40 ms. Allocated memory was 246.4 MB in the beginning and 391.6 MB in the end (delta: 145.2 MB). Free memory was 178.3 MB in the beginning and 247.6 MB in the end (delta: -69.3 MB). Peak memory consumption was 75.9 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:37,081 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 3.22 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 921.16 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 100.9 MB in the beginning and 154.8 MB in the end (delta: -53.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 61.67 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 69.51 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 149.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2152.99 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 149.3 MB in the beginning and 178.3 MB in the end (delta: -29.0 MB). Peak memory consumption was 98.3 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 7387.40 ms. Allocated memory was 246.4 MB in the beginning and 391.6 MB in the end (delta: 145.2 MB). Free memory was 178.3 MB in the beginning and 247.6 MB in the end (delta: -69.3 MB). Peak memory consumption was 75.9 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1260 VarBasedMoverChecksPositive, 56 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 130 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.9s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 27 TransitionsAfterwards, 1754 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, 4709 MoverChecksTotal
  - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  int __unbuffered_p2_EAX = 0;
[L715]               0  _Bool main$tmp_guard0;
[L716]               0  _Bool main$tmp_guard1;
[L718]               0  int x = 0;
[L719]               0  _Bool x$flush_delayed;
[L720]               0  int x$mem_tmp;
[L721]               0  _Bool x$r_buff0_thd0;
[L722]               0  _Bool x$r_buff0_thd1;
[L723]               0  _Bool x$r_buff0_thd2;
[L724]               0  _Bool x$r_buff0_thd3;
[L725]               0  _Bool x$r_buff1_thd0;
[L726]               0  _Bool x$r_buff1_thd1;
[L727]               0  _Bool x$r_buff1_thd2;
[L728]               0  _Bool x$r_buff1_thd3;
[L729]               0  _Bool x$read_delayed;
[L730]               0  int *x$read_delayed_var;
[L731]               0  int x$w_buff0;
[L732]               0  _Bool x$w_buff0_used;
[L733]               0  int x$w_buff1;
[L734]               0  _Bool x$w_buff1_used;
[L736]               0  int y = 0;
[L738]               0  int z = 0;
[L739]               0  _Bool weak$$choice0;
[L740]               0  _Bool weak$$choice2;
[L831]               0  pthread_t t2076;
[L832]  FCALL, FORK  0  pthread_create(&t2076, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L833]               0  pthread_t t2077;
[L834]  FCALL, FORK  0  pthread_create(&t2077, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L835]               0  pthread_t t2078;
[L836]  FCALL, FORK  0  pthread_create(&t2078, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L774]               2  x$w_buff1 = x$w_buff0
[L775]               2  x$w_buff0 = 1
[L776]               2  x$w_buff1_used = x$w_buff0_used
[L777]               2  x$w_buff0_used = (_Bool)1
[L19]   COND TRUE    2  !expression
[L18]   COND FALSE   2  !(0)
[L18]                2  __assert_fail ("0", "safe013_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__)
[L779]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L780]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L781]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L782]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L783]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L786]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L803]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L806]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L744]               1  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L809]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L809]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L810]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L810]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L811]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L811]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L812]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L812]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L813]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L813]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L749]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L750]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L751]               1  x$flush_delayed = weak$$choice2
[L752]               1  x$mem_tmp = x
[L753]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L753]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1
[L753]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L753]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L754]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L754]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L755]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L755]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L756]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L756]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L757]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L757]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L758]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L758]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L759]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L759]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L759]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L759]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L760]               1  __unbuffered_p0_EAX = x
[L761]  EXPR         1  x$flush_delayed ? x$mem_tmp : x
[L761]               1  x = x$flush_delayed ? x$mem_tmp : x
[L762]               1  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L767]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L769]               1  return 0;
[L789]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L789]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L790]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L790]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L791]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L791]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L792]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L792]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L793]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L793]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L796]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L798]               2  return 0;
[L816]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L818]               3  return 0;
[L838]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L4]    COND FALSE   0  !(!cond)
[L842]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L842]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L842]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L842]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L843]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L843]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L844]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L844]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L845]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L845]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L846]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L846]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L849]               0  main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1)
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L19]   COND TRUE    0  !expression
[L18]   COND FALSE   0  !(0)
[L18]                0  __assert_fail ("0", "safe013_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__)
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.0s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 206 SDtfs, 218 SDslu, 337 SDs, 0 SdLazy, 123 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 3919 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...