/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:04:46,578 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:04:46,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:04:46,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:04:46,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:04:46,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:04:46,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:04:46,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:04:46,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:04:46,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:04:46,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:04:46,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:04:46,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:04:46,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:04:46,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:04:46,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:04:46,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:04:46,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:04:46,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:04:46,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:04:46,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:04:46,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:04:46,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:04:46,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:04:46,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:04:46,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:04:46,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:04:46,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:04:46,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:04:46,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:04:46,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:04:46,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:04:46,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:04:46,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:04:46,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:04:46,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:04:46,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:04:46,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:04:46,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:04:46,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:04:46,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:04:46,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-16 11:04:46,682 INFO L113 SettingsManager]: Loading preferences was successful
[2020-10-16 11:04:46,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:04:46,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:04:46,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-10-16 11:04:46,685 INFO L138 SettingsManager]: * Use SBE=true
[2020-10-16 11:04:46,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:04:46,685 INFO L138 SettingsManager]: * sizeof long=4
[2020-10-16 11:04:46,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-10-16 11:04:46,685 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-10-16 11:04:46,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-10-16 11:04:46,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:04:46,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:04:46,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:04:46,686 INFO L138 SettingsManager]: * sizeof long double=12
[2020-10-16 11:04:46,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-10-16 11:04:46,687 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-10-16 11:04:46,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:04:46,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:04:46,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-10-16 11:04:46,687 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-10-16 11:04:46,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-10-16 11:04:46,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:04:46,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:04:46,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:04:46,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:04:46,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-10-16 11:04:46,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:04:46,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:04:46,689 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2020-10-16 11:04:46,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:04:47,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:04:47,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:04:47,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:04:47,089 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-10-16 11:04:47,091 INFO L275 PluginConnector]: CDTParser initialized
[2020-10-16 11:04:47,092 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i
[2020-10-16 11:04:47,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fc473a59e/24cf731f80b34fefa102a348141d8a49/FLAG405c01213
[2020-10-16 11:04:47,746 INFO L306 CDTParser]: Found 1 translation units.
[2020-10-16 11:04:47,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i
[2020-10-16 11:04:47,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fc473a59e/24cf731f80b34fefa102a348141d8a49/FLAG405c01213
[2020-10-16 11:04:48,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fc473a59e/24cf731f80b34fefa102a348141d8a49
[2020-10-16 11:04:48,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:04:48,012 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:04:48,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:04:48,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:04:48,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:04:48,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:04:48" (1/1) ...
[2020-10-16 11:04:48,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7f2b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48, skipping insertion in model container
[2020-10-16 11:04:48,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:04:48" (1/1) ...
[2020-10-16 11:04:48,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-10-16 11:04:48,078 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:04:48,641 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:04:48,665 INFO L203 MainTranslator]: Completed pre-run
[2020-10-16 11:04:48,761 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:04:48,847 INFO L208 MainTranslator]: Completed translation
[2020-10-16 11:04:48,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48 WrapperNode
[2020-10-16 11:04:48,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:04:48,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:04:48,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:04:48,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:04:48,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48" (1/1) ...
[2020-10-16 11:04:48,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48" (1/1) ...
[2020-10-16 11:04:48,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:04:48,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:04:48,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:04:48,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:04:48,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48" (1/1) ...
[2020-10-16 11:04:48,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48" (1/1) ...
[2020-10-16 11:04:48,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48" (1/1) ...
[2020-10-16 11:04:48,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48" (1/1) ...
[2020-10-16 11:04:48,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48" (1/1) ...
[2020-10-16 11:04:48,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48" (1/1) ...
[2020-10-16 11:04:48,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48" (1/1) ...
[2020-10-16 11:04:48,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:04:48,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:04:48,994 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:04:48,994 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:04:48,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:04:49,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:04:49,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:04:49,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:04:49,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:04:49,060 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:04:49,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:04:49,060 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:04:49,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:04:49,061 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 11:04:49,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 11:04:49,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:04:49,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:04:49,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:04:49,064 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 11:04:51,503 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:04:51,503 INFO L298 CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:04:51,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:04:51 BoogieIcfgContainer
[2020-10-16 11:04:51,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:04:51,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:04:51,508 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:04:51,511 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:04:51,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:04:48" (1/3) ...
[2020-10-16 11:04:51,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789be707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:04:51, skipping insertion in model container
[2020-10-16 11:04:51,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:04:48" (2/3) ...
[2020-10-16 11:04:51,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789be707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:04:51, skipping insertion in model container
[2020-10-16 11:04:51,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:04:51" (3/3) ...
[2020-10-16 11:04:51,515 INFO L111 eAbstractionObserver]: Analyzing ICFG mix001_power.opt.i
[2020-10-16 11:04:51,527 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:04:51,528 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:04:51,535 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:04:51,536 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:04:51,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,571 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,572 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,572 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,572 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,573 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,573 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,583 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,583 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,583 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,584 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,607 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,610 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,612 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,615 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:04:51,620 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:04:51,634 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 11:04:51,657 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:04:51,657 INFO L378 AbstractCegarLoop]: Hoare is true
[2020-10-16 11:04:51,657 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:04:51,657 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:04:51,657 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:04:51,658 INFO L382 AbstractCegarLoop]: Difference is false
[2020-10-16 11:04:51,658 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:04:51,658 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:04:51,672 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:04:51,675 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 211 flow
[2020-10-16 11:04:51,678 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 211 flow
[2020-10-16 11:04:51,681 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow
[2020-10-16 11:04:51,731 INFO L129 PetriNetUnfolder]: 2/95 cut-off events.
[2020-10-16 11:04:51,732 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:04:51,737 INFO L80 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place.
[2020-10-16 11:04:51,741 INFO L117 LiptonReduction]: Number of co-enabled transitions 1714
[2020-10-16 11:04:52,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:52,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:52,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:52,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:52,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:52,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:52,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:52,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:52,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:52,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:52,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:52,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:52,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:52,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:52,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:52,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:04:52,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:52,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:52,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:52,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:52,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:52,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:52,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:52,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:52,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:52,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:52,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:52,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:52,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:52,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:52,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:52,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:52,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:52,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:04:52,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:52,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:52,691 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:04:53,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:04:53,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:53,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:53,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:04:53,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:53,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:53,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:53,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:53,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:53,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:53,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:53,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:53,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:53,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:53,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:53,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:53,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:53,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:04:53,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:04:53,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:04:53,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:53,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:53,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:53,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:53,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:53,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:04:53,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:04:53,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:04:53,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:04:53,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:53,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:04:53,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:53,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:53,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:53,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:53,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:53,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:53,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:53,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:53,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:53,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:53,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:53,621 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41
[2020-10-16 11:04:53,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:53,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:53,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:53,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:53,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:54,414 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:04:54,548 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:04:54,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:54,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:54,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:54,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:54,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:54,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:54,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:54,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:54,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:54,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:04:54,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:54,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:54,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:04:54,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:54,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:54,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:54,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:54,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:54,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:54,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:54,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:54,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:54,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:54,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:54,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:04:54,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:54,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:54,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:54,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:54,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:54,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:54,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:54,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:54,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:54,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:54,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:54,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:54,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:54,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:54,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:54,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:55,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:55,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:04:55,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:04:55,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:04:55,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:55,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:55,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:55,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:55,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:55,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:55,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:04:55,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:55,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:55,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:55,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:55,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:55,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:55,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:55,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:04:55,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:55,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:04:55,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:55,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:55,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:55,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:55,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:04:55,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:04:55,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:04:55,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:04:55,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:55,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:55,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:55,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:55,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:55,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:55,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:04:55,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:55,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:55,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:55,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:55,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:55,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:04:55,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:04:55,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:04:55,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:04:55,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:04:56,379 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95
[2020-10-16 11:04:56,507 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2020-10-16 11:04:56,561 INFO L132 LiptonReduction]: Checked pairs total: 4976
[2020-10-16 11:04:56,561 INFO L134 LiptonReduction]: Total number of compositions: 83
[2020-10-16 11:04:56,570 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow
[2020-10-16 11:04:56,624 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 937 states.
[2020-10-16 11:04:56,627 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states.
[2020-10-16 11:04:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-16 11:04:56,634 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:04:56,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:04:56,635 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:04:56,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:04:56,642 INFO L82 PathProgramCache]: Analyzing trace with hash -927712130, now seen corresponding path program 1 times
[2020-10-16 11:04:56,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:04:56,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463822991]
[2020-10-16 11:04:56,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:04:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:04:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:04:56,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463822991]
[2020-10-16 11:04:56,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:04:56,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:04:56,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026249052]
[2020-10-16 11:04:56,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:04:56,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:04:56,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:04:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:04:56,958 INFO L87 Difference]: Start difference. First operand 937 states. Second operand 3 states.
[2020-10-16 11:04:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:04:57,069 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions.
[2020-10-16 11:04:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:04:57,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-16 11:04:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:04:57,114 INFO L225 Difference]: With dead ends: 812
[2020-10-16 11:04:57,114 INFO L226 Difference]: Without dead ends: 662
[2020-10-16 11:04:57,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:04:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2020-10-16 11:04:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662.
[2020-10-16 11:04:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states.
[2020-10-16 11:04:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions.
[2020-10-16 11:04:57,235 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 7
[2020-10-16 11:04:57,237 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:04:57,237 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions.
[2020-10-16 11:04:57,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:04:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions.
[2020-10-16 11:04:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 11:04:57,239 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:04:57,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:04:57,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:04:57,240 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:04:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:04:57,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1821886390, now seen corresponding path program 1 times
[2020-10-16 11:04:57,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:04:57,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669739317]
[2020-10-16 11:04:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:04:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:04:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:04:57,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669739317]
[2020-10-16 11:04:57,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:04:57,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:04:57,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109292756]
[2020-10-16 11:04:57,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:04:57,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:04:57,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:04:57,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:04:57,379 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states.
[2020-10-16 11:04:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:04:57,395 INFO L93 Difference]: Finished difference Result 602 states and 1842 transitions.
[2020-10-16 11:04:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:04:57,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 11:04:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:04:57,402 INFO L225 Difference]: With dead ends: 602
[2020-10-16 11:04:57,402 INFO L226 Difference]: Without dead ends: 602
[2020-10-16 11:04:57,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:04:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states.
[2020-10-16 11:04:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602.
[2020-10-16 11:04:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states.
[2020-10-16 11:04:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1842 transitions.
[2020-10-16 11:04:57,433 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1842 transitions. Word has length 9
[2020-10-16 11:04:57,433 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:04:57,433 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 1842 transitions.
[2020-10-16 11:04:57,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:04:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1842 transitions.
[2020-10-16 11:04:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 11:04:57,436 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:04:57,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:04:57,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:04:57,436 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:04:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:04:57,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1638276175, now seen corresponding path program 1 times
[2020-10-16 11:04:57,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:04:57,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381854583]
[2020-10-16 11:04:57,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:04:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:04:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:04:57,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381854583]
[2020-10-16 11:04:57,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:04:57,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:04:57,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677876057]
[2020-10-16 11:04:57,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:04:57,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:04:57,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:04:57,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:04:57,509 INFO L87 Difference]: Start difference. First operand 602 states and 1842 transitions. Second operand 3 states.
[2020-10-16 11:04:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:04:57,542 INFO L93 Difference]: Finished difference Result 572 states and 1738 transitions.
[2020-10-16 11:04:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:04:57,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-16 11:04:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:04:57,548 INFO L225 Difference]: With dead ends: 572
[2020-10-16 11:04:57,548 INFO L226 Difference]: Without dead ends: 572
[2020-10-16 11:04:57,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:04:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states.
[2020-10-16 11:04:57,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572.
[2020-10-16 11:04:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states.
[2020-10-16 11:04:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1738 transitions.
[2020-10-16 11:04:57,569 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1738 transitions. Word has length 11
[2020-10-16 11:04:57,569 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:04:57,570 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 1738 transitions.
[2020-10-16 11:04:57,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:04:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1738 transitions.
[2020-10-16 11:04:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 11:04:57,579 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:04:57,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:04:57,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:04:57,579 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:04:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:04:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1869589888, now seen corresponding path program 1 times
[2020-10-16 11:04:57,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:04:57,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109706028]
[2020-10-16 11:04:57,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:04:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:04:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:04:57,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109706028]
[2020-10-16 11:04:57,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:04:57,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:04:57,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377183320]
[2020-10-16 11:04:57,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:04:57,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:04:57,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:04:57,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:04:57,658 INFO L87 Difference]: Start difference. First operand 572 states and 1738 transitions. Second operand 3 states.
[2020-10-16 11:04:57,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:04:57,668 INFO L93 Difference]: Finished difference Result 548 states and 1656 transitions.
[2020-10-16 11:04:57,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:04:57,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2020-10-16 11:04:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:04:57,673 INFO L225 Difference]: With dead ends: 548
[2020-10-16 11:04:57,673 INFO L226 Difference]: Without dead ends: 548
[2020-10-16 11:04:57,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:04:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states.
[2020-10-16 11:04:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548.
[2020-10-16 11:04:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states.
[2020-10-16 11:04:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1656 transitions.
[2020-10-16 11:04:57,691 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1656 transitions. Word has length 13
[2020-10-16 11:04:57,691 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:04:57,692 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 1656 transitions.
[2020-10-16 11:04:57,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:04:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1656 transitions.
[2020-10-16 11:04:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:04:57,693 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:04:57,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:04:57,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:04:57,694 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:04:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:04:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1380926184, now seen corresponding path program 1 times
[2020-10-16 11:04:57,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:04:57,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918540096]
[2020-10-16 11:04:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:04:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:04:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:04:57,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918540096]
[2020-10-16 11:04:57,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:04:57,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:04:57,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188319817]
[2020-10-16 11:04:57,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:04:57,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:04:57,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:04:57,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:04:57,789 INFO L87 Difference]: Start difference. First operand 548 states and 1656 transitions. Second operand 4 states.
[2020-10-16 11:04:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:04:57,837 INFO L93 Difference]: Finished difference Result 526 states and 1413 transitions.
[2020-10-16 11:04:57,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-10-16 11:04:57,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-16 11:04:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:04:57,841 INFO L225 Difference]: With dead ends: 526
[2020-10-16 11:04:57,841 INFO L226 Difference]: Without dead ends: 376
[2020-10-16 11:04:57,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:04:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states.
[2020-10-16 11:04:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376.
[2020-10-16 11:04:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states.
[2020-10-16 11:04:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 968 transitions.
[2020-10-16 11:04:57,853 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 968 transitions. Word has length 15
[2020-10-16 11:04:57,853 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:04:57,853 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 968 transitions.
[2020-10-16 11:04:57,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:04:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 968 transitions.
[2020-10-16 11:04:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:04:57,855 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:04:57,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:04:57,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:04:57,855 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:04:57,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:04:57,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1281486762, now seen corresponding path program 1 times
[2020-10-16 11:04:57,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:04:57,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189028263]
[2020-10-16 11:04:57,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:04:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:04:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:04:57,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189028263]
[2020-10-16 11:04:57,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:04:57,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:04:57,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020307557]
[2020-10-16 11:04:57,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:04:57,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:04:57,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:04:57,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:04:57,994 INFO L87 Difference]: Start difference. First operand 376 states and 968 transitions. Second operand 5 states.
[2020-10-16 11:04:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:04:58,053 INFO L93 Difference]: Finished difference Result 318 states and 765 transitions.
[2020-10-16 11:04:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-10-16 11:04:58,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2020-10-16 11:04:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:04:58,055 INFO L225 Difference]: With dead ends: 318
[2020-10-16 11:04:58,055 INFO L226 Difference]: Without dead ends: 248
[2020-10-16 11:04:58,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:04:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states.
[2020-10-16 11:04:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248.
[2020-10-16 11:04:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states.
[2020-10-16 11:04:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 584 transitions.
[2020-10-16 11:04:58,063 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 584 transitions. Word has length 17
[2020-10-16 11:04:58,064 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:04:58,064 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 584 transitions.
[2020-10-16 11:04:58,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:04:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 584 transitions.
[2020-10-16 11:04:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-16 11:04:58,065 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:04:58,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:04:58,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:04:58,066 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:04:58,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:04:58,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1583241295, now seen corresponding path program 1 times
[2020-10-16 11:04:58,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:04:58,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999008578]
[2020-10-16 11:04:58,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:04:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:04:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:04:58,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999008578]
[2020-10-16 11:04:58,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:04:58,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:04:58,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607783217]
[2020-10-16 11:04:58,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:04:58,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:04:58,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:04:58,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:04:58,249 INFO L87 Difference]: Start difference. First operand 248 states and 584 transitions. Second operand 6 states.
[2020-10-16 11:04:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:04:58,322 INFO L93 Difference]: Finished difference Result 229 states and 544 transitions.
[2020-10-16 11:04:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-10-16 11:04:58,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2020-10-16 11:04:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:04:58,325 INFO L225 Difference]: With dead ends: 229
[2020-10-16 11:04:58,325 INFO L226 Difference]: Without dead ends: 215
[2020-10-16 11:04:58,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:04:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states.
[2020-10-16 11:04:58,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215.
[2020-10-16 11:04:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states.
[2020-10-16 11:04:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 518 transitions.
[2020-10-16 11:04:58,332 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 518 transitions. Word has length 19
[2020-10-16 11:04:58,332 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:04:58,332 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 518 transitions.
[2020-10-16 11:04:58,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:04:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 518 transitions.
[2020-10-16 11:04:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 11:04:58,334 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:04:58,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:04:58,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:04:58,334 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:04:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:04:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash -606550880, now seen corresponding path program 1 times
[2020-10-16 11:04:58,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:04:58,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502068494]
[2020-10-16 11:04:58,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:04:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:04:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:04:58,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502068494]
[2020-10-16 11:04:58,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:04:58,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:04:58,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269579177]
[2020-10-16 11:04:58,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:04:58,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:04:58,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:04:58,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:04:58,437 INFO L87 Difference]: Start difference. First operand 215 states and 518 transitions. Second operand 4 states.
[2020-10-16 11:04:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:04:58,461 INFO L93 Difference]: Finished difference Result 277 states and 653 transitions.
[2020-10-16 11:04:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 11:04:58,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22
[2020-10-16 11:04:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:04:58,463 INFO L225 Difference]: With dead ends: 277
[2020-10-16 11:04:58,463 INFO L226 Difference]: Without dead ends: 107
[2020-10-16 11:04:58,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:04:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2020-10-16 11:04:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2020-10-16 11:04:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states.
[2020-10-16 11:04:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 222 transitions.
[2020-10-16 11:04:58,467 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 222 transitions. Word has length 22
[2020-10-16 11:04:58,467 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:04:58,467 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 222 transitions.
[2020-10-16 11:04:58,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:04:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 222 transitions.
[2020-10-16 11:04:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 11:04:58,468 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:04:58,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:04:58,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:04:58,469 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:04:58,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:04:58,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1946434172, now seen corresponding path program 2 times
[2020-10-16 11:04:58,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:04:58,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472810459]
[2020-10-16 11:04:58,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:04:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:04:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:04:58,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472810459]
[2020-10-16 11:04:58,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:04:58,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:04:58,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369735730]
[2020-10-16 11:04:58,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:04:58,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:04:58,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:04:58,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:04:58,576 INFO L87 Difference]: Start difference. First operand 107 states and 222 transitions. Second operand 4 states.
[2020-10-16 11:04:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:04:58,592 INFO L93 Difference]: Finished difference Result 133 states and 270 transitions.
[2020-10-16 11:04:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 11:04:58,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22
[2020-10-16 11:04:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:04:58,593 INFO L225 Difference]: With dead ends: 133
[2020-10-16 11:04:58,593 INFO L226 Difference]: Without dead ends: 51
[2020-10-16 11:04:58,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:04:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2020-10-16 11:04:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2020-10-16 11:04:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2020-10-16 11:04:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions.
[2020-10-16 11:04:58,596 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 22
[2020-10-16 11:04:58,596 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:04:58,596 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions.
[2020-10-16 11:04:58,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:04:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions.
[2020-10-16 11:04:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 11:04:58,597 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:04:58,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:04:58,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:04:58,597 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:04:58,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:04:58,598 INFO L82 PathProgramCache]: Analyzing trace with hash 27003850, now seen corresponding path program 3 times
[2020-10-16 11:04:58,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:04:58,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407245253]
[2020-10-16 11:04:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:04:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:04:58,905 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 29
[2020-10-16 11:04:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:04:58,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407245253]
[2020-10-16 11:04:58,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:04:58,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:04:58,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822958846]
[2020-10-16 11:04:58,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:04:58,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:04:58,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:04:58,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:04:58,976 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 7 states.
[2020-10-16 11:04:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:04:59,127 INFO L93 Difference]: Finished difference Result 61 states and 100 transitions.
[2020-10-16 11:04:59,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2020-10-16 11:04:59,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22
[2020-10-16 11:04:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:04:59,129 INFO L225 Difference]: With dead ends: 61
[2020-10-16 11:04:59,129 INFO L226 Difference]: Without dead ends: 33
[2020-10-16 11:04:59,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2020-10-16 11:04:59,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2020-10-16 11:04:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2020-10-16 11:04:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2020-10-16 11:04:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions.
[2020-10-16 11:04:59,131 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 22
[2020-10-16 11:04:59,131 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:04:59,131 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions.
[2020-10-16 11:04:59,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:04:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions.
[2020-10-16 11:04:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 11:04:59,132 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:04:59,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:04:59,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 11:04:59,133 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:04:59,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:04:59,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1609919084, now seen corresponding path program 4 times
[2020-10-16 11:04:59,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:04:59,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645197725]
[2020-10-16 11:04:59,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:04:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:04:59,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:04:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:04:59,254 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:04:59,311 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:04:59,312 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:04:59,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 11:04:59,313 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 11:04:59,331 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L2-->L858: Formula: (let ((.cse8 (= (mod ~y$w_buff1_used~0_In-1118249315 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-1118249315 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-1118249315 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-1118249315 256) 0))) (let ((.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7))) (and (or (and (= ~y$w_buff1_used~0_Out-1118249315 0) .cse0 .cse1) (and .cse2 (= ~y$w_buff1_used~0_In-1118249315 ~y$w_buff1_used~0_Out-1118249315))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1118249315 0)) (or (and (= ~y$w_buff0_used~0_Out-1118249315 0) .cse3 .cse4) (and .cse5 (= ~y$w_buff0_used~0_Out-1118249315 ~y$w_buff0_used~0_In-1118249315))) (= ~y$r_buff1_thd0~0_In-1118249315 ~y$r_buff1_thd0~0_Out-1118249315) (or (and .cse3 (= ~y~0_Out-1118249315 ~y$w_buff0~0_In-1118249315) .cse4) (and (or (and .cse0 (= ~y$w_buff1~0_In-1118249315 ~y~0_Out-1118249315) .cse1) (and (= ~y~0_Out-1118249315 ~y~0_In-1118249315) .cse2)) .cse5)) (= ~y$r_buff0_thd0~0_Out-1118249315 ~y$r_buff0_thd0~0_In-1118249315) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1118249315 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1118249315|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1118249315|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1118249315, ~y$w_buff1~0=~y$w_buff1~0_In-1118249315, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1118249315, ~y$w_buff0~0=~y$w_buff0~0_In-1118249315, ~y~0=~y~0_In-1118249315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1118249315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1118249315} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1118249315, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1118249315|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1118249315|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1118249315|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1118249315|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1118249315|, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1118249315|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1118249315|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1118249315, ~y$w_buff1~0=~y$w_buff1~0_In-1118249315, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1118249315, ~y$w_buff0~0=~y$w_buff0~0_In-1118249315, ~y~0=~y~0_Out-1118249315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1118249315, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1118249315} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-16 11:04:59,343 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,343 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,344 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,345 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,345 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,345 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,345 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,345 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,346 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,346 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,347 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,347 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,347 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,348 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,348 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,349 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,349 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,351 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,351 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,351 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,351 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,355 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,355 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,361 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:04:59,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:04:59,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:04:59 BasicIcfg
[2020-10-16 11:04:59,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:04:59,452 INFO L168 Benchmark]: Toolchain (without parser) took 11441.03 ms. Allocated memory was 137.4 MB in the beginning and 394.3 MB in the end (delta: 256.9 MB). Free memory was 99.2 MB in the beginning and 215.5 MB in the end (delta: -116.2 MB). Peak memory consumption was 140.7 MB. Max. memory is 7.1 GB.
[2020-10-16 11:04:59,453 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 137.4 MB. Free memory was 118.9 MB in the beginning and 118.5 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB.
[2020-10-16 11:04:59,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.43 ms. Allocated memory was 137.4 MB in the beginning and 203.4 MB in the end (delta: 66.1 MB). Free memory was 99.2 MB in the beginning and 157.2 MB in the end (delta: -58.0 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB.
[2020-10-16 11:04:59,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.02 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB.
[2020-10-16 11:04:59,455 INFO L168 Benchmark]: Boogie Preprocessor took 50.76 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB.
[2020-10-16 11:04:59,456 INFO L168 Benchmark]: RCFGBuilder took 2512.09 ms. Allocated memory was 203.4 MB in the beginning and 250.6 MB in the end (delta: 47.2 MB). Free memory was 152.1 MB in the beginning and 129.3 MB in the end (delta: 22.7 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:04:59,457 INFO L168 Benchmark]: TraceAbstraction took 7943.16 ms. Allocated memory was 250.6 MB in the beginning and 394.3 MB in the end (delta: 143.7 MB). Free memory was 127.2 MB in the beginning and 215.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB.
[2020-10-16 11:04:59,465 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.49 ms. Allocated memory is still 137.4 MB. Free memory was 118.9 MB in the beginning and 118.5 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 834.43 ms. Allocated memory was 137.4 MB in the beginning and 203.4 MB in the end (delta: 66.1 MB). Free memory was 99.2 MB in the beginning and 157.2 MB in the end (delta: -58.0 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 91.02 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 50.76 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 2512.09 ms. Allocated memory was 203.4 MB in the beginning and 250.6 MB in the end (delta: 47.2 MB). Free memory was 152.1 MB in the beginning and 129.3 MB in the end (delta: 22.7 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 7943.16 ms. Allocated memory was 250.6 MB in the beginning and 394.3 MB in the end (delta: 143.7 MB). Free memory was 127.2 MB in the beginning and 215.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
1174 VarBasedMoverChecksPositive, 76 VarBasedMoverChecksNegative, 8 SemBasedMoverChecksPositive, 68 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 134 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.8s, 106 PlacesBefore, 37 PlacesAfterwards, 98 TransitionsBefore, 27 TransitionsAfterwards, 1714 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, 4976 MoverChecksTotal
- CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L698] 0 int __unbuffered_cnt = 0;
[L700] 0 int __unbuffered_p0_EAX = 0;
[L702] 0 int __unbuffered_p0_EBX = 0;
[L704] 0 int __unbuffered_p1_EAX = 0;
[L706] 0 int __unbuffered_p1_EBX = 0;
[L708] 0 int __unbuffered_p2_EAX = 0;
[L710] 0 int __unbuffered_p2_EBX = 0;
[L711] 0 _Bool main$tmp_guard0;
[L712] 0 _Bool main$tmp_guard1;
[L714] 0 int x = 0;
[L716] 0 int y = 0;
[L717] 0 _Bool y$flush_delayed;
[L718] 0 int y$mem_tmp;
[L719] 0 _Bool y$r_buff0_thd0;
[L720] 0 _Bool y$r_buff0_thd1;
[L721] 0 _Bool y$r_buff0_thd2;
[L722] 0 _Bool y$r_buff0_thd3;
[L723] 0 _Bool y$r_buff1_thd0;
[L724] 0 _Bool y$r_buff1_thd1;
[L725] 0 _Bool y$r_buff1_thd2;
[L726] 0 _Bool y$r_buff1_thd3;
[L727] 0 _Bool y$read_delayed;
[L728] 0 int *y$read_delayed_var;
[L729] 0 int y$w_buff0;
[L730] 0 _Bool y$w_buff0_used;
[L731] 0 int y$w_buff1;
[L732] 0 _Bool y$w_buff1_used;
[L734] 0 int z = 0;
[L735] 0 _Bool weak$$choice0;
[L736] 0 _Bool weak$$choice2;
[L842] 0 pthread_t t17;
[L843] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L844] 0 pthread_t t18;
[L845] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L846] 0 pthread_t t19;
[L847] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L789] 3 y$w_buff1 = y$w_buff0
[L790] 3 y$w_buff0 = 1
[L791] 3 y$w_buff1_used = y$w_buff0_used
[L792] 3 y$w_buff0_used = (_Bool)1
[L7] COND TRUE 3 !expression
[L7] 3 __VERIFIER_error()
[L794] 3 y$r_buff1_thd0 = y$r_buff0_thd0
[L795] 3 y$r_buff1_thd1 = y$r_buff0_thd1
[L796] 3 y$r_buff1_thd2 = y$r_buff0_thd2
[L797] 3 y$r_buff1_thd3 = y$r_buff0_thd3
[L798] 3 y$r_buff0_thd3 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L801] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L802] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L803] 3 y$flush_delayed = weak$$choice2
[L804] 3 y$mem_tmp = y
[L805] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L805] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L806] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L806] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L806] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L806] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L807] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L807] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L808] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L808] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L809] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L809] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0
[L809] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L809] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L809] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L810] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L810] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L811] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L811] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L811] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L812] 3 __unbuffered_p2_EAX = y
[L813] EXPR 3 y$flush_delayed ? y$mem_tmp : y
[L813] 3 y = y$flush_delayed ? y$mem_tmp : y
[L814] 3 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L817] 3 __unbuffered_p2_EBX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L740] 1 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L743] 1 __unbuffered_p0_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L746] 1 __unbuffered_p0_EBX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L753] 1 return 0;
[L758] 2 x = 1
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L761] 2 __unbuffered_p1_EAX = x
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L764] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L765] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L766] 2 y$flush_delayed = weak$$choice2
[L767] 2 y$mem_tmp = y
[L768] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1
[L768] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L768] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L769] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L769] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L770] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L770] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L771] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L771] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)
[L771] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L771] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L772] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L772] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L773] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L773] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L774] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0
[L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L774] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L774] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L775] 2 __unbuffered_p1_EBX = y
[L776] EXPR 2 y$flush_delayed ? y$mem_tmp : y
[L776] 2 y = y$flush_delayed ? y$mem_tmp : y
[L777] 2 y$flush_delayed = (_Bool)0
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L820] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L820] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L820] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L820] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L821] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L821] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L822] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L823] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L824] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L827] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L829] 3 return 0;
[L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L784] 2 return 0;
[L849] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L860] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L7] COND TRUE 0 !expression
[L7] 0 __VERIFIER_error()
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 270 SDtfs, 229 SDslu, 404 SDs, 0 SdLazy, 142 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=937occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 12120 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...