/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/safe021_rmo.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:20:20,583 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:20:20,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:20:20,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:20:20,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:20:20,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:20:20,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:20:20,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:20:20,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:20:20,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:20:20,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:20:20,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:20:20,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:20:20,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:20:20,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:20:20,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:20:20,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:20:20,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:20:20,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:20:20,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:20:20,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:20:20,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:20:20,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:20:20,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:20:20,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:20:20,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:20:20,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:20:20,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:20:20,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:20:20,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:20:20,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:20:20,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:20:20,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:20:20,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:20:20,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:20:20,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:20:20,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:20:20,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:20:20,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:20:20,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:20:20,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:20:20,702 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:20:20,728 INFO L113 SettingsManager]: Loading preferences was successful
[2020-10-16 11:20:20,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:20:20,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:20:20,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-10-16 11:20:20,730 INFO L138 SettingsManager]: * Use SBE=true
[2020-10-16 11:20:20,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:20:20,731 INFO L138 SettingsManager]: * sizeof long=4
[2020-10-16 11:20:20,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-10-16 11:20:20,731 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-10-16 11:20:20,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-10-16 11:20:20,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:20:20,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:20:20,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:20:20,732 INFO L138 SettingsManager]: * sizeof long double=12
[2020-10-16 11:20:20,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-10-16 11:20:20,733 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-10-16 11:20:20,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:20:20,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:20:20,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-10-16 11:20:20,733 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-10-16 11:20:20,734 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-10-16 11:20:20,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:20:20,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:20:20,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:20:20,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:20:20,735 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-10-16 11:20:20,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:20:20,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:20:20,735 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2020-10-16 11:20:20,735 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:20:21,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:20:21,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:20:21,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:20:21,094 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-10-16 11:20:21,095 INFO L275 PluginConnector]: CDTParser initialized
[2020-10-16 11:20:21,096 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i
[2020-10-16 11:20:21,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b011f31e0/5fb38cb20af14dbf8a430d6e669a13e1/FLAG0afa2d52f
[2020-10-16 11:20:21,744 INFO L306 CDTParser]: Found 1 translation units.
[2020-10-16 11:20:21,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i
[2020-10-16 11:20:21,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b011f31e0/5fb38cb20af14dbf8a430d6e669a13e1/FLAG0afa2d52f
[2020-10-16 11:20:22,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b011f31e0/5fb38cb20af14dbf8a430d6e669a13e1
[2020-10-16 11:20:22,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:20:22,029 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:20:22,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:20:22,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:20:22,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:20:22,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:20:22" (1/1) ...
[2020-10-16 11:20:22,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4685141c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:20:22, skipping insertion in model container
[2020-10-16 11:20:22,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:20:22" (1/1) ...
[2020-10-16 11:20:22,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-10-16 11:20:22,096 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:20:22,760 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:20:22,785 INFO L203 MainTranslator]: Completed pre-run
[2020-10-16 11:20:22,842 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:20:22,918 INFO L208 MainTranslator]: Completed translation
[2020-10-16 11:20:22,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:20:22 WrapperNode
[2020-10-16 11:20:22,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:20:22,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:20:22,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:20:22,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:20:22,929 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:20:22" (1/1) ...
[2020-10-16 11:20:22,951 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:20:22" (1/1) ...
[2020-10-16 11:20:22,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:20:22,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:20:22,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:20:22,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:20:23,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:20:22" (1/1) ...
[2020-10-16 11:20:23,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:20:22" (1/1) ...
[2020-10-16 11:20:23,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:20:22" (1/1) ...
[2020-10-16 11:20:23,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:20:22" (1/1) ...
[2020-10-16 11:20:23,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:20:22" (1/1) ...
[2020-10-16 11:20:23,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:20:22" (1/1) ...
[2020-10-16 11:20:23,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:20:22" (1/1) ...
[2020-10-16 11:20:23,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:20:23,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:20:23,070 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:20:23,070 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:20:23,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:20:22" (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:20:23,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:20:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:20:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:20:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:20:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:20:23,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:20:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:20:23,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:20:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 11:20:23,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 11:20:23,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:20:23,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:20:23,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:20:23,153 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:20:25,394 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:20:25,394 INFO L298 CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:20:25,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:20:25 BoogieIcfgContainer
[2020-10-16 11:20:25,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:20:25,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:20:25,398 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:20:25,401 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:20:25,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:20:22" (1/3) ...
[2020-10-16 11:20:25,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4e32cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:20:25, skipping insertion in model container
[2020-10-16 11:20:25,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:20:22" (2/3) ...
[2020-10-16 11:20:25,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4e32cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:20:25, skipping insertion in model container
[2020-10-16 11:20:25,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:20:25" (3/3) ...
[2020-10-16 11:20:25,405 INFO L111 eAbstractionObserver]: Analyzing ICFG safe021_rmo.opt.i
[2020-10-16 11:20:25,417 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:20:25,417 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:20:25,425 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:20:25,426 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:20:25,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,464 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,465 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,465 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,465 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,468 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,469 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,471 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,472 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,487 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,487 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,488 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,496 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,497 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,501 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:20:25,508 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:20:25,523 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 11:20:25,546 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:20:25,547 INFO L378 AbstractCegarLoop]: Hoare is true
[2020-10-16 11:20:25,547 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:20:25,547 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:20:25,547 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:20:25,547 INFO L382 AbstractCegarLoop]: Difference is false
[2020-10-16 11:20:25,547 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:20:25,547 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:20:25,564 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:20:25,567 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow
[2020-10-16 11:20:25,571 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 201 flow
[2020-10-16 11:20:25,574 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow
[2020-10-16 11:20:25,622 INFO L129 PetriNetUnfolder]: 2/90 cut-off events.
[2020-10-16 11:20:25,622 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:20:25,627 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place.
[2020-10-16 11:20:25,631 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650
[2020-10-16 11:20:25,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:25,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:20:25,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:20:25,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:25,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:25,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:25,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:25,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:20:25,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:25,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:20:25,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:25,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:20:25,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:20:25,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:25,922 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:20:25,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:25,925 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:20:25,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:26,373 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:20:26,497 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 11:20:26,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:26,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:26,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:26,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:20:26,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:26,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:20:26,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:26,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:20:26,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:20:26,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:26,588 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:20:26,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:26,589 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:20:26,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:26,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:26,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:20:26,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:20:26,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:26,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:26,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:26,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:26,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:26,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:26,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:26,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:26,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:26,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:26,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:26,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:26,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:26,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:26,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:26,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:26,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,052 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41
[2020-10-16 11:20:27,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:27,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:27,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:27,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:27,932 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:20:28,076 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:20:28,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:20:28,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:28,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:20:28,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:28,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:20:28,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:28,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:20:28,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:20:28,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:28,636 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:20:28,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:28,638 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:20:28,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:28,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:28,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:20:28,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:20:28,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:28,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:28,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:28,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:20:28,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:20:28,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:20:28,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:29,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:29,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:20:29,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:20:29,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:29,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:20:29,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:20:29,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:29,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:20:29,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:29,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:20:29,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:20:29,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:20:29,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:20:29,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:29,103 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:20:29,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:29,105 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:20:29,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:20:30,322 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87
[2020-10-16 11:20:30,481 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2020-10-16 11:20:30,489 INFO L132 LiptonReduction]: Checked pairs total: 4302
[2020-10-16 11:20:30,489 INFO L134 LiptonReduction]: Total number of compositions: 79
[2020-10-16 11:20:30,497 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow
[2020-10-16 11:20:30,551 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states.
[2020-10-16 11:20:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states.
[2020-10-16 11:20:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-10-16 11:20:30,560 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:20:30,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-10-16 11:20:30,561 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:20:30,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:20:30,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1045970, now seen corresponding path program 1 times
[2020-10-16 11:20:30,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:20:30,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952591078]
[2020-10-16 11:20:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:20:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:20:30,795 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:20:30,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952591078]
[2020-10-16 11:20:30,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:20:30,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:20:30,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104354869]
[2020-10-16 11:20:30,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:20:30,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:20:30,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:20:30,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:20:30,823 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states.
[2020-10-16 11:20:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:20:30,927 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions.
[2020-10-16 11:20:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:20:30,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2020-10-16 11:20:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:20:30,955 INFO L225 Difference]: With dead ends: 687
[2020-10-16 11:20:30,955 INFO L226 Difference]: Without dead ends: 562
[2020-10-16 11:20:30,957 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:20:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states.
[2020-10-16 11:20:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562.
[2020-10-16 11:20:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states.
[2020-10-16 11:20:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions.
[2020-10-16 11:20:31,063 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3
[2020-10-16 11:20:31,063 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:20:31,063 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions.
[2020-10-16 11:20:31,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:20:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions.
[2020-10-16 11:20:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 11:20:31,065 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:20:31,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:20:31,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:20:31,066 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:20:31,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:20:31,066 INFO L82 PathProgramCache]: Analyzing trace with hash -786057852, now seen corresponding path program 1 times
[2020-10-16 11:20:31,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:20:31,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13493883]
[2020-10-16 11:20:31,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:20:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:20:31,172 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:20:31,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13493883]
[2020-10-16 11:20:31,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:20:31,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:20:31,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294381151]
[2020-10-16 11:20:31,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:20:31,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:20:31,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:20:31,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:20:31,179 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states.
[2020-10-16 11:20:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:20:31,192 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions.
[2020-10-16 11:20:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:20:31,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 11:20:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:20:31,200 INFO L225 Difference]: With dead ends: 552
[2020-10-16 11:20:31,200 INFO L226 Difference]: Without dead ends: 552
[2020-10-16 11:20:31,201 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:20:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2020-10-16 11:20:31,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552.
[2020-10-16 11:20:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states.
[2020-10-16 11:20:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions.
[2020-10-16 11:20:31,238 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9
[2020-10-16 11:20:31,239 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:20:31,239 INFO L481 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions.
[2020-10-16 11:20:31,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:20:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions.
[2020-10-16 11:20:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 11:20:31,241 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:20:31,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:20:31,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:20:31,242 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:20:31,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:20:31,243 INFO L82 PathProgramCache]: Analyzing trace with hash 473406567, now seen corresponding path program 1 times
[2020-10-16 11:20:31,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:20:31,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104490420]
[2020-10-16 11:20:31,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:20:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:20:31,342 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:20:31,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104490420]
[2020-10-16 11:20:31,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:20:31,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:20:31,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464101732]
[2020-10-16 11:20:31,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:20:31,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:20:31,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:20:31,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:20:31,345 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand 3 states.
[2020-10-16 11:20:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:20:31,361 INFO L93 Difference]: Finished difference Result 529 states and 1605 transitions.
[2020-10-16 11:20:31,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:20:31,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-10-16 11:20:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:20:31,372 INFO L225 Difference]: With dead ends: 529
[2020-10-16 11:20:31,372 INFO L226 Difference]: Without dead ends: 529
[2020-10-16 11:20:31,373 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:20:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states.
[2020-10-16 11:20:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529.
[2020-10-16 11:20:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states.
[2020-10-16 11:20:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1605 transitions.
[2020-10-16 11:20:31,396 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1605 transitions. Word has length 10
[2020-10-16 11:20:31,396 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:20:31,396 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 1605 transitions.
[2020-10-16 11:20:31,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:20:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1605 transitions.
[2020-10-16 11:20:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 11:20:31,399 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:20:31,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:20:31,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:20:31,400 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:20:31,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:20:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1790701156, now seen corresponding path program 1 times
[2020-10-16 11:20:31,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:20:31,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546055099]
[2020-10-16 11:20:31,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:20:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:20:31,455 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:20:31,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546055099]
[2020-10-16 11:20:31,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:20:31,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:20:31,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671593327]
[2020-10-16 11:20:31,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:20:31,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:20:31,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:20:31,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:20:31,458 INFO L87 Difference]: Start difference. First operand 529 states and 1605 transitions. Second operand 4 states.
[2020-10-16 11:20:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:20:31,487 INFO L93 Difference]: Finished difference Result 677 states and 2012 transitions.
[2020-10-16 11:20:31,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 11:20:31,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-16 11:20:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:20:31,490 INFO L225 Difference]: With dead ends: 677
[2020-10-16 11:20:31,491 INFO L226 Difference]: Without dead ends: 377
[2020-10-16 11:20:31,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:20:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states.
[2020-10-16 11:20:31,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377.
[2020-10-16 11:20:31,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states.
[2020-10-16 11:20:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1077 transitions.
[2020-10-16 11:20:31,511 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1077 transitions. Word has length 11
[2020-10-16 11:20:31,512 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:20:31,512 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 1077 transitions.
[2020-10-16 11:20:31,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:20:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1077 transitions.
[2020-10-16 11:20:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:20:31,519 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:20:31,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:20:31,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:20:31,520 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:20:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:20:31,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1732379942, now seen corresponding path program 1 times
[2020-10-16 11:20:31,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:20:31,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572363867]
[2020-10-16 11:20:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:20:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:20:31,621 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:20:31,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572363867]
[2020-10-16 11:20:31,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:20:31,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:20:31,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825869335]
[2020-10-16 11:20:31,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:20:31,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:20:31,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:20:31,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:20:31,624 INFO L87 Difference]: Start difference. First operand 377 states and 1077 transitions. Second operand 4 states.
[2020-10-16 11:20:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:20:31,687 INFO L93 Difference]: Finished difference Result 358 states and 905 transitions.
[2020-10-16 11:20:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-10-16 11:20:31,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-16 11:20:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:20:31,690 INFO L225 Difference]: With dead ends: 358
[2020-10-16 11:20:31,690 INFO L226 Difference]: Without dead ends: 273
[2020-10-16 11:20:31,691 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:20:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states.
[2020-10-16 11:20:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273.
[2020-10-16 11:20:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states.
[2020-10-16 11:20:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 677 transitions.
[2020-10-16 11:20:31,699 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 677 transitions. Word has length 12
[2020-10-16 11:20:31,700 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:20:31,700 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 677 transitions.
[2020-10-16 11:20:31,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:20:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 677 transitions.
[2020-10-16 11:20:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 11:20:31,701 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:20:31,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:20:31,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:20:31,702 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:20:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:20:31,702 INFO L82 PathProgramCache]: Analyzing trace with hash -624441276, now seen corresponding path program 1 times
[2020-10-16 11:20:31,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:20:31,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469923448]
[2020-10-16 11:20:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:20:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:20:31,806 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:20:31,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469923448]
[2020-10-16 11:20:31,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:20:31,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:20:31,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184190608]
[2020-10-16 11:20:31,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:20:31,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:20:31,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:20:31,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:20:31,809 INFO L87 Difference]: Start difference. First operand 273 states and 677 transitions. Second operand 5 states.
[2020-10-16 11:20:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:20:31,861 INFO L93 Difference]: Finished difference Result 224 states and 509 transitions.
[2020-10-16 11:20:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-10-16 11:20:31,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-16 11:20:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:20:31,864 INFO L225 Difference]: With dead ends: 224
[2020-10-16 11:20:31,864 INFO L226 Difference]: Without dead ends: 179
[2020-10-16 11:20:31,864 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:20:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states.
[2020-10-16 11:20:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179.
[2020-10-16 11:20:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states.
[2020-10-16 11:20:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 399 transitions.
[2020-10-16 11:20:31,871 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 399 transitions. Word has length 14
[2020-10-16 11:20:31,871 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:20:31,871 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 399 transitions.
[2020-10-16 11:20:31,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:20:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 399 transitions.
[2020-10-16 11:20:31,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:20:31,873 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:20:31,873 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:20:31,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:20:31,873 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:20:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:20:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1395899179, now seen corresponding path program 1 times
[2020-10-16 11:20:31,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:20:31,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501556437]
[2020-10-16 11:20:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:20:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:20:32,064 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:20:32,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501556437]
[2020-10-16 11:20:32,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:20:32,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:20:32,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893409320]
[2020-10-16 11:20:32,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:20:32,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:20:32,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:20:32,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:20:32,066 INFO L87 Difference]: Start difference. First operand 179 states and 399 transitions. Second operand 6 states.
[2020-10-16 11:20:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:20:32,125 INFO L93 Difference]: Finished difference Result 161 states and 361 transitions.
[2020-10-16 11:20:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-10-16 11:20:32,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2020-10-16 11:20:32,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:20:32,127 INFO L225 Difference]: With dead ends: 161
[2020-10-16 11:20:32,127 INFO L226 Difference]: Without dead ends: 150
[2020-10-16 11:20:32,127 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:20:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2020-10-16 11:20:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150.
[2020-10-16 11:20:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states.
[2020-10-16 11:20:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 341 transitions.
[2020-10-16 11:20:32,132 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 341 transitions. Word has length 17
[2020-10-16 11:20:32,133 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:20:32,133 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 341 transitions.
[2020-10-16 11:20:32,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:20:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 341 transitions.
[2020-10-16 11:20:32,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-16 11:20:32,134 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:20:32,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:20:32,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:20:32,135 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:20:32,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:20:32,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1859589091, now seen corresponding path program 1 times
[2020-10-16 11:20:32,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:20:32,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519801369]
[2020-10-16 11:20:32,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:20:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:20:32,496 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:20:32,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519801369]
[2020-10-16 11:20:32,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:20:32,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:20:32,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102441438]
[2020-10-16 11:20:32,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:20:32,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:20:32,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:20:32,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:20:32,499 INFO L87 Difference]: Start difference. First operand 150 states and 341 transitions. Second operand 7 states.
[2020-10-16 11:20:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:20:32,761 INFO L93 Difference]: Finished difference Result 229 states and 497 transitions.
[2020-10-16 11:20:32,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-10-16 11:20:32,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21
[2020-10-16 11:20:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:20:32,764 INFO L225 Difference]: With dead ends: 229
[2020-10-16 11:20:32,764 INFO L226 Difference]: Without dead ends: 169
[2020-10-16 11:20:32,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:20:32,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2020-10-16 11:20:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 142.
[2020-10-16 11:20:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states.
[2020-10-16 11:20:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 309 transitions.
[2020-10-16 11:20:32,772 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 309 transitions. Word has length 21
[2020-10-16 11:20:32,772 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:20:32,773 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 309 transitions.
[2020-10-16 11:20:32,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:20:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 309 transitions.
[2020-10-16 11:20:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-16 11:20:32,774 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:20:32,774 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:20:32,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:20:32,774 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:20:32,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:20:32,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1378415041, now seen corresponding path program 2 times
[2020-10-16 11:20:32,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:20:32,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897947033]
[2020-10-16 11:20:32,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:20:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:20:32,856 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:20:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:20:32,900 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:20:32,943 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:20:32,944 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:20:32,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:20:32,945 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 11:20:32,958 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L831-->L838: Formula: (let ((.cse6 (= (mod ~z$r_buff0_thd0~0_In-2022272685 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-2022272685 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-2022272685 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-2022272685 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-2022272685| ULTIMATE.start_assume_abort_if_not_~cond_Out-2022272685) (or (and .cse0 (= ~z~0_Out-2022272685 ~z$w_buff0~0_In-2022272685) .cse1) (and .cse2 (or (and .cse3 .cse4 (= ~z$w_buff1~0_In-2022272685 ~z~0_Out-2022272685)) (and (= ~z~0_In-2022272685 ~z~0_Out-2022272685) .cse5)))) (= ~z$r_buff1_thd0~0_In-2022272685 ~z$r_buff1_thd0~0_Out-2022272685) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2022272685 0)) (or (and .cse3 .cse4 (= ~z$w_buff1_used~0_Out-2022272685 0)) (and .cse5 (= ~z$w_buff1_used~0_Out-2022272685 ~z$w_buff1_used~0_In-2022272685))) (or (and .cse0 (= ~z$w_buff0_used~0_Out-2022272685 0) .cse1) (and (= ~z$w_buff0_used~0_In-2022272685 ~z$w_buff0_used~0_Out-2022272685) .cse2)) (= ~z$r_buff0_thd0~0_Out-2022272685 ~z$r_buff0_thd0~0_In-2022272685)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2022272685|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2022272685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2022272685, ~z$w_buff0~0=~z$w_buff0~0_In-2022272685, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2022272685, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2022272685, ~z$w_buff1~0=~z$w_buff1~0_In-2022272685, ~z~0=~z~0_In-2022272685} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2022272685, ~z$w_buff0~0=~z$w_buff0~0_In-2022272685, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2022272685, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2022272685|, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2022272685|, ~z$w_buff1~0=~z$w_buff1~0_In-2022272685, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2022272685|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-2022272685|, ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2022272685|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2022272685|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-2022272685, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2022272685|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-2022272685, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-2022272685, ~z~0=~z~0_Out-2022272685} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge
[2020-10-16 11:20:32,962 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:20:32,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,964 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:20:32,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,965 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:20:32,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,965 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:20:32,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,966 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:20:32,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,966 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:20:32,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,967 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:20:32,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,968 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:20:32,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,968 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:20:32,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,968 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:20:32,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,969 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:20:32,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,969 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:20:32,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,970 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:20:32,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,970 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:20:32,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,970 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:20:32,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,971 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:20:32,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,971 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:20:32,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,971 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:20:32,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,972 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:20:32,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,972 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:20:32,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,972 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:20:32,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,973 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:20:32,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,973 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:20:32,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,973 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:20:32,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,974 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:20:32,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,974 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:20:32,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,974 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:20:32,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,975 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:20:32,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,975 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:20:32,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,975 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:20:32,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:32,976 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:20:32,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:20:33,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:20:33 BasicIcfg
[2020-10-16 11:20:33,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:20:33,031 INFO L168 Benchmark]: Toolchain (without parser) took 11002.23 ms. Allocated memory was 137.9 MB in the beginning and 343.9 MB in the end (delta: 206.0 MB). Free memory was 99.3 MB in the beginning and 171.2 MB in the end (delta: -71.8 MB). Peak memory consumption was 134.2 MB. Max. memory is 7.1 GB.
[2020-10-16 11:20:33,032 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.0 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB.
[2020-10-16 11:20:33,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.59 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 98.9 MB in the beginning and 155.8 MB in the end (delta: -56.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB.
[2020-10-16 11:20:33,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.14 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB.
[2020-10-16 11:20:33,034 INFO L168 Benchmark]: Boogie Preprocessor took 67.44 ms. Allocated memory is still 201.3 MB. Free memory was 152.8 MB in the beginning and 149.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB.
[2020-10-16 11:20:33,035 INFO L168 Benchmark]: RCFGBuilder took 2327.24 ms. Allocated memory was 201.3 MB in the beginning and 252.2 MB in the end (delta: 50.9 MB). Free memory was 149.8 MB in the beginning and 181.2 MB in the end (delta: -31.4 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB.
[2020-10-16 11:20:33,035 INFO L168 Benchmark]: TraceAbstraction took 7631.42 ms. Allocated memory was 252.2 MB in the beginning and 343.9 MB in the end (delta: 91.8 MB). Free memory was 181.2 MB in the beginning and 171.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 101.8 MB. Max. memory is 7.1 GB.
[2020-10-16 11:20:33,040 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.58 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.0 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 888.59 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 98.9 MB in the beginning and 155.8 MB in the end (delta: -56.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 70.14 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 67.44 ms. Allocated memory is still 201.3 MB. Free memory was 152.8 MB in the beginning and 149.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 2327.24 ms. Allocated memory was 201.3 MB in the beginning and 252.2 MB in the end (delta: 50.9 MB). Free memory was 149.8 MB in the beginning and 181.2 MB in the end (delta: -31.4 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 7631.42 ms. Allocated memory was 252.2 MB in the beginning and 343.9 MB in the end (delta: 91.8 MB). Free memory was 181.2 MB in the beginning and 171.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 101.8 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
1112 VarBasedMoverChecksPositive, 57 VarBasedMoverChecksNegative, 10 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 121 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.9s, 101 PlacesBefore, 36 PlacesAfterwards, 93 TransitionsBefore, 26 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 4302 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_p2_EAX = 0;
[L702] 0 int __unbuffered_p2_EBX = 0;
[L703] 0 _Bool main$tmp_guard0;
[L704] 0 _Bool main$tmp_guard1;
[L706] 0 int x = 0;
[L708] 0 int y = 0;
[L710] 0 int z = 0;
[L711] 0 _Bool z$flush_delayed;
[L712] 0 int z$mem_tmp;
[L713] 0 _Bool z$r_buff0_thd0;
[L714] 0 _Bool z$r_buff0_thd1;
[L715] 0 _Bool z$r_buff0_thd2;
[L716] 0 _Bool z$r_buff0_thd3;
[L717] 0 _Bool z$r_buff1_thd0;
[L718] 0 _Bool z$r_buff1_thd1;
[L719] 0 _Bool z$r_buff1_thd2;
[L720] 0 _Bool z$r_buff1_thd3;
[L721] 0 _Bool z$read_delayed;
[L722] 0 int *z$read_delayed_var;
[L723] 0 int z$w_buff0;
[L724] 0 _Bool z$w_buff0_used;
[L725] 0 int z$w_buff1;
[L726] 0 _Bool z$w_buff1_used;
[L727] 0 _Bool weak$$choice0;
[L728] 0 _Bool weak$$choice2;
[L822] 0 pthread_t t2296;
[L823] FCALL, FORK 0 pthread_create(&t2296, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L732] 1 z$w_buff1 = z$w_buff0
[L733] 1 z$w_buff0 = 1
[L734] 1 z$w_buff1_used = z$w_buff0_used
[L735] 1 z$w_buff0_used = (_Bool)1
[L7] COND TRUE 1 !expression
[L7] 1 __VERIFIER_error()
[L737] 1 z$r_buff1_thd0 = z$r_buff0_thd0
[L738] 1 z$r_buff1_thd1 = z$r_buff0_thd1
[L739] 1 z$r_buff1_thd2 = z$r_buff0_thd2
[L740] 1 z$r_buff1_thd3 = z$r_buff0_thd3
[L741] 1 z$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L744] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L824] 0 pthread_t t2297;
[L825] FCALL, FORK 0 pthread_create(&t2297, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L761] 2 x = 2
VAL [__unbuffered_cnt=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L764] 2 y = 1
VAL [__unbuffered_cnt=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L767] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L768] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L769] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L770] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L770] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L771] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L771] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L826] 0 pthread_t t2298;
[L827] FCALL, FORK 0 pthread_create(&t2298, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L781] 3 __unbuffered_p2_EAX = y
VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L776] 2 return 0;
[L784] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L785] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L786] 3 z$flush_delayed = weak$$choice2
[L787] 3 z$mem_tmp = z
[L788] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L788] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L789] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)
[L789] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L789] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L790] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)
[L790] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L790] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L791] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)
[L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)
[L791] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L791] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L792] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0
[L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L792] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L792] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L793] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L793] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L794] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L794] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L794] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L795] 3 __unbuffered_p2_EBX = z
[L796] EXPR 3 z$flush_delayed ? z$mem_tmp : z
[L796] 3 z = z$flush_delayed ? z$mem_tmp : z
[L797] 3 z$flush_delayed = (_Bool)0
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L800] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L801] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L802] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L803] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L803] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L804] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L804] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L747] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L748] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L749] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L750] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L751] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L756] 1 return 0;
[L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L809] 3 return 0;
[L829] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L840] 0 main$tmp_guard1 = !(x == 2 && __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_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=7, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 191 SDtfs, 218 SDslu, 346 SDs, 0 SdLazy, 163 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 27 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 8263 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...