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


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 12:10:25,134 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 12:10:25,138 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 12:10:25,181 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 12:10:25,181 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 12:10:25,194 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 12:10:25,195 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 12:10:25,198 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 12:10:25,201 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 12:10:25,205 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 12:10:25,206 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 12:10:25,208 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 12:10:25,209 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 12:10:25,211 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 12:10:25,214 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 12:10:25,215 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 12:10:25,217 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 12:10:25,218 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 12:10:25,220 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 12:10:25,230 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 12:10:25,233 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 12:10:25,234 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 12:10:25,235 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 12:10:25,235 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 12:10:25,239 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 12:10:25,240 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 12:10:25,240 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 12:10:25,242 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 12:10:25,243 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 12:10:25,245 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 12:10:25,245 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 12:10:25,246 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 12:10:25,247 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 12:10:25,247 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 12:10:25,249 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 12:10:25,249 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 12:10:25,249 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 12:10:25,250 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 12:10:25,250 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 12:10:25,251 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 12:10:25,252 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 12:10:25,253 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf
[2020-10-16 12:10:25,297 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 12:10:25,297 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 12:10:25,300 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 12:10:25,300 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 12:10:25,300 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 12:10:25,301 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 12:10:25,301 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 12:10:25,301 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 12:10:25,301 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 12:10:25,301 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 12:10:25,303 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 12:10:25,303 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 12:10:25,303 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 12:10:25,304 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 12:10:25,304 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 12:10:25,304 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 12:10:25,304 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 12:10:25,304 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 12:10:25,305 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 12:10:25,305 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 12:10:25,305 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 12:10:25,305 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 12:10:25,306 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 12:10:25,306 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 12:10:25,306 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 12:10:25,306 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 12:10:25,306 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 12:10:25,306 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 12:10:25,307 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 12:10:25,595 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 12:10:25,609 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 12:10:25,613 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 12:10:25,614 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 12:10:25,617 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 12:10:25,618 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i
[2020-10-16 12:10:25,695 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/871505ec5/dbefe3e7e48844568fef82c40e9f8286/FLAG4a5b00271
[2020-10-16 12:10:26,245 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 12:10:26,245 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i
[2020-10-16 12:10:26,275 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/871505ec5/dbefe3e7e48844568fef82c40e9f8286/FLAG4a5b00271
[2020-10-16 12:10:26,589 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/871505ec5/dbefe3e7e48844568fef82c40e9f8286
[2020-10-16 12:10:26,599 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 12:10:26,602 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 12:10:26,603 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 12:10:26,603 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 12:10:26,607 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 12:10:26,608 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:10:26" (1/1) ...
[2020-10-16 12:10:26,611 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cbd39d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:26, skipping insertion in model container
[2020-10-16 12:10:26,611 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:10:26" (1/1) ...
[2020-10-16 12:10:26,619 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 12:10:26,685 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 12:10:27,301 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 12:10:27,314 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 12:10:27,379 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 12:10:27,505 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 12:10:27,507 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27 WrapperNode
[2020-10-16 12:10:27,508 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 12:10:27,509 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 12:10:27,509 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 12:10:27,510 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 12:10:27,521 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ...
[2020-10-16 12:10:27,578 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ...
[2020-10-16 12:10:27,631 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 12:10:27,631 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 12:10:27,631 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 12:10:27,632 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 12:10:27,646 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ...
[2020-10-16 12:10:27,646 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ...
[2020-10-16 12:10:27,667 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ...
[2020-10-16 12:10:27,668 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ...
[2020-10-16 12:10:27,700 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ...
[2020-10-16 12:10:27,711 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ...
[2020-10-16 12:10:27,719 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ...
[2020-10-16 12:10:27,734 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 12:10:27,735 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 12:10:27,735 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 12:10:27,735 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 12:10:27,737 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 12:10:27,801 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 12:10:27,801 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 12:10:27,801 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 12:10:27,801 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 12:10:27,802 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 12:10:27,802 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 12:10:27,802 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 12:10:27,802 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 12:10:27,803 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 12:10:27,803 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 12:10:27,803 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 12:10:27,803 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 12:10:27,804 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 12:10:27,806 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 12:10:31,456 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 12:10:31,457 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 12:10:31,459 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:10:31 BoogieIcfgContainer
[2020-10-16 12:10:31,460 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 12:10:31,461 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 12:10:31,461 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 12:10:31,465 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 12:10:31,465 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:10:26" (1/3) ...
[2020-10-16 12:10:31,466 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630c198e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:10:31, skipping insertion in model container
[2020-10-16 12:10:31,466 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (2/3) ...
[2020-10-16 12:10:31,467 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630c198e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:10:31, skipping insertion in model container
[2020-10-16 12:10:31,467 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:10:31" (3/3) ...
[2020-10-16 12:10:31,469 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe023_pso.opt.i
[2020-10-16 12:10:31,482 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 12:10:31,482 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 12:10:31,492 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 12:10:31,493 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 12:10:31,532 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,532 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,533 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,533 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,533 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,533 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,538 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,538 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,538 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,538 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,538 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,539 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,539 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,539 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,539 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,539 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,539 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,540 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,540 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,540 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,540 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,540 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,540 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,541 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,541 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,541 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,541 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,543 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,543 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,543 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,544 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,544 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,544 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,544 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,545 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,545 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,545 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,546 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,546 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,546 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,546 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,546 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,547 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,547 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,547 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,547 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,547 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,548 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,548 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,548 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,548 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,549 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,549 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,549 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,549 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,550 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,550 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,550 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,550 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,550 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,555 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,555 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,555 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,555 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,555 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,555 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,564 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,564 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,564 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,564 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,565 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,565 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,565 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,565 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,565 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,566 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,566 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,566 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,572 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,572 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,572 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,572 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,573 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,573 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,573 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,573 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,573 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,574 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,574 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,574 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,574 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,574 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,574 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,575 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,575 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,575 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,575 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,575 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,576 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,576 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,576 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,576 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,576 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,576 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,577 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,577 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,577 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,577 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,577 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,577 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,578 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,580 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,580 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,580 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,580 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,580 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,581 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,581 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,581 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,581 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,581 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,582 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,582 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,582 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,582 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,582 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,583 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,583 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,583 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,583 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,583 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,583 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,584 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,584 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,584 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,584 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,584 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,585 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,585 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,585 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,585 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,585 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,585 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,586 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,586 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,586 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,586 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,586 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,586 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,587 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:10:31,588 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 12:10:31,604 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 12:10:31,627 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 12:10:31,628 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 12:10:31,628 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 12:10:31,628 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 12:10:31,628 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 12:10:31,628 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 12:10:31,628 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 12:10:31,628 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 12:10:31,643 INFO  L137   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 12:10:31,644 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 203 flow
[2020-10-16 12:10:31,647 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 203 flow
[2020-10-16 12:10:31,649 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow
[2020-10-16 12:10:31,700 INFO  L129       PetriNetUnfolder]: 2/91 cut-off events.
[2020-10-16 12:10:31,701 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 12:10:31,706 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. 
[2020-10-16 12:10:31,710 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1740
[2020-10-16 12:10:32,190 WARN  L193               SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 12:10:32,327 WARN  L193               SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 12:10:32,905 WARN  L193               SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 12:10:33,821 WARN  L193               SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 73
[2020-10-16 12:10:34,130 WARN  L193               SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87
[2020-10-16 12:10:34,239 WARN  L193               SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2020-10-16 12:10:34,250 INFO  L132        LiptonReduction]: Checked pairs total: 6058
[2020-10-16 12:10:34,250 INFO  L134        LiptonReduction]: Total number of compositions: 75
[2020-10-16 12:10:34,257 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow
[2020-10-16 12:10:34,347 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1346 states.
[2020-10-16 12:10:34,350 INFO  L276                IsEmpty]: Start isEmpty. Operand 1346 states.
[2020-10-16 12:10:34,357 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 12:10:34,357 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:34,358 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 12:10:34,358 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-16 12:10:34,364 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:34,364 INFO  L82        PathProgramCache]: Analyzing trace with hash 1710719517, now seen corresponding path program 1 times
[2020-10-16 12:10:34,375 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:34,376 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932877538]
[2020-10-16 12:10:34,376 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:34,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:34,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:34,612 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932877538]
[2020-10-16 12:10:34,613 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:34,613 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:10:34,614 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580799568]
[2020-10-16 12:10:34,618 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:10:34,618 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:34,629 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:10:34,630 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:10:34,632 INFO  L87              Difference]: Start difference. First operand 1346 states. Second operand 3 states.
[2020-10-16 12:10:34,782 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:34,783 INFO  L93              Difference]: Finished difference Result 1124 states and 3637 transitions.
[2020-10-16 12:10:34,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:10:34,785 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 12:10:34,786 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:34,815 INFO  L225             Difference]: With dead ends: 1124
[2020-10-16 12:10:34,815 INFO  L226             Difference]: Without dead ends: 824
[2020-10-16 12:10:34,816 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:10:34,841 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 824 states.
[2020-10-16 12:10:34,935 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824.
[2020-10-16 12:10:34,937 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 824 states.
[2020-10-16 12:10:34,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2607 transitions.
[2020-10-16 12:10:34,946 INFO  L78                 Accepts]: Start accepts. Automaton has 824 states and 2607 transitions. Word has length 5
[2020-10-16 12:10:34,946 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:34,947 INFO  L481      AbstractCegarLoop]: Abstraction has 824 states and 2607 transitions.
[2020-10-16 12:10:34,947 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:10:34,947 INFO  L276                IsEmpty]: Start isEmpty. Operand 824 states and 2607 transitions.
[2020-10-16 12:10:34,950 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 12:10:34,950 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:34,950 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:34,951 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 12:10:34,951 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-16 12:10:34,951 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:34,952 INFO  L82        PathProgramCache]: Analyzing trace with hash 1176658182, now seen corresponding path program 1 times
[2020-10-16 12:10:34,952 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:34,952 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911193274]
[2020-10-16 12:10:34,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:35,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:35,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:35,191 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911193274]
[2020-10-16 12:10:35,191 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:35,192 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:10:35,192 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716043236]
[2020-10-16 12:10:35,193 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:10:35,194 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:35,194 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:10:35,194 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:10:35,194 INFO  L87              Difference]: Start difference. First operand 824 states and 2607 transitions. Second operand 4 states.
[2020-10-16 12:10:35,250 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:35,250 INFO  L93              Difference]: Finished difference Result 824 states and 2507 transitions.
[2020-10-16 12:10:35,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:10:35,251 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-16 12:10:35,251 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:35,257 INFO  L225             Difference]: With dead ends: 824
[2020-10-16 12:10:35,258 INFO  L226             Difference]: Without dead ends: 674
[2020-10-16 12:10:35,259 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:10:35,262 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 674 states.
[2020-10-16 12:10:35,281 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674.
[2020-10-16 12:10:35,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 674 states.
[2020-10-16 12:10:35,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 2067 transitions.
[2020-10-16 12:10:35,285 INFO  L78                 Accepts]: Start accepts. Automaton has 674 states and 2067 transitions. Word has length 10
[2020-10-16 12:10:35,286 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:35,286 INFO  L481      AbstractCegarLoop]: Abstraction has 674 states and 2067 transitions.
[2020-10-16 12:10:35,286 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:10:35,286 INFO  L276                IsEmpty]: Start isEmpty. Operand 674 states and 2067 transitions.
[2020-10-16 12:10:35,289 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 12:10:35,290 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:35,290 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:35,290 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 12:10:35,290 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-16 12:10:35,290 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:35,291 INFO  L82        PathProgramCache]: Analyzing trace with hash 1344113875, now seen corresponding path program 1 times
[2020-10-16 12:10:35,291 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:35,291 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802481995]
[2020-10-16 12:10:35,291 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:35,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:35,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:35,434 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802481995]
[2020-10-16 12:10:35,435 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:35,435 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:10:35,435 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117755976]
[2020-10-16 12:10:35,436 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:10:35,436 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:35,436 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:10:35,436 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:10:35,437 INFO  L87              Difference]: Start difference. First operand 674 states and 2067 transitions. Second operand 4 states.
[2020-10-16 12:10:35,476 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:35,477 INFO  L93              Difference]: Finished difference Result 719 states and 2148 transitions.
[2020-10-16 12:10:35,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:10:35,478 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-16 12:10:35,478 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:35,483 INFO  L225             Difference]: With dead ends: 719
[2020-10-16 12:10:35,483 INFO  L226             Difference]: Without dead ends: 644
[2020-10-16 12:10:35,484 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:10:35,487 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 644 states.
[2020-10-16 12:10:35,505 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644.
[2020-10-16 12:10:35,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 644 states.
[2020-10-16 12:10:35,510 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1963 transitions.
[2020-10-16 12:10:35,510 INFO  L78                 Accepts]: Start accepts. Automaton has 644 states and 1963 transitions. Word has length 13
[2020-10-16 12:10:35,511 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:35,511 INFO  L481      AbstractCegarLoop]: Abstraction has 644 states and 1963 transitions.
[2020-10-16 12:10:35,511 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:10:35,511 INFO  L276                IsEmpty]: Start isEmpty. Operand 644 states and 1963 transitions.
[2020-10-16 12:10:35,513 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 12:10:35,514 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:35,514 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:35,514 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 12:10:35,514 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-16 12:10:35,515 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:35,515 INFO  L82        PathProgramCache]: Analyzing trace with hash -1320556469, now seen corresponding path program 1 times
[2020-10-16 12:10:35,515 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:35,516 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965492910]
[2020-10-16 12:10:35,516 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:35,647 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:35,772 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:35,773 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965492910]
[2020-10-16 12:10:35,776 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:35,776 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:10:35,776 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980031157]
[2020-10-16 12:10:35,777 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:10:35,777 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:35,777 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:10:35,778 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:10:35,778 INFO  L87              Difference]: Start difference. First operand 644 states and 1963 transitions. Second operand 5 states.
[2020-10-16 12:10:35,854 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:35,854 INFO  L93              Difference]: Finished difference Result 872 states and 2622 transitions.
[2020-10-16 12:10:35,855 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 12:10:35,855 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-16 12:10:35,855 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:35,859 INFO  L225             Difference]: With dead ends: 872
[2020-10-16 12:10:35,859 INFO  L226             Difference]: Without dead ends: 452
[2020-10-16 12:10:35,860 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-16 12:10:35,862 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 452 states.
[2020-10-16 12:10:35,872 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452.
[2020-10-16 12:10:35,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 452 states.
[2020-10-16 12:10:35,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1295 transitions.
[2020-10-16 12:10:35,875 INFO  L78                 Accepts]: Start accepts. Automaton has 452 states and 1295 transitions. Word has length 14
[2020-10-16 12:10:35,875 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:35,875 INFO  L481      AbstractCegarLoop]: Abstraction has 452 states and 1295 transitions.
[2020-10-16 12:10:35,875 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:10:35,876 INFO  L276                IsEmpty]: Start isEmpty. Operand 452 states and 1295 transitions.
[2020-10-16 12:10:35,877 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 12:10:35,877 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:35,877 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:35,877 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 12:10:35,877 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-16 12:10:35,878 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:35,878 INFO  L82        PathProgramCache]: Analyzing trace with hash -1717675043, now seen corresponding path program 1 times
[2020-10-16 12:10:35,878 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:35,878 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492437128]
[2020-10-16 12:10:35,878 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:35,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:36,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:36,170 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492437128]
[2020-10-16 12:10:36,170 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:36,171 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-16 12:10:36,171 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595663224]
[2020-10-16 12:10:36,171 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 12:10:36,172 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:36,172 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 12:10:36,172 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2020-10-16 12:10:36,172 INFO  L87              Difference]: Start difference. First operand 452 states and 1295 transitions. Second operand 9 states.
[2020-10-16 12:10:36,669 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:36,669 INFO  L93              Difference]: Finished difference Result 826 states and 2363 transitions.
[2020-10-16 12:10:36,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-16 12:10:36,670 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 16
[2020-10-16 12:10:36,670 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:36,676 INFO  L225             Difference]: With dead ends: 826
[2020-10-16 12:10:36,677 INFO  L226             Difference]: Without dead ends: 790
[2020-10-16 12:10:36,678 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182
[2020-10-16 12:10:36,681 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 790 states.
[2020-10-16 12:10:36,694 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 446.
[2020-10-16 12:10:36,694 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 446 states.
[2020-10-16 12:10:36,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1273 transitions.
[2020-10-16 12:10:36,697 INFO  L78                 Accepts]: Start accepts. Automaton has 446 states and 1273 transitions. Word has length 16
[2020-10-16 12:10:36,697 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:36,698 INFO  L481      AbstractCegarLoop]: Abstraction has 446 states and 1273 transitions.
[2020-10-16 12:10:36,698 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 12:10:36,698 INFO  L276                IsEmpty]: Start isEmpty. Operand 446 states and 1273 transitions.
[2020-10-16 12:10:36,699 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 12:10:36,699 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:36,700 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:36,700 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 12:10:36,700 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-16 12:10:36,700 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:36,701 INFO  L82        PathProgramCache]: Analyzing trace with hash 452774403, now seen corresponding path program 1 times
[2020-10-16 12:10:36,701 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:36,701 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617400405]
[2020-10-16 12:10:36,701 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:36,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:36,874 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:36,874 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617400405]
[2020-10-16 12:10:36,874 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:36,875 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:10:36,875 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111862243]
[2020-10-16 12:10:36,875 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:10:36,876 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:36,876 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:10:36,876 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:10:36,876 INFO  L87              Difference]: Start difference. First operand 446 states and 1273 transitions. Second operand 4 states.
[2020-10-16 12:10:36,908 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:36,908 INFO  L93              Difference]: Finished difference Result 428 states and 1092 transitions.
[2020-10-16 12:10:36,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:10:36,909 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2020-10-16 12:10:36,909 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:36,911 INFO  L225             Difference]: With dead ends: 428
[2020-10-16 12:10:36,912 INFO  L226             Difference]: Without dead ends: 326
[2020-10-16 12:10:36,912 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:10:36,914 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 326 states.
[2020-10-16 12:10:36,920 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326.
[2020-10-16 12:10:36,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 326 states.
[2020-10-16 12:10:36,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 813 transitions.
[2020-10-16 12:10:36,922 INFO  L78                 Accepts]: Start accepts. Automaton has 326 states and 813 transitions. Word has length 17
[2020-10-16 12:10:36,922 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:36,922 INFO  L481      AbstractCegarLoop]: Abstraction has 326 states and 813 transitions.
[2020-10-16 12:10:36,922 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:10:36,922 INFO  L276                IsEmpty]: Start isEmpty. Operand 326 states and 813 transitions.
[2020-10-16 12:10:36,923 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 12:10:36,923 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:36,924 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:36,924 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 12:10:36,924 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-16 12:10:36,924 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:36,924 INFO  L82        PathProgramCache]: Analyzing trace with hash -1797287306, now seen corresponding path program 1 times
[2020-10-16 12:10:36,925 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:36,925 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833440145]
[2020-10-16 12:10:36,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:36,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:37,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:37,058 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833440145]
[2020-10-16 12:10:37,059 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:37,059 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:10:37,059 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221669214]
[2020-10-16 12:10:37,060 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:10:37,060 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:37,060 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:10:37,061 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:10:37,061 INFO  L87              Difference]: Start difference. First operand 326 states and 813 transitions. Second operand 5 states.
[2020-10-16 12:10:37,110 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:37,111 INFO  L93              Difference]: Finished difference Result 268 states and 616 transitions.
[2020-10-16 12:10:37,112 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 12:10:37,112 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2020-10-16 12:10:37,112 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:37,114 INFO  L225             Difference]: With dead ends: 268
[2020-10-16 12:10:37,114 INFO  L226             Difference]: Without dead ends: 216
[2020-10-16 12:10:37,115 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:10:37,116 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 216 states.
[2020-10-16 12:10:37,122 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216.
[2020-10-16 12:10:37,122 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 216 states.
[2020-10-16 12:10:37,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 487 transitions.
[2020-10-16 12:10:37,124 INFO  L78                 Accepts]: Start accepts. Automaton has 216 states and 487 transitions. Word has length 18
[2020-10-16 12:10:37,125 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:37,125 INFO  L481      AbstractCegarLoop]: Abstraction has 216 states and 487 transitions.
[2020-10-16 12:10:37,125 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:10:37,125 INFO  L276                IsEmpty]: Start isEmpty. Operand 216 states and 487 transitions.
[2020-10-16 12:10:37,126 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 12:10:37,126 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:37,127 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]
[2020-10-16 12:10:37,127 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 12:10:37,127 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-16 12:10:37,127 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:37,128 INFO  L82        PathProgramCache]: Analyzing trace with hash -897419567, now seen corresponding path program 1 times
[2020-10-16 12:10:37,128 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:37,128 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076529913]
[2020-10-16 12:10:37,128 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:37,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:37,308 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:37,393 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076529913]
[2020-10-16 12:10:37,393 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:37,393 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:10:37,394 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189065202]
[2020-10-16 12:10:37,394 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:10:37,395 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:37,395 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:10:37,395 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:10:37,395 INFO  L87              Difference]: Start difference. First operand 216 states and 487 transitions. Second operand 6 states.
[2020-10-16 12:10:37,457 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:37,457 INFO  L93              Difference]: Finished difference Result 192 states and 437 transitions.
[2020-10-16 12:10:37,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 12:10:37,458 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 20
[2020-10-16 12:10:37,458 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:37,460 INFO  L225             Difference]: With dead ends: 192
[2020-10-16 12:10:37,460 INFO  L226             Difference]: Without dead ends: 180
[2020-10-16 12:10:37,460 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:10:37,462 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 180 states.
[2020-10-16 12:10:37,465 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180.
[2020-10-16 12:10:37,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 180 states.
[2020-10-16 12:10:37,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 415 transitions.
[2020-10-16 12:10:37,467 INFO  L78                 Accepts]: Start accepts. Automaton has 180 states and 415 transitions. Word has length 20
[2020-10-16 12:10:37,467 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:37,467 INFO  L481      AbstractCegarLoop]: Abstraction has 180 states and 415 transitions.
[2020-10-16 12:10:37,467 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:10:37,467 INFO  L276                IsEmpty]: Start isEmpty. Operand 180 states and 415 transitions.
[2020-10-16 12:10:37,468 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:37,468 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:37,469 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:37,469 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 12:10:37,469 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-16 12:10:37,469 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:37,469 INFO  L82        PathProgramCache]: Analyzing trace with hash -48895144, now seen corresponding path program 1 times
[2020-10-16 12:10:37,473 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:37,474 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025909022]
[2020-10-16 12:10:37,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:37,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:37,761 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:37,762 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025909022]
[2020-10-16 12:10:37,762 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:37,762 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:10:37,763 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334919915]
[2020-10-16 12:10:37,763 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 12:10:37,764 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:37,764 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 12:10:37,764 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:10:37,764 INFO  L87              Difference]: Start difference. First operand 180 states and 415 transitions. Second operand 7 states.
[2020-10-16 12:10:38,048 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:38,048 INFO  L93              Difference]: Finished difference Result 361 states and 806 transitions.
[2020-10-16 12:10:38,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 12:10:38,049 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 23
[2020-10-16 12:10:38,049 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:38,051 INFO  L225             Difference]: With dead ends: 361
[2020-10-16 12:10:38,051 INFO  L226             Difference]: Without dead ends: 275
[2020-10-16 12:10:38,051 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2020-10-16 12:10:38,052 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 275 states.
[2020-10-16 12:10:38,058 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 232.
[2020-10-16 12:10:38,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 232 states.
[2020-10-16 12:10:38,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 532 transitions.
[2020-10-16 12:10:38,059 INFO  L78                 Accepts]: Start accepts. Automaton has 232 states and 532 transitions. Word has length 23
[2020-10-16 12:10:38,059 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:38,059 INFO  L481      AbstractCegarLoop]: Abstraction has 232 states and 532 transitions.
[2020-10-16 12:10:38,060 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 12:10:38,060 INFO  L276                IsEmpty]: Start isEmpty. Operand 232 states and 532 transitions.
[2020-10-16 12:10:38,060 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:38,061 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:38,061 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:38,061 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 12:10:38,061 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:38,061 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:38,062 INFO  L82        PathProgramCache]: Analyzing trace with hash 1940087594, now seen corresponding path program 2 times
[2020-10-16 12:10:38,062 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:38,062 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120115705]
[2020-10-16 12:10:38,062 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:38,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:38,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:38,540 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120115705]
[2020-10-16 12:10:38,541 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:38,541 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-10-16 12:10:38,541 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339224926]
[2020-10-16 12:10:38,541 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-10-16 12:10:38,542 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:38,542 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-10-16 12:10:38,542 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2020-10-16 12:10:38,542 INFO  L87              Difference]: Start difference. First operand 232 states and 532 transitions. Second operand 12 states.
[2020-10-16 12:10:39,090 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:39,091 INFO  L93              Difference]: Finished difference Result 251 states and 556 transitions.
[2020-10-16 12:10:39,091 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-10-16 12:10:39,091 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 23
[2020-10-16 12:10:39,092 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:39,093 INFO  L225             Difference]: With dead ends: 251
[2020-10-16 12:10:39,093 INFO  L226             Difference]: Without dead ends: 227
[2020-10-16 12:10:39,094 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272
[2020-10-16 12:10:39,095 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 227 states.
[2020-10-16 12:10:39,099 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227.
[2020-10-16 12:10:39,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 227 states.
[2020-10-16 12:10:39,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 520 transitions.
[2020-10-16 12:10:39,101 INFO  L78                 Accepts]: Start accepts. Automaton has 227 states and 520 transitions. Word has length 23
[2020-10-16 12:10:39,101 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:39,101 INFO  L481      AbstractCegarLoop]: Abstraction has 227 states and 520 transitions.
[2020-10-16 12:10:39,101 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-10-16 12:10:39,102 INFO  L276                IsEmpty]: Start isEmpty. Operand 227 states and 520 transitions.
[2020-10-16 12:10:39,103 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:39,103 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:39,103 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:39,103 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 12:10:39,103 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:39,103 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:39,104 INFO  L82        PathProgramCache]: Analyzing trace with hash 1385413476, now seen corresponding path program 3 times
[2020-10-16 12:10:39,104 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:39,104 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571126958]
[2020-10-16 12:10:39,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:39,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:39,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:39,665 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571126958]
[2020-10-16 12:10:39,665 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:39,665 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-10-16 12:10:39,666 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936447698]
[2020-10-16 12:10:39,666 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-10-16 12:10:39,666 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:39,666 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-10-16 12:10:39,667 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2020-10-16 12:10:39,667 INFO  L87              Difference]: Start difference. First operand 227 states and 520 transitions. Second operand 12 states.
[2020-10-16 12:10:40,402 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:40,402 INFO  L93              Difference]: Finished difference Result 302 states and 661 transitions.
[2020-10-16 12:10:40,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-10-16 12:10:40,403 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 23
[2020-10-16 12:10:40,403 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:40,405 INFO  L225             Difference]: With dead ends: 302
[2020-10-16 12:10:40,405 INFO  L226             Difference]: Without dead ends: 233
[2020-10-16 12:10:40,405 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306
[2020-10-16 12:10:40,407 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 233 states.
[2020-10-16 12:10:40,411 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 208.
[2020-10-16 12:10:40,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 208 states.
[2020-10-16 12:10:40,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 482 transitions.
[2020-10-16 12:10:40,412 INFO  L78                 Accepts]: Start accepts. Automaton has 208 states and 482 transitions. Word has length 23
[2020-10-16 12:10:40,413 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:40,413 INFO  L481      AbstractCegarLoop]: Abstraction has 208 states and 482 transitions.
[2020-10-16 12:10:40,413 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-10-16 12:10:40,413 INFO  L276                IsEmpty]: Start isEmpty. Operand 208 states and 482 transitions.
[2020-10-16 12:10:40,414 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:40,414 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:40,414 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:40,414 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 12:10:40,414 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:40,415 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:40,415 INFO  L82        PathProgramCache]: Analyzing trace with hash -1638973074, now seen corresponding path program 4 times
[2020-10-16 12:10:40,415 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:40,415 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965304295]
[2020-10-16 12:10:40,415 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:40,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:40,812 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:40,812 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965304295]
[2020-10-16 12:10:40,812 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:40,813 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 12:10:40,813 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408480984]
[2020-10-16 12:10:40,813 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 12:10:40,813 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:40,814 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 12:10:40,814 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:10:40,814 INFO  L87              Difference]: Start difference. First operand 208 states and 482 transitions. Second operand 8 states.
[2020-10-16 12:10:41,506 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:41,506 INFO  L93              Difference]: Finished difference Result 256 states and 581 transitions.
[2020-10-16 12:10:41,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-16 12:10:41,507 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 23
[2020-10-16 12:10:41,507 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:41,509 INFO  L225             Difference]: With dead ends: 256
[2020-10-16 12:10:41,509 INFO  L226             Difference]: Without dead ends: 217
[2020-10-16 12:10:41,510 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156
[2020-10-16 12:10:41,511 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 217 states.
[2020-10-16 12:10:41,515 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 184.
[2020-10-16 12:10:41,516 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 184 states.
[2020-10-16 12:10:41,516 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 412 transitions.
[2020-10-16 12:10:41,517 INFO  L78                 Accepts]: Start accepts. Automaton has 184 states and 412 transitions. Word has length 23
[2020-10-16 12:10:41,517 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:41,517 INFO  L481      AbstractCegarLoop]: Abstraction has 184 states and 412 transitions.
[2020-10-16 12:10:41,517 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 12:10:41,517 INFO  L276                IsEmpty]: Start isEmpty. Operand 184 states and 412 transitions.
[2020-10-16 12:10:41,518 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:41,518 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:41,518 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:41,518 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 12:10:41,519 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:41,519 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:41,519 INFO  L82        PathProgramCache]: Analyzing trace with hash 350009664, now seen corresponding path program 5 times
[2020-10-16 12:10:41,519 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:41,520 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565301709]
[2020-10-16 12:10:41,520 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:41,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:41,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:41,876 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565301709]
[2020-10-16 12:10:41,876 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:41,876 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-16 12:10:41,877 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673319561]
[2020-10-16 12:10:41,877 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-16 12:10:41,877 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:41,878 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-16 12:10:41,878 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2020-10-16 12:10:41,878 INFO  L87              Difference]: Start difference. First operand 184 states and 412 transitions. Second operand 10 states.
[2020-10-16 12:10:42,645 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:42,645 INFO  L93              Difference]: Finished difference Result 302 states and 677 transitions.
[2020-10-16 12:10:42,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-10-16 12:10:42,646 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 23
[2020-10-16 12:10:42,646 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:42,648 INFO  L225             Difference]: With dead ends: 302
[2020-10-16 12:10:42,648 INFO  L226             Difference]: Without dead ends: 240
[2020-10-16 12:10:42,648 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420
[2020-10-16 12:10:42,649 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 240 states.
[2020-10-16 12:10:42,653 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 179.
[2020-10-16 12:10:42,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 179 states.
[2020-10-16 12:10:42,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 404 transitions.
[2020-10-16 12:10:42,654 INFO  L78                 Accepts]: Start accepts. Automaton has 179 states and 404 transitions. Word has length 23
[2020-10-16 12:10:42,655 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:42,655 INFO  L481      AbstractCegarLoop]: Abstraction has 179 states and 404 transitions.
[2020-10-16 12:10:42,655 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-16 12:10:42,655 INFO  L276                IsEmpty]: Start isEmpty. Operand 179 states and 404 transitions.
[2020-10-16 12:10:42,656 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:42,656 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:42,656 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:42,656 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 12:10:42,656 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:42,656 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:42,657 INFO  L82        PathProgramCache]: Analyzing trace with hash -2016675130, now seen corresponding path program 6 times
[2020-10-16 12:10:42,657 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:42,657 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748737372]
[2020-10-16 12:10:42,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:42,730 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:43,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:43,060 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748737372]
[2020-10-16 12:10:43,060 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:43,060 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-16 12:10:43,061 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805600813]
[2020-10-16 12:10:43,061 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-16 12:10:43,061 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:43,062 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-16 12:10:43,062 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2020-10-16 12:10:43,062 INFO  L87              Difference]: Start difference. First operand 179 states and 404 transitions. Second operand 10 states.
[2020-10-16 12:10:43,495 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:43,495 INFO  L93              Difference]: Finished difference Result 268 states and 586 transitions.
[2020-10-16 12:10:43,496 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-10-16 12:10:43,496 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 23
[2020-10-16 12:10:43,496 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:43,497 INFO  L225             Difference]: With dead ends: 268
[2020-10-16 12:10:43,497 INFO  L226             Difference]: Without dead ends: 212
[2020-10-16 12:10:43,498 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240
[2020-10-16 12:10:43,499 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 212 states.
[2020-10-16 12:10:43,502 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 172.
[2020-10-16 12:10:43,503 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 172 states.
[2020-10-16 12:10:43,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 378 transitions.
[2020-10-16 12:10:43,504 INFO  L78                 Accepts]: Start accepts. Automaton has 172 states and 378 transitions. Word has length 23
[2020-10-16 12:10:43,504 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:43,504 INFO  L481      AbstractCegarLoop]: Abstraction has 172 states and 378 transitions.
[2020-10-16 12:10:43,504 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-16 12:10:43,504 INFO  L276                IsEmpty]: Start isEmpty. Operand 172 states and 378 transitions.
[2020-10-16 12:10:43,505 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:43,505 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:43,505 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:43,505 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 12:10:43,505 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:43,505 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:43,506 INFO  L82        PathProgramCache]: Analyzing trace with hash 159750070, now seen corresponding path program 7 times
[2020-10-16 12:10:43,506 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:43,506 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757011863]
[2020-10-16 12:10:43,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:43,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:43,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:43,926 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757011863]
[2020-10-16 12:10:43,926 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:43,926 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-10-16 12:10:43,926 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344964576]
[2020-10-16 12:10:43,928 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-10-16 12:10:43,929 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:43,929 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-10-16 12:10:43,930 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2020-10-16 12:10:43,930 INFO  L87              Difference]: Start difference. First operand 172 states and 378 transitions. Second operand 11 states.
[2020-10-16 12:10:44,739 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:44,739 INFO  L93              Difference]: Finished difference Result 196 states and 413 transitions.
[2020-10-16 12:10:44,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-10-16 12:10:44,740 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 23
[2020-10-16 12:10:44,740 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:44,741 INFO  L225             Difference]: With dead ends: 196
[2020-10-16 12:10:44,741 INFO  L226             Difference]: Without dead ends: 176
[2020-10-16 12:10:44,742 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272
[2020-10-16 12:10:44,743 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 176 states.
[2020-10-16 12:10:44,746 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168.
[2020-10-16 12:10:44,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 168 states.
[2020-10-16 12:10:44,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 363 transitions.
[2020-10-16 12:10:44,747 INFO  L78                 Accepts]: Start accepts. Automaton has 168 states and 363 transitions. Word has length 23
[2020-10-16 12:10:44,747 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:44,747 INFO  L481      AbstractCegarLoop]: Abstraction has 168 states and 363 transitions.
[2020-10-16 12:10:44,747 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-10-16 12:10:44,747 INFO  L276                IsEmpty]: Start isEmpty. Operand 168 states and 363 transitions.
[2020-10-16 12:10:44,748 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:44,748 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:44,748 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:44,748 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 12:10:44,749 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:44,749 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:44,749 INFO  L82        PathProgramCache]: Analyzing trace with hash -47669674, now seen corresponding path program 8 times
[2020-10-16 12:10:44,749 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:44,749 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799562392]
[2020-10-16 12:10:44,750 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:44,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:45,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:45,032 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799562392]
[2020-10-16 12:10:45,032 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:45,032 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-16 12:10:45,033 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11319230]
[2020-10-16 12:10:45,033 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-16 12:10:45,033 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:45,033 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-16 12:10:45,034 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2020-10-16 12:10:45,034 INFO  L87              Difference]: Start difference. First operand 168 states and 363 transitions. Second operand 10 states.
[2020-10-16 12:10:45,445 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:45,445 INFO  L93              Difference]: Finished difference Result 321 states and 685 transitions.
[2020-10-16 12:10:45,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-10-16 12:10:45,445 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 23
[2020-10-16 12:10:45,445 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:45,447 INFO  L225             Difference]: With dead ends: 321
[2020-10-16 12:10:45,447 INFO  L226             Difference]: Without dead ends: 258
[2020-10-16 12:10:45,448 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240
[2020-10-16 12:10:45,449 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 258 states.
[2020-10-16 12:10:45,457 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 186.
[2020-10-16 12:10:45,457 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 186 states.
[2020-10-16 12:10:45,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 404 transitions.
[2020-10-16 12:10:45,458 INFO  L78                 Accepts]: Start accepts. Automaton has 186 states and 404 transitions. Word has length 23
[2020-10-16 12:10:45,458 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:45,458 INFO  L481      AbstractCegarLoop]: Abstraction has 186 states and 404 transitions.
[2020-10-16 12:10:45,458 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-16 12:10:45,459 INFO  L276                IsEmpty]: Start isEmpty. Operand 186 states and 404 transitions.
[2020-10-16 12:10:45,459 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:45,459 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:45,459 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:45,460 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 12:10:45,460 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:45,460 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:45,460 INFO  L82        PathProgramCache]: Analyzing trace with hash -2128492446, now seen corresponding path program 9 times
[2020-10-16 12:10:45,460 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:45,460 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80144087]
[2020-10-16 12:10:45,461 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:45,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:45,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:45,658 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80144087]
[2020-10-16 12:10:45,659 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:45,659 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 12:10:45,659 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230649367]
[2020-10-16 12:10:45,659 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 12:10:45,659 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:45,660 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 12:10:45,660 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:10:45,660 INFO  L87              Difference]: Start difference. First operand 186 states and 404 transitions. Second operand 8 states.
[2020-10-16 12:10:45,864 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:45,865 INFO  L93              Difference]: Finished difference Result 251 states and 535 transitions.
[2020-10-16 12:10:45,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 12:10:45,865 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 23
[2020-10-16 12:10:45,865 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:45,866 INFO  L225             Difference]: With dead ends: 251
[2020-10-16 12:10:45,866 INFO  L226             Difference]: Without dead ends: 156
[2020-10-16 12:10:45,867 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2020-10-16 12:10:45,867 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2020-10-16 12:10:45,870 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147.
[2020-10-16 12:10:45,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2020-10-16 12:10:45,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 319 transitions.
[2020-10-16 12:10:45,870 INFO  L78                 Accepts]: Start accepts. Automaton has 147 states and 319 transitions. Word has length 23
[2020-10-16 12:10:45,871 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:45,871 INFO  L481      AbstractCegarLoop]: Abstraction has 147 states and 319 transitions.
[2020-10-16 12:10:45,871 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 12:10:45,871 INFO  L276                IsEmpty]: Start isEmpty. Operand 147 states and 319 transitions.
[2020-10-16 12:10:45,871 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:45,871 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:45,872 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:45,872 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-16 12:10:45,872 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:45,872 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:45,872 INFO  L82        PathProgramCache]: Analyzing trace with hash 73183318, now seen corresponding path program 10 times
[2020-10-16 12:10:45,872 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:45,873 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938938611]
[2020-10-16 12:10:45,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:45,917 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:46,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:46,450 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938938611]
[2020-10-16 12:10:46,450 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:46,450 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2020-10-16 12:10:46,450 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251244089]
[2020-10-16 12:10:46,451 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 14 states
[2020-10-16 12:10:46,451 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:46,451 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2020-10-16 12:10:46,451 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2020-10-16 12:10:46,452 INFO  L87              Difference]: Start difference. First operand 147 states and 319 transitions. Second operand 14 states.
[2020-10-16 12:10:47,588 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:47,588 INFO  L93              Difference]: Finished difference Result 239 states and 519 transitions.
[2020-10-16 12:10:47,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-10-16 12:10:47,589 INFO  L78                 Accepts]: Start accepts. Automaton has 14 states. Word has length 23
[2020-10-16 12:10:47,589 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:47,590 INFO  L225             Difference]: With dead ends: 239
[2020-10-16 12:10:47,590 INFO  L226             Difference]: Without dead ends: 157
[2020-10-16 12:10:47,591 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462
[2020-10-16 12:10:47,592 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 157 states.
[2020-10-16 12:10:47,594 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 118.
[2020-10-16 12:10:47,594 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 118 states.
[2020-10-16 12:10:47,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 251 transitions.
[2020-10-16 12:10:47,595 INFO  L78                 Accepts]: Start accepts. Automaton has 118 states and 251 transitions. Word has length 23
[2020-10-16 12:10:47,595 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:47,595 INFO  L481      AbstractCegarLoop]: Abstraction has 118 states and 251 transitions.
[2020-10-16 12:10:47,595 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 14 states.
[2020-10-16 12:10:47,595 INFO  L276                IsEmpty]: Start isEmpty. Operand 118 states and 251 transitions.
[2020-10-16 12:10:47,596 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:47,596 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:47,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, 1, 1]
[2020-10-16 12:10:47,596 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-16 12:10:47,596 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:47,596 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:47,597 INFO  L82        PathProgramCache]: Analyzing trace with hash 482772274, now seen corresponding path program 11 times
[2020-10-16 12:10:47,597 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:47,597 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304285895]
[2020-10-16 12:10:47,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:47,646 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:47,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:47,810 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304285895]
[2020-10-16 12:10:47,811 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:47,811 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 12:10:47,811 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109048076]
[2020-10-16 12:10:47,811 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 12:10:47,812 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:47,812 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 12:10:47,812 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:10:47,812 INFO  L87              Difference]: Start difference. First operand 118 states and 251 transitions. Second operand 8 states.
[2020-10-16 12:10:48,085 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:48,085 INFO  L93              Difference]: Finished difference Result 153 states and 312 transitions.
[2020-10-16 12:10:48,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 12:10:48,086 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 23
[2020-10-16 12:10:48,086 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:48,087 INFO  L225             Difference]: With dead ends: 153
[2020-10-16 12:10:48,087 INFO  L226             Difference]: Without dead ends: 118
[2020-10-16 12:10:48,088 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2020-10-16 12:10:48,089 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2020-10-16 12:10:48,091 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118.
[2020-10-16 12:10:48,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 118 states.
[2020-10-16 12:10:48,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 247 transitions.
[2020-10-16 12:10:48,092 INFO  L78                 Accepts]: Start accepts. Automaton has 118 states and 247 transitions. Word has length 23
[2020-10-16 12:10:48,092 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:48,093 INFO  L481      AbstractCegarLoop]: Abstraction has 118 states and 247 transitions.
[2020-10-16 12:10:48,093 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 12:10:48,093 INFO  L276                IsEmpty]: Start isEmpty. Operand 118 states and 247 transitions.
[2020-10-16 12:10:48,093 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:48,093 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:48,094 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:48,094 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-16 12:10:48,094 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:48,094 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:48,094 INFO  L82        PathProgramCache]: Analyzing trace with hash -38633998, now seen corresponding path program 12 times
[2020-10-16 12:10:48,094 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:48,095 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822494203]
[2020-10-16 12:10:48,095 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:48,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:48,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:48,286 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822494203]
[2020-10-16 12:10:48,286 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:48,286 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 12:10:48,286 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262094427]
[2020-10-16 12:10:48,287 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 12:10:48,287 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:48,287 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 12:10:48,287 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:10:48,287 INFO  L87              Difference]: Start difference. First operand 118 states and 247 transitions. Second operand 8 states.
[2020-10-16 12:10:48,540 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:48,541 INFO  L93              Difference]: Finished difference Result 236 states and 480 transitions.
[2020-10-16 12:10:48,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 12:10:48,541 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 23
[2020-10-16 12:10:48,541 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:48,542 INFO  L225             Difference]: With dead ends: 236
[2020-10-16 12:10:48,542 INFO  L226             Difference]: Without dead ends: 126
[2020-10-16 12:10:48,543 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2020-10-16 12:10:48,544 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2020-10-16 12:10:48,547 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95.
[2020-10-16 12:10:48,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 95 states.
[2020-10-16 12:10:48,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 188 transitions.
[2020-10-16 12:10:48,549 INFO  L78                 Accepts]: Start accepts. Automaton has 95 states and 188 transitions. Word has length 23
[2020-10-16 12:10:48,549 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:48,549 INFO  L481      AbstractCegarLoop]: Abstraction has 95 states and 188 transitions.
[2020-10-16 12:10:48,549 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 12:10:48,549 INFO  L276                IsEmpty]: Start isEmpty. Operand 95 states and 188 transitions.
[2020-10-16 12:10:48,550 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:48,550 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:48,550 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:48,550 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-10-16 12:10:48,550 INFO  L429      AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:48,551 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:48,551 INFO  L82        PathProgramCache]: Analyzing trace with hash 1371474576, now seen corresponding path program 13 times
[2020-10-16 12:10:48,552 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:48,552 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598067849]
[2020-10-16 12:10:48,552 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:48,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:10:48,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:10:48,820 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598067849]
[2020-10-16 12:10:48,820 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:10:48,820 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 12:10:48,820 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70422460]
[2020-10-16 12:10:48,821 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 12:10:48,822 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:10:48,822 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 12:10:48,822 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:10:48,823 INFO  L87              Difference]: Start difference. First operand 95 states and 188 transitions. Second operand 8 states.
[2020-10-16 12:10:49,010 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:10:49,010 INFO  L93              Difference]: Finished difference Result 122 states and 237 transitions.
[2020-10-16 12:10:49,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 12:10:49,011 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 23
[2020-10-16 12:10:49,011 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:10:49,011 INFO  L225             Difference]: With dead ends: 122
[2020-10-16 12:10:49,011 INFO  L226             Difference]: Without dead ends: 72
[2020-10-16 12:10:49,012 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2020-10-16 12:10:49,012 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2020-10-16 12:10:49,013 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72.
[2020-10-16 12:10:49,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 72 states.
[2020-10-16 12:10:49,014 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 139 transitions.
[2020-10-16 12:10:49,014 INFO  L78                 Accepts]: Start accepts. Automaton has 72 states and 139 transitions. Word has length 23
[2020-10-16 12:10:49,014 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:10:49,014 INFO  L481      AbstractCegarLoop]: Abstraction has 72 states and 139 transitions.
[2020-10-16 12:10:49,014 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 12:10:49,015 INFO  L276                IsEmpty]: Start isEmpty. Operand 72 states and 139 transitions.
[2020-10-16 12:10:49,015 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:10:49,015 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:10:49,015 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:10:49,015 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-10-16 12:10:49,015 INFO  L429      AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:10:49,016 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:10:49,016 INFO  L82        PathProgramCache]: Analyzing trace with hash -725561230, now seen corresponding path program 14 times
[2020-10-16 12:10:49,016 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:10:49,016 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759990633]
[2020-10-16 12:10:49,016 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:10:49,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 12:10:49,093 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 12:10:49,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 12:10:49,186 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 12:10:49,228 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 12:10:49,228 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 12:10:49,228 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2020-10-16 12:10:49,253 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,253 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,255 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,255 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,256 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,256 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,256 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,256 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,256 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,256 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,257 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,257 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,257 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,257 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,257 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,257 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,258 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,258 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,258 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,258 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,258 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,259 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,259 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,259 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,259 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,259 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,259 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,260 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,260 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,260 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,260 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,260 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,260 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,261 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,261 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,261 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,261 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,262 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,262 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,262 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,262 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,262 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,262 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,263 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,263 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,263 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,263 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,263 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,264 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,264 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,264 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,264 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,264 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,264 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,264 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,265 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,265 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,265 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,265 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,265 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,266 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,266 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,266 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,266 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,266 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,266 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,267 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,267 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,267 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,267 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,267 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,267 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,267 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,268 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,268 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,268 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,268 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,268 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,268 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,269 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,269 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,269 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,269 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,269 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,269 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,269 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,269 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,270 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,270 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,270 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,270 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,271 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,271 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,271 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,271 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,271 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,271 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,271 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,272 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,272 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,272 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,272 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,272 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,272 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,273 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,273 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,273 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,273 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,273 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,273 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,274 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,274 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,274 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,274 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,274 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,274 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,275 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,275 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,275 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,275 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,275 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,275 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,276 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:10:49,276 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:10:49,342 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:10:49 BasicIcfg
[2020-10-16 12:10:49,342 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 12:10:49,344 INFO  L168              Benchmark]: Toolchain (without parser) took 22743.10 ms. Allocated memory was 140.5 MB in the beginning and 546.3 MB in the end (delta: 405.8 MB). Free memory was 101.4 MB in the beginning and 123.0 MB in the end (delta: -21.6 MB). Peak memory consumption was 384.2 MB. Max. memory is 7.1 GB.
[2020-10-16 12:10:49,345 INFO  L168              Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.6 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB.
[2020-10-16 12:10:49,346 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 905.45 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 153.9 MB in the end (delta: -52.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB.
[2020-10-16 12:10:49,346 INFO  L168              Benchmark]: Boogie Procedure Inliner took 121.79 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
[2020-10-16 12:10:49,347 INFO  L168              Benchmark]: Boogie Preprocessor took 103.26 ms. Allocated memory is still 203.9 MB. Free memory was 151.1 MB in the beginning and 147.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB.
[2020-10-16 12:10:49,347 INFO  L168              Benchmark]: RCFGBuilder took 3724.86 ms. Allocated memory was 203.9 MB in the beginning and 292.0 MB in the end (delta: 88.1 MB). Free memory was 147.0 MB in the beginning and 203.1 MB in the end (delta: -56.1 MB). Peak memory consumption was 102.3 MB. Max. memory is 7.1 GB.
[2020-10-16 12:10:49,348 INFO  L168              Benchmark]: TraceAbstraction took 17881.25 ms. Allocated memory was 292.0 MB in the beginning and 546.3 MB in the end (delta: 254.3 MB). Free memory was 203.1 MB in the beginning and 123.0 MB in the end (delta: 80.1 MB). Peak memory consumption was 334.4 MB. Max. memory is 7.1 GB.
[2020-10-16 12:10:49,351 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.50 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.6 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 905.45 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 153.9 MB in the end (delta: -52.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 121.79 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 103.26 ms. Allocated memory is still 203.9 MB. Free memory was 151.1 MB in the beginning and 147.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 3724.86 ms. Allocated memory was 203.9 MB in the beginning and 292.0 MB in the end (delta: 88.1 MB). Free memory was 147.0 MB in the beginning and 203.1 MB in the end (delta: -56.1 MB). Peak memory consumption was 102.3 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 17881.25 ms. Allocated memory was 292.0 MB in the beginning and 546.3 MB in the end (delta: 254.3 MB). Free memory was 203.1 MB in the beginning and 123.0 MB in the end (delta: 80.1 MB). Peak memory consumption was 334.4 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    794 VarBasedMoverChecksPositive, 26 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 67 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.6s, 102 PlacesBefore, 39 PlacesAfterwards, 94 TransitionsBefore, 30 TransitionsAfterwards, 1740 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 6058 MoverChecksTotal
  - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p0_EAX = 0;
[L703]               0  int __unbuffered_p2_EAX = 0;
[L705]               0  int __unbuffered_p2_EBX = 0;
[L706]               0  _Bool main$tmp_guard0;
[L707]               0  _Bool main$tmp_guard1;
[L709]               0  int x = 0;
[L711]               0  int y = 0;
[L712]               0  _Bool y$flush_delayed;
[L713]               0  int y$mem_tmp;
[L714]               0  _Bool y$r_buff0_thd0;
[L715]               0  _Bool y$r_buff0_thd1;
[L716]               0  _Bool y$r_buff0_thd2;
[L717]               0  _Bool y$r_buff0_thd3;
[L718]               0  _Bool y$r_buff1_thd0;
[L719]               0  _Bool y$r_buff1_thd1;
[L720]               0  _Bool y$r_buff1_thd2;
[L721]               0  _Bool y$r_buff1_thd3;
[L722]               0  _Bool y$read_delayed;
[L723]               0  int *y$read_delayed_var;
[L724]               0  int y$w_buff0;
[L725]               0  _Bool y$w_buff0_used;
[L726]               0  int y$w_buff1;
[L727]               0  _Bool y$w_buff1_used;
[L728]               0  _Bool weak$$choice0;
[L729]               0  _Bool weak$$choice2;
[L843]               0  pthread_t t2330;
[L844]  FCALL, FORK  0  pthread_create(&t2330, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L845]               0  pthread_t t2331;
[L846]  FCALL, FORK  0  pthread_create(&t2331, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L773]               2  y$w_buff1 = y$w_buff0
[L774]               2  y$w_buff0 = 2
[L775]               2  y$w_buff1_used = y$w_buff0_used
[L776]               2  y$w_buff0_used = (_Bool)1
[L8]    COND FALSE   2  !(!expression)
[L778]               2  y$r_buff1_thd0 = y$r_buff0_thd0
[L779]               2  y$r_buff1_thd1 = y$r_buff0_thd1
[L780]               2  y$r_buff1_thd2 = y$r_buff0_thd2
[L781]               2  y$r_buff1_thd3 = y$r_buff0_thd3
[L782]               2  y$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L785]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L847]               0  pthread_t t2332;
[L848]  FCALL, FORK  0  pthread_create(&t2332, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L802]               3  __unbuffered_p2_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L805]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L806]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L807]               3  y$flush_delayed = weak$$choice2
[L808]               3  y$mem_tmp = y
[L809]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L809]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L810]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L810]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L811]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L811]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L812]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L812]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L812]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L812]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L813]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L813]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L814]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L814]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L815]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L815]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L815]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L815]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L816]               3  __unbuffered_p2_EBX = y
[L817]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L817]               3  y = y$flush_delayed ? y$mem_tmp : y
[L818]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L821]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L821]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L821]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L821]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L822]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L822]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L823]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L823]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L824]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L824]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L825]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L825]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L733]               1  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L736]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L736]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L737]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L737]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L738]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L738]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L739]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L739]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L740]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L740]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L743]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L744]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L745]               1  y$flush_delayed = weak$$choice2
[L746]               1  y$mem_tmp = y
[L747]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1
[L747]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L747]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L748]  EXPR         1  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L748]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L749]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L749]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)
[L749]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L749]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L750]  EXPR         1  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L750]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)
[L750]  EXPR         1  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L750]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L751]  EXPR         1  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L751]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L752]  EXPR         1  weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L752]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L753]  EXPR         1  weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L753]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L753]  EXPR         1  weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L753]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L754]               1  __unbuffered_p0_EAX = y
[L755]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L755]               1  y = y$flush_delayed ? y$mem_tmp : y
[L756]               1  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L759]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L759]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L760]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L760]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L761]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L761]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L762]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L762]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L763]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L763]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L766]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L768]               1  return 0;
[L788]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L788]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L789]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L789]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L790]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L790]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L791]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L791]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L792]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L792]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L795]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L797]               2  return 0;
[L828]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L830]               3  return 0;
[L850]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L4]    COND FALSE   0  !(!cond)
[L854]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L854]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L855]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L855]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L856]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L856]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L857]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L857]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L858]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L858]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L861]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L862]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L863]               0  y$flush_delayed = weak$$choice2
[L864]               0  y$mem_tmp = y
[L865]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L865]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L866]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L866]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L867]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L867]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L868]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L868]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L868]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L868]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L868]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L868]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L869]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L869]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L869]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0
[L869]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L869]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L869]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L870]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L870]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L870]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L870]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L871]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L871]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L872]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L873]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L873]               0  y = y$flush_delayed ? y$mem_tmp : y
[L874]               0  y$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L8]    COND TRUE    0  !expression
[L8]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 93 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 564 SDtfs, 1022 SDslu, 1916 SDs, 0 SdLazy, 2127 SolverSat, 534 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1346occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 705 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 435 NumberOfCodeBlocks, 435 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 391 ConstructedInterpolants, 0 QuantifiedInterpolants, 93379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...