/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-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-b09bf87
[2020-10-16 13:38:16,546 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-10-16 13:38:16,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 13:38:16,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 13:38:16,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 13:38:16,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 13:38:16,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 13:38:16,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 13:38:16,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 13:38:16,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 13:38:16,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 13:38:16,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 13:38:16,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 13:38:16,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 13:38:16,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 13:38:16,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 13:38:16,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 13:38:16,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 13:38:16,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 13:38:16,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 13:38:16,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 13:38:16,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 13:38:16,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 13:38:16,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 13:38:16,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 13:38:16,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 13:38:16,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 13:38:16,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 13:38:16,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 13:38:16,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 13:38:16,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 13:38:16,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 13:38:16,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 13:38:16,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 13:38:16,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 13:38:16,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 13:38:16,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 13:38:16,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 13:38:16,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 13:38:16,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 13:38:16,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 13:38:16,605 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-McrAutomaton-WP.epf
[2020-10-16 13:38:16,629 INFO L113 SettingsManager]: Loading preferences was successful
[2020-10-16 13:38:16,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 13:38:16,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 13:38:16,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-10-16 13:38:16,630 INFO L138 SettingsManager]: * Use SBE=true
[2020-10-16 13:38:16,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 13:38:16,631 INFO L138 SettingsManager]: * sizeof long=4
[2020-10-16 13:38:16,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-10-16 13:38:16,631 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-10-16 13:38:16,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-10-16 13:38:16,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 13:38:16,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 13:38:16,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 13:38:16,632 INFO L138 SettingsManager]: * sizeof long double=12
[2020-10-16 13:38:16,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-10-16 13:38:16,632 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-10-16 13:38:16,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-10-16 13:38:16,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 13:38:16,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-10-16 13:38:16,633 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-10-16 13:38:16,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-10-16 13:38:16,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 13:38:16,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 13:38:16,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 13:38:16,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 13:38:16,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-10-16 13:38:16,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 13:38:16,635 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true
[2020-10-16 13:38:16,635 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 13:38:16,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 13:38:16,635 INFO L138 SettingsManager]: * Interpolant automaton=MCR
[2020-10-16 13:38:16,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 13:38:16,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 13:38:16,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 13:38:16,917 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-10-16 13:38:16,918 INFO L275 PluginConnector]: CDTParser initialized
[2020-10-16 13:38:16,919 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i
[2020-10-16 13:38:16,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2f0626cc1/27204070e1c748599111ba2d8aed78a7/FLAG95fc910ed
[2020-10-16 13:38:17,592 INFO L306 CDTParser]: Found 1 translation units.
[2020-10-16 13:38:17,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i
[2020-10-16 13:38:17,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2f0626cc1/27204070e1c748599111ba2d8aed78a7/FLAG95fc910ed
[2020-10-16 13:38:17,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2f0626cc1/27204070e1c748599111ba2d8aed78a7
[2020-10-16 13:38:17,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 13:38:17,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 13:38:17,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 13:38:17,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 13:38:17,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 13:38:17,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:38:17" (1/1) ...
[2020-10-16 13:38:17,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6506cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:17, skipping insertion in model container
[2020-10-16 13:38:17,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:38:17" (1/1) ...
[2020-10-16 13:38:17,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-10-16 13:38:17,930 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-10-16 13:38:18,361 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:38:18,373 INFO L203 MainTranslator]: Completed pre-run
[2020-10-16 13:38:18,436 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:38:18,535 INFO L208 MainTranslator]: Completed translation
[2020-10-16 13:38:18,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:18 WrapperNode
[2020-10-16 13:38:18,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 13:38:18,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 13:38:18,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 13:38:18,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 13:38:18,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:18" (1/1) ...
[2020-10-16 13:38:18,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:18" (1/1) ...
[2020-10-16 13:38:18,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 13:38:18,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 13:38:18,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 13:38:18,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 13:38:18,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:18" (1/1) ...
[2020-10-16 13:38:18,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:18" (1/1) ...
[2020-10-16 13:38:18,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:18" (1/1) ...
[2020-10-16 13:38:18,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:18" (1/1) ...
[2020-10-16 13:38:18,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:18" (1/1) ...
[2020-10-16 13:38:18,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:18" (1/1) ...
[2020-10-16 13:38:18,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:18" (1/1) ...
[2020-10-16 13:38:18,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 13:38:18,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 13:38:18,634 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 13:38:18,634 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-10-16 13:38:18,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:18" (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 13:38:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 13:38:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 13:38:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 13:38:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 13:38:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 13:38:18,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 13:38:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 13:38:18,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 13:38:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 13:38:18,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 13:38:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 13:38:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 13:38:18,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 13:38:18,717 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 13:38:20,639 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 13:38:20,639 INFO L298 CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 13:38:20,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:38:20 BoogieIcfgContainer
[2020-10-16 13:38:20,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 13:38:20,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 13:38:20,644 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 13:38:20,647 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-10-16 13:38:20,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:38:17" (1/3) ...
[2020-10-16 13:38:20,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:38:20, skipping insertion in model container
[2020-10-16 13:38:20,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:18" (2/3) ...
[2020-10-16 13:38:20,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:38:20, skipping insertion in model container
[2020-10-16 13:38:20,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:38:20" (3/3) ...
[2020-10-16 13:38:20,653 INFO L111 eAbstractionObserver]: Analyzing ICFG safe012_pso.opt.i
[2020-10-16 13:38:20,665 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 13:38:20,666 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 13:38:20,674 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 13:38:20,675 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 13:38:20,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,729 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,729 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,741 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,742 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,742 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,742 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,746 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,746 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,756 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,757 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,757 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,763 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,763 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,765 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,765 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,766 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,767 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:38:20,775 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 13:38:20,789 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 13:38:20,810 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2020-10-16 13:38:20,811 INFO L378 AbstractCegarLoop]: Hoare is true
[2020-10-16 13:38:20,811 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 13:38:20,811 INFO L380 AbstractCegarLoop]: Backedges is MCR
[2020-10-16 13:38:20,811 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 13:38:20,811 INFO L382 AbstractCegarLoop]: Difference is false
[2020-10-16 13:38:20,811 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 13:38:20,811 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 13:38:20,828 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 13:38:20,829 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow
[2020-10-16 13:38:20,832 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 201 flow
[2020-10-16 13:38:20,834 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow
[2020-10-16 13:38:20,898 INFO L129 PetriNetUnfolder]: 2/90 cut-off events.
[2020-10-16 13:38:20,899 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 13:38:20,905 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place.
[2020-10-16 13:38:20,912 INFO L117 LiptonReduction]: Number of co-enabled transitions 1544
[2020-10-16 13:38:21,532 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 13:38:21,683 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 13:38:21,915 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41
[2020-10-16 13:38:23,434 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89
[2020-10-16 13:38:23,574 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 87
[2020-10-16 13:38:23,581 INFO L132 LiptonReduction]: Checked pairs total: 3871
[2020-10-16 13:38:23,581 INFO L134 LiptonReduction]: Total number of compositions: 77
[2020-10-16 13:38:23,588 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow
[2020-10-16 13:38:23,630 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 658 states.
[2020-10-16 13:38:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states.
[2020-10-16 13:38:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 13:38:23,638 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:23,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 13:38:23,640 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 13:38:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:23,646 INFO L82 PathProgramCache]: Analyzing trace with hash 914764700, now seen corresponding path program 1 times
[2020-10-16 13:38:23,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:23,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582570248]
[2020-10-16 13:38:23,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:23,890 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 13:38:23,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582570248]
[2020-10-16 13:38:23,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:23,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:38:23,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1678019025]
[2020-10-16 13:38:23,893 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:23,896 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:23,908 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions.
[2020-10-16 13:38:23,909 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:23,912 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:38:23,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:38:23,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:23,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:38:23,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:38:23,930 INFO L87 Difference]: Start difference. First operand 658 states. Second operand 3 states.
[2020-10-16 13:38:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:24,053 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions.
[2020-10-16 13:38:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 13:38:24,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 13:38:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:24,084 INFO L225 Difference]: With dead ends: 550
[2020-10-16 13:38:24,085 INFO L226 Difference]: Without dead ends: 450
[2020-10-16 13:38:24,086 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 13:38:24,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states.
[2020-10-16 13:38:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450.
[2020-10-16 13:38:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states.
[2020-10-16 13:38:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions.
[2020-10-16 13:38:24,171 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 5
[2020-10-16 13:38:24,171 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:24,171 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions.
[2020-10-16 13:38:24,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:38:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions.
[2020-10-16 13:38:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 13:38:24,173 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:24,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:38:24,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 13:38:24,174 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 13:38:24,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:24,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1558775814, now seen corresponding path program 1 times
[2020-10-16 13:38:24,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:24,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865346433]
[2020-10-16 13:38:24,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:24,272 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 13:38:24,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865346433]
[2020-10-16 13:38:24,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:24,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:38:24,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1499182628]
[2020-10-16 13:38:24,273 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:24,274 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:24,276 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions.
[2020-10-16 13:38:24,276 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:24,276 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:38:24,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:38:24,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:24,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:38:24,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:38:24,282 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states.
[2020-10-16 13:38:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:24,303 INFO L93 Difference]: Finished difference Result 430 states and 1287 transitions.
[2020-10-16 13:38:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 13:38:24,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 13:38:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:24,312 INFO L225 Difference]: With dead ends: 430
[2020-10-16 13:38:24,313 INFO L226 Difference]: Without dead ends: 430
[2020-10-16 13:38:24,314 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 13:38:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2020-10-16 13:38:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430.
[2020-10-16 13:38:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2020-10-16 13:38:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1287 transitions.
[2020-10-16 13:38:24,349 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1287 transitions. Word has length 9
[2020-10-16 13:38:24,350 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:24,350 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 1287 transitions.
[2020-10-16 13:38:24,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:38:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1287 transitions.
[2020-10-16 13:38:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 13:38:24,352 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:24,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:38:24,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 13:38:24,353 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 13:38:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1076655373, now seen corresponding path program 1 times
[2020-10-16 13:38:24,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:24,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647542569]
[2020-10-16 13:38:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:24,452 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 13:38:24,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647542569]
[2020-10-16 13:38:24,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:24,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:38:24,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2121969719]
[2020-10-16 13:38:24,453 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:24,454 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:24,456 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 14 transitions.
[2020-10-16 13:38:24,456 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:24,482 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:38:24,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:38:24,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:38:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:38:24,483 INFO L87 Difference]: Start difference. First operand 430 states and 1287 transitions. Second operand 4 states.
[2020-10-16 13:38:24,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:24,509 INFO L93 Difference]: Finished difference Result 542 states and 1583 transitions.
[2020-10-16 13:38:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 13:38:24,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-16 13:38:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:24,511 INFO L225 Difference]: With dead ends: 542
[2020-10-16 13:38:24,511 INFO L226 Difference]: Without dead ends: 302
[2020-10-16 13:38:24,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 13:38:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states.
[2020-10-16 13:38:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302.
[2020-10-16 13:38:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states.
[2020-10-16 13:38:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 847 transitions.
[2020-10-16 13:38:24,533 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 847 transitions. Word has length 10
[2020-10-16 13:38:24,533 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:24,533 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 847 transitions.
[2020-10-16 13:38:24,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:38:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 847 transitions.
[2020-10-16 13:38:24,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 13:38:24,535 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:24,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:38:24,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 13:38:24,536 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 13:38:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:24,536 INFO L82 PathProgramCache]: Analyzing trace with hash -375264647, now seen corresponding path program 1 times
[2020-10-16 13:38:24,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:24,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23545115]
[2020-10-16 13:38:24,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:24,594 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 13:38:24,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23545115]
[2020-10-16 13:38:24,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:24,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:38:24,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [773562962]
[2020-10-16 13:38:24,595 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:24,597 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:24,600 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 30 transitions.
[2020-10-16 13:38:24,600 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:24,649 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:38:24,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:38:24,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:24,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:38:24,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:38:24,651 INFO L87 Difference]: Start difference. First operand 302 states and 847 transitions. Second operand 3 states.
[2020-10-16 13:38:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:24,657 INFO L93 Difference]: Finished difference Result 290 states and 806 transitions.
[2020-10-16 13:38:24,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 13:38:24,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-16 13:38:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:24,660 INFO L225 Difference]: With dead ends: 290
[2020-10-16 13:38:24,660 INFO L226 Difference]: Without dead ends: 290
[2020-10-16 13:38:24,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 13:38:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states.
[2020-10-16 13:38:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290.
[2020-10-16 13:38:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states.
[2020-10-16 13:38:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 806 transitions.
[2020-10-16 13:38:24,672 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 806 transitions. Word has length 12
[2020-10-16 13:38:24,672 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:24,672 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 806 transitions.
[2020-10-16 13:38:24,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:38:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 806 transitions.
[2020-10-16 13:38:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 13:38:24,674 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:24,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:38:24,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 13:38:24,675 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 13:38:24,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:24,675 INFO L82 PathProgramCache]: Analyzing trace with hash -700549640, now seen corresponding path program 1 times
[2020-10-16 13:38:24,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:24,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747264777]
[2020-10-16 13:38:24,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:24,724 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 13:38:24,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747264777]
[2020-10-16 13:38:24,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:24,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:38:24,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1063424132]
[2020-10-16 13:38:24,726 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:24,727 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:24,734 INFO L258 McrAutomatonBuilder]: Finished intersection with 41 states and 76 transitions.
[2020-10-16 13:38:24,734 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:24,900 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:38:24,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:38:24,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:24,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:38:24,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:38:24,902 INFO L87 Difference]: Start difference. First operand 290 states and 806 transitions. Second operand 4 states.
[2020-10-16 13:38:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:24,921 INFO L93 Difference]: Finished difference Result 362 states and 992 transitions.
[2020-10-16 13:38:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 13:38:24,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-16 13:38:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:24,923 INFO L225 Difference]: With dead ends: 362
[2020-10-16 13:38:24,923 INFO L226 Difference]: Without dead ends: 173
[2020-10-16 13:38:24,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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 13:38:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2020-10-16 13:38:24,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173.
[2020-10-16 13:38:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states.
[2020-10-16 13:38:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 452 transitions.
[2020-10-16 13:38:24,931 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 452 transitions. Word has length 13
[2020-10-16 13:38:24,931 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:24,931 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 452 transitions.
[2020-10-16 13:38:24,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:38:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 452 transitions.
[2020-10-16 13:38:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 13:38:24,932 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:24,932 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:38:24,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 13:38:24,933 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 13:38:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:24,933 INFO L82 PathProgramCache]: Analyzing trace with hash 85498302, now seen corresponding path program 1 times
[2020-10-16 13:38:24,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:24,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445884426]
[2020-10-16 13:38:24,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:25,012 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 13:38:25,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445884426]
[2020-10-16 13:38:25,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:25,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:38:25,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1381473213]
[2020-10-16 13:38:25,016 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:25,018 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:25,053 INFO L258 McrAutomatonBuilder]: Finished intersection with 28 states and 40 transitions.
[2020-10-16 13:38:25,054 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:25,123 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:38:25,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:38:25,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:25,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:38:25,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:38:25,124 INFO L87 Difference]: Start difference. First operand 173 states and 452 transitions. Second operand 4 states.
[2020-10-16 13:38:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:25,162 INFO L93 Difference]: Finished difference Result 173 states and 397 transitions.
[2020-10-16 13:38:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-10-16 13:38:25,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-16 13:38:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:25,165 INFO L225 Difference]: With dead ends: 173
[2020-10-16 13:38:25,165 INFO L226 Difference]: Without dead ends: 129
[2020-10-16 13:38:25,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 4 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 13:38:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2020-10-16 13:38:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129.
[2020-10-16 13:38:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2020-10-16 13:38:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 292 transitions.
[2020-10-16 13:38:25,172 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 292 transitions. Word has length 14
[2020-10-16 13:38:25,172 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:25,173 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 292 transitions.
[2020-10-16 13:38:25,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:38:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 292 transitions.
[2020-10-16 13:38:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 13:38:25,174 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:25,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:38:25,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 13:38:25,175 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 13:38:25,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:25,175 INFO L82 PathProgramCache]: Analyzing trace with hash 497655449, now seen corresponding path program 1 times
[2020-10-16 13:38:25,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:25,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645920316]
[2020-10-16 13:38:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:25,260 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 13:38:25,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645920316]
[2020-10-16 13:38:25,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:25,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 13:38:25,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1862234847]
[2020-10-16 13:38:25,262 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:25,266 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:25,279 INFO L258 McrAutomatonBuilder]: Finished intersection with 37 states and 56 transitions.
[2020-10-16 13:38:25,279 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:25,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:25,418 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7347#(<= ~__unbuffered_cnt~0 0)]
[2020-10-16 13:38:25,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 13:38:25,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:25,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 13:38:25,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 13:38:25,420 INFO L87 Difference]: Start difference. First operand 129 states and 292 transitions. Second operand 6 states.
[2020-10-16 13:38:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:25,474 INFO L93 Difference]: Finished difference Result 107 states and 211 transitions.
[2020-10-16 13:38:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-10-16 13:38:25,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 13:38:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:25,476 INFO L225 Difference]: With dead ends: 107
[2020-10-16 13:38:25,476 INFO L226 Difference]: Without dead ends: 81
[2020-10-16 13:38:25,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 13:38:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2020-10-16 13:38:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81.
[2020-10-16 13:38:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2020-10-16 13:38:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 152 transitions.
[2020-10-16 13:38:25,482 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 152 transitions. Word has length 16
[2020-10-16 13:38:25,482 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:25,482 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 152 transitions.
[2020-10-16 13:38:25,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 13:38:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 152 transitions.
[2020-10-16 13:38:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 13:38:25,484 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:25,484 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 13:38:25,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 13:38:25,484 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 13:38:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:25,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1445024253, now seen corresponding path program 1 times
[2020-10-16 13:38:25,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:25,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554823985]
[2020-10-16 13:38:25,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:25,619 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 13:38:25,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554823985]
[2020-10-16 13:38:25,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:25,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 13:38:25,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1380106375]
[2020-10-16 13:38:25,621 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:25,624 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:25,636 INFO L258 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions.
[2020-10-16 13:38:25,636 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:25,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:25,771 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7625#(<= ~__unbuffered_cnt~0 0)]
[2020-10-16 13:38:25,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 13:38:25,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:25,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 13:38:25,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 13:38:25,772 INFO L87 Difference]: Start difference. First operand 81 states and 152 transitions. Second operand 7 states.
[2020-10-16 13:38:25,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:25,825 INFO L93 Difference]: Finished difference Result 69 states and 126 transitions.
[2020-10-16 13:38:25,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-10-16 13:38:25,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18
[2020-10-16 13:38:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:25,827 INFO L225 Difference]: With dead ends: 69
[2020-10-16 13:38:25,827 INFO L226 Difference]: Without dead ends: 61
[2020-10-16 13:38:25,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-16 13:38:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2020-10-16 13:38:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2020-10-16 13:38:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2020-10-16 13:38:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions.
[2020-10-16 13:38:25,831 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 18
[2020-10-16 13:38:25,831 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:25,831 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 112 transitions.
[2020-10-16 13:38:25,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 13:38:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions.
[2020-10-16 13:38:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 13:38:25,832 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:25,832 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 13:38:25,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 13:38:25,833 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 13:38:25,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:25,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1319644494, now seen corresponding path program 1 times
[2020-10-16 13:38:25,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:25,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353484706]
[2020-10-16 13:38:25,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:26,176 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 13:38:26,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353484706]
[2020-10-16 13:38:26,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:26,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-10-16 13:38:26,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1281161230]
[2020-10-16 13:38:26,178 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:26,183 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:26,201 INFO L258 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions.
[2020-10-16 13:38:26,201 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:26,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,356 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,362 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 5, 3, 3, 2, 1] term
[2020-10-16 13:38:26,363 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,364 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:26,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,365 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:26,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,368 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:26,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,370 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:26,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,371 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:26,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,373 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:26,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,378 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:26,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,379 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:26,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,561 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:38:26,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:26,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:38:26,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:38:26,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,588 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,604 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,619 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,625 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,639 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term
[2020-10-16 13:38:26,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,688 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:38:26,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,689 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:26,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,692 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,693 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,698 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,708 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,714 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,736 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,742 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,756 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term
[2020-10-16 13:38:26,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,774 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,778 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:26,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,780 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:26,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,782 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:26,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,787 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,788 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,801 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,806 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:38:26,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,813 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,814 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,828 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,833 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,837 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,839 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,851 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,856 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:38:26,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,862 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,864 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,878 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 5 conjuncts
[2020-10-16 13:38:26,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:38:26,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:26,894 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,896 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,907 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts
[2020-10-16 13:38:26,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,077 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24
[2020-10-16 13:38:27,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,089 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,093 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:27,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,094 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:27,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,095 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:27,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,106 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,111 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,114 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,128 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,141 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,160 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,165 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,170 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,173 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,223 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,238 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,257 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,313 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,318 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:27,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,319 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:27,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,321 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:27,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,322 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,323 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,327 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,330 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,344 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,357 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,375 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,393 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:38:27,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,419 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,419 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:38:27,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:38:27,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,498 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:27,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,500 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:27,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,501 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:27,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,507 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,507 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,508 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,511 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,526 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,526 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,535 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:27,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,548 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:27,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:27,578 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [7830#(and (= ~__unbuffered_p0_EBX~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), 7831#(and (= ~__unbuffered_p0_EBX~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)), 7832#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)), 7833#(and (= ~x$w_buff0~0 1) (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0)) (= ~__unbuffered_cnt~0 0))]
[2020-10-16 13:38:27,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states
[2020-10-16 13:38:27,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:27,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2020-10-16 13:38:27,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210
[2020-10-16 13:38:27,580 INFO L87 Difference]: Start difference. First operand 61 states and 112 transitions. Second operand 15 states.
[2020-10-16 13:38:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:28,105 INFO L93 Difference]: Finished difference Result 87 states and 151 transitions.
[2020-10-16 13:38:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2020-10-16 13:38:28,106 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20
[2020-10-16 13:38:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:28,106 INFO L225 Difference]: With dead ends: 87
[2020-10-16 13:38:28,107 INFO L226 Difference]: Without dead ends: 52
[2020-10-16 13:38:28,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380
[2020-10-16 13:38:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2020-10-16 13:38:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45.
[2020-10-16 13:38:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2020-10-16 13:38:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions.
[2020-10-16 13:38:28,110 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 20
[2020-10-16 13:38:28,110 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:28,110 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions.
[2020-10-16 13:38:28,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2020-10-16 13:38:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions.
[2020-10-16 13:38:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 13:38:28,111 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:28,111 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 13:38:28,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 13:38:28,111 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 13:38:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1660611726, now seen corresponding path program 2 times
[2020-10-16 13:38:28,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:28,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374184677]
[2020-10-16 13:38:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:38:28,554 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 13:38:28,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374184677]
[2020-10-16 13:38:28,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:38:28,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-10-16 13:38:28,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [814282929]
[2020-10-16 13:38:28,556 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:38:28,560 INFO L255 McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:38:28,609 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 45 transitions.
[2020-10-16 13:38:28,610 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:38:28,705 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 13:38:28,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,706 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:28,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,707 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:28,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,708 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 13:38:28,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,709 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:28,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:28,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,711 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,712 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,714 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:28,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,715 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:28,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,716 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:38:28,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,868 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,872 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:38:28,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,873 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:28,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,874 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:28,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,875 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,882 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,887 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,893 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,899 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,904 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,912 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,922 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,936 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,955 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,960 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:28,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,968 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,978 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,991 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:28,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:28,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:29,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,009 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,014 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,044 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,046 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:38:29,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,049 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:29,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,050 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:38:29,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,051 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,052 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,054 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,057 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:29,070 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:29,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:29,080 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:38:29,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:29,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,094 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:38:29,110 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:38:29,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:29,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:29,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:38:29,125 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,140 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,147 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,149 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,153 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:38:29,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:29,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,162 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,168 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,180 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:38:29,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:38:29,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:29,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:38:29,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:38:29,212 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [8032#(and (= ~__unbuffered_p0_EBX~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), 8033#(and (= ~__unbuffered_p0_EBX~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)), 8034#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0))]
[2020-10-16 13:38:29,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states
[2020-10-16 13:38:29,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:38:29,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2020-10-16 13:38:29,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182
[2020-10-16 13:38:29,214 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 14 states.
[2020-10-16 13:38:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:38:29,882 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions.
[2020-10-16 13:38:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2020-10-16 13:38:29,882 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20
[2020-10-16 13:38:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:38:29,883 INFO L225 Difference]: With dead ends: 60
[2020-10-16 13:38:29,884 INFO L226 Difference]: Without dead ends: 50
[2020-10-16 13:38:29,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306
[2020-10-16 13:38:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2020-10-16 13:38:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41.
[2020-10-16 13:38:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2020-10-16 13:38:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions.
[2020-10-16 13:38:29,886 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 20
[2020-10-16 13:38:29,886 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:38:29,886 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions.
[2020-10-16 13:38:29,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2020-10-16 13:38:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions.
[2020-10-16 13:38:29,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 13:38:29,887 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 13:38:29,887 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 13:38:29,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 13:38:29,887 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 13:38:29,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:38:29,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1246216568, now seen corresponding path program 3 times
[2020-10-16 13:38:29,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:38:29,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742291900]
[2020-10-16 13:38:29,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:38:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:38:29,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:38:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:38:30,054 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:38:30,116 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 13:38:30,117 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 13:38:30,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 13:38:30,118 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 13:38:30,138 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L829-->L836: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In1150823638 256) 0)) (.cse6 (= (mod ~x$w_buff1_used~0_In1150823638 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In1150823638 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In1150823638 256) 0))) (let ((.cse4 (not .cse8)) (.cse5 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse2 (not .cse6)) (.cse3 (not .cse7)) (.cse1 (or .cse6 .cse7))) (and (= ~x$r_buff1_thd0~0_Out1150823638 ~x$r_buff1_thd0~0_In1150823638) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1150823638 0)) (or (and .cse0 (or (and .cse1 (= ~x~0_In1150823638 ~x~0_Out1150823638)) (and .cse2 (= ~x~0_Out1150823638 ~x$w_buff1~0_In1150823638) .cse3))) (and (= ~x~0_Out1150823638 ~x$w_buff0~0_In1150823638) .cse4 .cse5)) (or (and (= ~x$w_buff0_used~0_Out1150823638 0) .cse4 .cse5) (and .cse0 (= ~x$w_buff0_used~0_In1150823638 ~x$w_buff0_used~0_Out1150823638))) (or (and (= ~x$w_buff1_used~0_Out1150823638 0) .cse2 .cse3) (and .cse1 (= ~x$w_buff1_used~0_In1150823638 ~x$w_buff1_used~0_Out1150823638))) (= ~x$r_buff0_thd0~0_Out1150823638 ~x$r_buff0_thd0~0_In1150823638) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1150823638 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1150823638|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1150823638, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1150823638, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1150823638|, ~x$w_buff1~0=~x$w_buff1~0_In1150823638, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1150823638, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1150823638, ~x~0=~x~0_In1150823638, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1150823638} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1150823638, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1150823638, ~x$w_buff1~0=~x$w_buff1~0_In1150823638, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1150823638, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1150823638, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1150823638|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1150823638|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1150823638|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1150823638, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1150823638|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1150823638|, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1150823638|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1150823638|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1150823638, ~x~0=~x~0_Out1150823638} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ~x~0, ULTIMATE.start_main_#t~ite45, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite44] because there is no mapped edge
[2020-10-16 13:38:30,149 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 13:38:30,150 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,150 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 13:38:30,150 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,151 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 13:38:30,151 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,152 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 13:38:30,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,152 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 13:38:30,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,153 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 13:38:30,153 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,153 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 13:38:30,153 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,154 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 13:38:30,154 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,154 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 13:38:30,154 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,155 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 13:38:30,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,155 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 13:38:30,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,156 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 13:38:30,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,156 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 13:38:30,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,156 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 13:38:30,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,157 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 13:38:30,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,157 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 13:38:30,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,157 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 13:38:30,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,158 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 13:38:30,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,162 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 13:38:30,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,162 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 13:38:30,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,163 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 13:38:30,163 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,163 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 13:38:30,163 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,163 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 13:38:30,163 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:38:30,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:38:30 BasicIcfg
[2020-10-16 13:38:30,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 13:38:30,263 INFO L168 Benchmark]: Toolchain (without parser) took 12401.71 ms. Allocated memory was 140.0 MB in the beginning and 422.1 MB in the end (delta: 282.1 MB). Free memory was 100.8 MB in the beginning and 343.4 MB in the end (delta: -242.6 MB). Peak memory consumption was 39.5 MB. Max. memory is 7.1 GB.
[2020-10-16 13:38:30,263 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-10-16 13:38:30,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.86 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 100.4 MB in the beginning and 153.7 MB in the end (delta: -53.3 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB.
[2020-10-16 13:38:30,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.64 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2020-10-16 13:38:30,265 INFO L168 Benchmark]: Boogie Preprocessor took 38.98 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 148.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 13:38:30,266 INFO L168 Benchmark]: RCFGBuilder took 2008.16 ms. Allocated memory was 202.4 MB in the beginning and 246.4 MB in the end (delta: 44.0 MB). Free memory was 148.4 MB in the beginning and 187.5 MB in the end (delta: -39.1 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB.
[2020-10-16 13:38:30,267 INFO L168 Benchmark]: TraceAbstraction took 9617.72 ms. Allocated memory was 246.4 MB in the beginning and 422.1 MB in the end (delta: 175.6 MB). Free memory was 187.5 MB in the beginning and 343.4 MB in the end (delta: -156.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB.
[2020-10-16 13:38:30,271 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 672.86 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 100.4 MB in the beginning and 153.7 MB in the end (delta: -53.3 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 57.64 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 38.98 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 148.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 2008.16 ms. Allocated memory was 202.4 MB in the beginning and 246.4 MB in the end (delta: 44.0 MB). Free memory was 148.4 MB in the beginning and 187.5 MB in the end (delta: -39.1 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 9617.72 ms. Allocated memory was 246.4 MB in the beginning and 422.1 MB in the end (delta: 175.6 MB). Free memory was 187.5 MB in the beginning and 343.4 MB in the end (delta: -156.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
805 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 76 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.7s, 101 PlacesBefore, 35 PlacesAfterwards, 93 TransitionsBefore, 25 TransitionsAfterwards, 1544 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 3871 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_p0_EBX = 0;
[L705] 0 int __unbuffered_p2_EAX = 0;
[L706] 0 _Bool main$tmp_guard0;
[L707] 0 _Bool main$tmp_guard1;
[L709] 0 int x = 0;
[L710] 0 _Bool x$flush_delayed;
[L711] 0 int x$mem_tmp;
[L712] 0 _Bool x$r_buff0_thd0;
[L713] 0 _Bool x$r_buff0_thd1;
[L714] 0 _Bool x$r_buff0_thd2;
[L715] 0 _Bool x$r_buff0_thd3;
[L716] 0 _Bool x$r_buff1_thd0;
[L717] 0 _Bool x$r_buff1_thd1;
[L718] 0 _Bool x$r_buff1_thd2;
[L719] 0 _Bool x$r_buff1_thd3;
[L720] 0 _Bool x$read_delayed;
[L721] 0 int *x$read_delayed_var;
[L722] 0 int x$w_buff0;
[L723] 0 _Bool x$w_buff0_used;
[L724] 0 int x$w_buff1;
[L725] 0 _Bool x$w_buff1_used;
[L727] 0 int y = 0;
[L729] 0 int z = 0;
[L730] 0 _Bool weak$$choice0;
[L731] 0 _Bool weak$$choice2;
[L820] 0 pthread_t t2058;
[L821] FCALL, FORK 0 pthread_create(&t2058, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L822] 0 pthread_t t2059;
[L823] FCALL, FORK 0 pthread_create(&t2059, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L824] 0 pthread_t t2060;
[L825] FCALL, FORK 0 pthread_create(&t2060, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L763] 2 x$w_buff1 = x$w_buff0
[L764] 2 x$w_buff0 = 1
[L765] 2 x$w_buff1_used = x$w_buff0_used
[L766] 2 x$w_buff0_used = (_Bool)1
[L8] COND TRUE 2 !expression
[L8] 2 __VERIFIER_error()
[L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L772] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L775] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L792] 3 __unbuffered_p2_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L795] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L735] 1 __unbuffered_p0_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L807] 3 return 0;
[L738] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L739] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L740] 1 x$flush_delayed = weak$$choice2
[L741] 1 x$mem_tmp = x
[L742] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1
[L742] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L742] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L743] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L743] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)
[L743] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L743] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L744] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L744] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L745] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L745] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L746] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L746] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L746] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L747] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L747] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L748] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L748] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L749] 1 __unbuffered_p0_EBX = x
[L750] EXPR 1 x$flush_delayed ? x$mem_tmp : x
[L750] 1 x = x$flush_delayed ? x$mem_tmp : x
[L751] 1 x$flush_delayed = (_Bool)0
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L787] 2 return 0;
[L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L758] 1 return 0;
[L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L838] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1)
[L8] COND TRUE 0 !expression
[L8] 0 __VERIFIER_error()
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.3s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 203 SDtfs, 178 SDslu, 587 SDs, 0 SdLazy, 805 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 91 SyntacticMatches, 26 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 14247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...