/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-98707888a4ba860d5b57d27ee0e051c5b948cbbf-9870788
[2021-06-01 16:23:33,012 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-06-01 16:23:33,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-01 16:23:33,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-01 16:23:33,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-01 16:23:33,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-01 16:23:33,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-01 16:23:33,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-01 16:23:33,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-01 16:23:33,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-01 16:23:33,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-06-01 16:23:33,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-01 16:23:33,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-01 16:23:33,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-01 16:23:33,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-01 16:23:33,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-01 16:23:33,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-01 16:23:33,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-01 16:23:33,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-01 16:23:33,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-01 16:23:33,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-01 16:23:33,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-01 16:23:33,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-06-01 16:23:33,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-01 16:23:33,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-01 16:23:33,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-01 16:23:33,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-01 16:23:33,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-01 16:23:33,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-01 16:23:33,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-01 16:23:33,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-01 16:23:33,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-01 16:23:33,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-01 16:23:33,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-01 16:23:33,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-01 16:23:33,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-01 16:23:33,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-01 16:23:33,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-01 16:23:33,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-01 16:23:33,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-01 16:23:33,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-06-01 16:23:33,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf
[2021-06-01 16:23:33,140 INFO L113 SettingsManager]: Loading preferences was successful
[2021-06-01 16:23:33,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-01 16:23:33,141 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-06-01 16:23:33,141 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-06-01 16:23:33,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-01 16:23:33,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-06-01 16:23:33,144 INFO L138 SettingsManager]: * Use SBE=true
[2021-06-01 16:23:33,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-01 16:23:33,144 INFO L138 SettingsManager]: * sizeof long=4
[2021-06-01 16:23:33,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-06-01 16:23:33,145 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-06-01 16:23:33,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-06-01 16:23:33,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-06-01 16:23:33,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-01 16:23:33,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-06-01 16:23:33,146 INFO L138 SettingsManager]: * sizeof long double=12
[2021-06-01 16:23:33,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-06-01 16:23:33,146 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-06-01 16:23:33,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-06-01 16:23:33,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-01 16:23:33,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-06-01 16:23:33,147 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-06-01 16:23:33,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-06-01 16:23:33,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 16:23:33,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-01 16:23:33,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-06-01 16:23:33,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-01 16:23:33,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-06-01 16:23:33,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-01 16:23:33,148 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2021-06-01 16:23:33,148 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-06-01 16:23:33,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-06-01 16:23:33,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-01 16:23:33,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-01 16:23:33,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-01 16:23:33,502 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-06-01 16:23:33,503 INFO L275 PluginConnector]: CDTParser initialized
[2021-06-01 16:23:33,504 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i
[2021-06-01 16:23:33,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a1bc696/29f4e9e4eddd4a368522d7baf6e1f220/FLAGf1d4f07cf
[2021-06-01 16:23:34,109 INFO L306 CDTParser]: Found 1 translation units.
[2021-06-01 16:23:34,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i
[2021-06-01 16:23:34,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a1bc696/29f4e9e4eddd4a368522d7baf6e1f220/FLAGf1d4f07cf
[2021-06-01 16:23:34,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a1bc696/29f4e9e4eddd4a368522d7baf6e1f220
[2021-06-01 16:23:34,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-01 16:23:34,397 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-01 16:23:34,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-01 16:23:34,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-01 16:23:34,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-01 16:23:34,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 04:23:34" (1/1) ...
[2021-06-01 16:23:34,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6222a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:34, skipping insertion in model container
[2021-06-01 16:23:34,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 04:23:34" (1/1) ...
[2021-06-01 16:23:34,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-06-01 16:23:34,468 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-06-01 16:23:34,663 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i[948,961]
[2021-06-01 16:23:34,869 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-01 16:23:34,876 INFO L203 MainTranslator]: Completed pre-run
[2021-06-01 16:23:34,887 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i[948,961]
[2021-06-01 16:23:34,934 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-01 16:23:35,008 INFO L208 MainTranslator]: Completed translation
[2021-06-01 16:23:35,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:35 WrapperNode
[2021-06-01 16:23:35,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-01 16:23:35,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-01 16:23:35,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-01 16:23:35,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-01 16:23:35,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:35" (1/1) ...
[2021-06-01 16:23:35,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:35" (1/1) ...
[2021-06-01 16:23:35,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-01 16:23:35,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-01 16:23:35,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-01 16:23:35,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-06-01 16:23:35,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:35" (1/1) ...
[2021-06-01 16:23:35,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:35" (1/1) ...
[2021-06-01 16:23:35,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:35" (1/1) ...
[2021-06-01 16:23:35,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:35" (1/1) ...
[2021-06-01 16:23:35,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:35" (1/1) ...
[2021-06-01 16:23:35,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:35" (1/1) ...
[2021-06-01 16:23:35,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:35" (1/1) ...
[2021-06-01 16:23:35,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-01 16:23:35,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-01 16:23:35,115 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-06-01 16:23:35,116 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-06-01 16:23:35,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:35" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 16:23:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-06-01 16:23:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-01 16:23:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-01 16:23:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-01 16:23:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-06-01 16:23:35,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-06-01 16:23:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-06-01 16:23:35,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-06-01 16:23:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-06-01 16:23:35,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-06-01 16:23:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2021-06-01 16:23:35,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2021-06-01 16:23:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-01 16:23:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-01 16:23:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-01 16:23:35,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-01 16:23:35,205 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-01 16:23:36,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-01 16:23:36,782 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-01 16:23:36,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 04:23:36 BoogieIcfgContainer
[2021-06-01 16:23:36,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-01 16:23:36,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-01 16:23:36,785 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-06-01 16:23:36,787 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-06-01 16:23:36,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.06 04:23:34" (1/3) ...
[2021-06-01 16:23:36,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13eecb19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 04:23:36, skipping insertion in model container
[2021-06-01 16:23:36,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:23:35" (2/3) ...
[2021-06-01 16:23:36,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13eecb19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 04:23:36, skipping insertion in model container
[2021-06-01 16:23:36,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 04:23:36" (3/3) ...
[2021-06-01 16:23:36,789 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.opt.i
[2021-06-01 16:23:36,795 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-06-01 16:23:36,795 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-01 16:23:36,795 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-06-01 16:23:36,796 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-01 16:23:36,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,827 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,828 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,828 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,828 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,829 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,829 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,829 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,830 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,831 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,831 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,832 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,832 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,835 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,835 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,836 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,836 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,836 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,836 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,837 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,837 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,842 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,844 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,844 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,845 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,845 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,846 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,850 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,851 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,858 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,858 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,862 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,862 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:23:36,863 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-01 16:23:36,883 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 16:23:36,897 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:23:36,897 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 16:23:36,897 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:23:36,897 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:23:36,897 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:23:36,897 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 16:23:36,897 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:23:36,897 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P3========
[2021-06-01 16:23:36,907 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 135 places, 124 transitions, 268 flow
[2021-06-01 16:23:54,895 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:23:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:23:55,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 16:23:55,617 INFO L301 ceAbstractionStarter]: Result for error location P3 was SAFE (1/3)
[2021-06-01 16:23:55,620 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2021-06-01 16:23:55,632 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:23:55,633 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 16:23:55,633 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:23:55,633 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:23:55,633 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:23:55,633 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 16:23:55,633 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:23:55,633 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start========
[2021-06-01 16:23:55,637 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 135 places, 124 transitions, 268 flow
[2021-06-01 16:24:12,580 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:12,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2021-06-01 16:24:12,808 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:12,809 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:12,810 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash -715615938, now seen corresponding path program 1 times
[2021-06-01 16:24:12,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:12,824 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817630075]
[2021-06-01 16:24:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:13,521 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:13,521 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817630075]
[2021-06-01 16:24:13,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817630075] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:13,523 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:13,523 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:24:13,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201692520]
[2021-06-01 16:24:13,527 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:24:13,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:13,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:24:13,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:24:13,692 INFO L87 Difference]: Start difference. First operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:15,470 INFO L93 Difference]: Finished difference Result 151606 states and 667099 transitions.
[2021-06-01 16:24:15,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 16:24:15,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2021-06-01 16:24:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:15,946 INFO L225 Difference]: With dead ends: 151606
[2021-06-01 16:24:15,946 INFO L226 Difference]: Without dead ends: 53830
[2021-06-01 16:24:15,947 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 88.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:24:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53830 states.
[2021-06-01 16:24:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53830 to 53830.
[2021-06-01 16:24:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53830 states, 53828 states have (on average 4.339860295756855) internal successors, (233606), 53829 states have internal predecessors, (233606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53830 states to 53830 states and 233606 transitions.
[2021-06-01 16:24:18,539 INFO L78 Accepts]: Start accepts. Automaton has 53830 states and 233606 transitions. Word has length 77
[2021-06-01 16:24:18,540 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:18,540 INFO L482 AbstractCegarLoop]: Abstraction has 53830 states and 233606 transitions.
[2021-06-01 16:24:18,540 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 53830 states and 233606 transitions.
[2021-06-01 16:24:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2021-06-01 16:24:18,610 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:18,611 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:18,611 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-01 16:24:18,611 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:18,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:18,612 INFO L82 PathProgramCache]: Analyzing trace with hash 114274397, now seen corresponding path program 1 times
[2021-06-01 16:24:18,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:18,612 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129076640]
[2021-06-01 16:24:18,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:19,175 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:19,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129076640]
[2021-06-01 16:24:19,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129076640] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:19,175 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:19,175 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:24:19,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073370553]
[2021-06-01 16:24:19,177 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:24:19,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:19,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:24:19,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:24:19,179 INFO L87 Difference]: Start difference. First operand 53830 states and 233606 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:19,856 INFO L93 Difference]: Finished difference Result 62470 states and 269060 transitions.
[2021-06-01 16:24:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 16:24:19,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2021-06-01 16:24:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:20,167 INFO L225 Difference]: With dead ends: 62470
[2021-06-01 16:24:20,167 INFO L226 Difference]: Without dead ends: 51886
[2021-06-01 16:24:20,168 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 93.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:24:20,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51886 states.
[2021-06-01 16:24:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51886 to 51886.
[2021-06-01 16:24:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51886 states, 51884 states have (on average 4.325533883278082) internal successors, (224426), 51885 states have internal predecessors, (224426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51886 states to 51886 states and 224426 transitions.
[2021-06-01 16:24:22,616 INFO L78 Accepts]: Start accepts. Automaton has 51886 states and 224426 transitions. Word has length 79
[2021-06-01 16:24:22,617 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:22,617 INFO L482 AbstractCegarLoop]: Abstraction has 51886 states and 224426 transitions.
[2021-06-01 16:24:22,617 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 51886 states and 224426 transitions.
[2021-06-01 16:24:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2021-06-01 16:24:22,673 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:22,674 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:22,674 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-01 16:24:22,675 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:22,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:22,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1940160349, now seen corresponding path program 1 times
[2021-06-01 16:24:22,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:22,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197952312]
[2021-06-01 16:24:22,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:22,783 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:22,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197952312]
[2021-06-01 16:24:22,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197952312] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:22,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:22,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:24:22,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465265941]
[2021-06-01 16:24:22,784 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:24:22,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:22,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:24:22,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:24:22,784 INFO L87 Difference]: Start difference. First operand 51886 states and 224426 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:23,739 INFO L93 Difference]: Finished difference Result 86830 states and 369962 transitions.
[2021-06-01 16:24:23,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 16:24:23,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2021-06-01 16:24:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:23,967 INFO L225 Difference]: With dead ends: 86830
[2021-06-01 16:24:23,968 INFO L226 Difference]: Without dead ends: 57934
[2021-06-01 16:24:23,968 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 91.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:24:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57934 states.
[2021-06-01 16:24:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57934 to 48862.
[2021-06-01 16:24:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48862 states, 48860 states have (on average 4.239336880884159) internal successors, (207134), 48861 states have internal predecessors, (207134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48862 states to 48862 states and 207134 transitions.
[2021-06-01 16:24:26,209 INFO L78 Accepts]: Start accepts. Automaton has 48862 states and 207134 transitions. Word has length 80
[2021-06-01 16:24:26,209 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:26,209 INFO L482 AbstractCegarLoop]: Abstraction has 48862 states and 207134 transitions.
[2021-06-01 16:24:26,210 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 48862 states and 207134 transitions.
[2021-06-01 16:24:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2021-06-01 16:24:26,273 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:26,273 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:26,273 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-01 16:24:26,274 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:26,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:26,274 INFO L82 PathProgramCache]: Analyzing trace with hash -849332228, now seen corresponding path program 1 times
[2021-06-01 16:24:26,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:26,274 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991457757]
[2021-06-01 16:24:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:26,458 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:26,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991457757]
[2021-06-01 16:24:26,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991457757] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:26,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:26,461 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-06-01 16:24:26,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307497339]
[2021-06-01 16:24:26,462 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-06-01 16:24:26,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-06-01 16:24:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:24:26,463 INFO L87 Difference]: Start difference. First operand 48862 states and 207134 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:27,352 INFO L93 Difference]: Finished difference Result 56175 states and 236492 transitions.
[2021-06-01 16:24:27,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2021-06-01 16:24:27,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2021-06-01 16:24:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:27,630 INFO L225 Difference]: With dead ends: 56175
[2021-06-01 16:24:27,630 INFO L226 Difference]: Without dead ends: 47059
[2021-06-01 16:24:27,631 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 190.9ms TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342
[2021-06-01 16:24:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47059 states.
[2021-06-01 16:24:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47059 to 46765.
[2021-06-01 16:24:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46765 states, 46763 states have (on average 4.223189273570986) internal successors, (197489), 46764 states have internal predecessors, (197489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46765 states to 46765 states and 197489 transitions.
[2021-06-01 16:24:29,020 INFO L78 Accepts]: Start accepts. Automaton has 46765 states and 197489 transitions. Word has length 81
[2021-06-01 16:24:29,021 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:29,021 INFO L482 AbstractCegarLoop]: Abstraction has 46765 states and 197489 transitions.
[2021-06-01 16:24:29,021 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 46765 states and 197489 transitions.
[2021-06-01 16:24:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2021-06-01 16:24:29,092 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:29,092 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:29,092 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-01 16:24:29,092 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:29,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1733770590, now seen corresponding path program 1 times
[2021-06-01 16:24:29,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:29,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822802872]
[2021-06-01 16:24:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:29,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:29,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822802872]
[2021-06-01 16:24:29,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822802872] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:29,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:29,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-01 16:24:29,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870896820]
[2021-06-01 16:24:29,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-01 16:24:29,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:29,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-01 16:24:29,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2021-06-01 16:24:29,315 INFO L87 Difference]: Start difference. First operand 46765 states and 197489 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:30,320 INFO L93 Difference]: Finished difference Result 49634 states and 208201 transitions.
[2021-06-01 16:24:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2021-06-01 16:24:30,321 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82
[2021-06-01 16:24:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:30,476 INFO L225 Difference]: With dead ends: 49634
[2021-06-01 16:24:30,477 INFO L226 Difference]: Without dead ends: 42754
[2021-06-01 16:24:30,477 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 175.8ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272
[2021-06-01 16:24:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42754 states.
[2021-06-01 16:24:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42754 to 42754.
[2021-06-01 16:24:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42754 states, 42753 states have (on average 4.208149135733165) internal successors, (179911), 42753 states have internal predecessors, (179911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42754 states to 42754 states and 179911 transitions.
[2021-06-01 16:24:31,726 INFO L78 Accepts]: Start accepts. Automaton has 42754 states and 179911 transitions. Word has length 82
[2021-06-01 16:24:31,726 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:31,726 INFO L482 AbstractCegarLoop]: Abstraction has 42754 states and 179911 transitions.
[2021-06-01 16:24:31,726 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 42754 states and 179911 transitions.
[2021-06-01 16:24:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2021-06-01 16:24:31,780 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:31,780 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:31,780 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-01 16:24:31,780 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:31,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:31,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1124645029, now seen corresponding path program 1 times
[2021-06-01 16:24:31,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:31,780 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517240163]
[2021-06-01 16:24:31,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:32,043 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:32,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517240163]
[2021-06-01 16:24:32,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517240163] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:32,043 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:32,043 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-01 16:24:32,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952496516]
[2021-06-01 16:24:32,044 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-01 16:24:32,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:32,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-01 16:24:32,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2021-06-01 16:24:32,044 INFO L87 Difference]: Start difference. First operand 42754 states and 179911 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:33,022 INFO L93 Difference]: Finished difference Result 46194 states and 193411 transitions.
[2021-06-01 16:24:33,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2021-06-01 16:24:33,023 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83
[2021-06-01 16:24:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:33,150 INFO L225 Difference]: With dead ends: 46194
[2021-06-01 16:24:33,150 INFO L226 Difference]: Without dead ends: 40690
[2021-06-01 16:24:33,150 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 208.0ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342
[2021-06-01 16:24:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40690 states.
[2021-06-01 16:24:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40690 to 40690.
[2021-06-01 16:24:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40690 states, 40689 states have (on average 4.197178598638453) internal successors, (170779), 40689 states have internal predecessors, (170779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40690 states to 40690 states and 170779 transitions.
[2021-06-01 16:24:34,412 INFO L78 Accepts]: Start accepts. Automaton has 40690 states and 170779 transitions. Word has length 83
[2021-06-01 16:24:34,412 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:34,412 INFO L482 AbstractCegarLoop]: Abstraction has 40690 states and 170779 transitions.
[2021-06-01 16:24:34,412 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 40690 states and 170779 transitions.
[2021-06-01 16:24:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2021-06-01 16:24:34,471 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:34,471 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:34,471 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-01 16:24:34,471 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:34,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:34,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2019794338, now seen corresponding path program 1 times
[2021-06-01 16:24:34,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:34,472 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895533670]
[2021-06-01 16:24:34,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:34,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:34,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895533670]
[2021-06-01 16:24:34,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895533670] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:34,684 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:34,684 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:24:34,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346199376]
[2021-06-01 16:24:34,684 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:24:34,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:34,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:24:34,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:24:34,685 INFO L87 Difference]: Start difference. First operand 40690 states and 170779 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:35,150 INFO L93 Difference]: Finished difference Result 46366 states and 193785 transitions.
[2021-06-01 16:24:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-06-01 16:24:35,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83
[2021-06-01 16:24:35,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:35,272 INFO L225 Difference]: With dead ends: 46366
[2021-06-01 16:24:35,273 INFO L226 Difference]: Without dead ends: 40174
[2021-06-01 16:24:35,273 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 180.9ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272
[2021-06-01 16:24:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40174 states.
[2021-06-01 16:24:36,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40174 to 40174.
[2021-06-01 16:24:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40174 states, 40173 states have (on average 4.1910487143106065) internal successors, (168367), 40173 states have internal predecessors, (168367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40174 states to 40174 states and 168367 transitions.
[2021-06-01 16:24:36,603 INFO L78 Accepts]: Start accepts. Automaton has 40174 states and 168367 transitions. Word has length 83
[2021-06-01 16:24:36,604 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:36,604 INFO L482 AbstractCegarLoop]: Abstraction has 40174 states and 168367 transitions.
[2021-06-01 16:24:36,604 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 40174 states and 168367 transitions.
[2021-06-01 16:24:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-01 16:24:37,071 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:37,072 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:37,072 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-01 16:24:37,072 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1561535612, now seen corresponding path program 1 times
[2021-06-01 16:24:37,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:37,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219871260]
[2021-06-01 16:24:37,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:37,270 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:37,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219871260]
[2021-06-01 16:24:37,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219871260] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:37,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:37,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-06-01 16:24:37,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881447161]
[2021-06-01 16:24:37,271 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-06-01 16:24:37,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:37,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-06-01 16:24:37,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:24:37,272 INFO L87 Difference]: Start difference. First operand 40174 states and 168367 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:37,817 INFO L93 Difference]: Finished difference Result 51218 states and 214617 transitions.
[2021-06-01 16:24:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2021-06-01 16:24:37,818 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2021-06-01 16:24:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:37,938 INFO L225 Difference]: With dead ends: 51218
[2021-06-01 16:24:37,938 INFO L226 Difference]: Without dead ends: 44682
[2021-06-01 16:24:37,938 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 173.9ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306
[2021-06-01 16:24:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44682 states.
[2021-06-01 16:24:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44682 to 44584.
[2021-06-01 16:24:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44584 states, 44583 states have (on average 4.197900545050804) internal successors, (187155), 44583 states have internal predecessors, (187155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44584 states to 44584 states and 187155 transitions.
[2021-06-01 16:24:39,397 INFO L78 Accepts]: Start accepts. Automaton has 44584 states and 187155 transitions. Word has length 84
[2021-06-01 16:24:39,397 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:39,397 INFO L482 AbstractCegarLoop]: Abstraction has 44584 states and 187155 transitions.
[2021-06-01 16:24:39,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 44584 states and 187155 transitions.
[2021-06-01 16:24:39,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-01 16:24:39,463 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:39,463 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:39,463 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-01 16:24:39,463 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:39,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:39,464 INFO L82 PathProgramCache]: Analyzing trace with hash -458379468, now seen corresponding path program 2 times
[2021-06-01 16:24:39,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:39,464 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982828465]
[2021-06-01 16:24:39,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:39,610 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:39,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982828465]
[2021-06-01 16:24:39,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982828465] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:39,611 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:39,611 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:24:39,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458432988]
[2021-06-01 16:24:39,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:24:39,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:39,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:24:39,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:24:39,612 INFO L87 Difference]: Start difference. First operand 44584 states and 187155 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:40,599 INFO L93 Difference]: Finished difference Result 52834 states and 221222 transitions.
[2021-06-01 16:24:40,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-06-01 16:24:40,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2021-06-01 16:24:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:40,741 INFO L225 Difference]: With dead ends: 52834
[2021-06-01 16:24:40,741 INFO L226 Difference]: Without dead ends: 47674
[2021-06-01 16:24:40,741 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 133.0ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210
[2021-06-01 16:24:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47674 states.
[2021-06-01 16:24:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47674 to 44780.
[2021-06-01 16:24:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44780 states, 44779 states have (on average 4.194064181870966) internal successors, (187806), 44779 states have internal predecessors, (187806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44780 states to 44780 states and 187806 transitions.
[2021-06-01 16:24:42,433 INFO L78 Accepts]: Start accepts. Automaton has 44780 states and 187806 transitions. Word has length 84
[2021-06-01 16:24:42,434 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:42,434 INFO L482 AbstractCegarLoop]: Abstraction has 44780 states and 187806 transitions.
[2021-06-01 16:24:42,434 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 44780 states and 187806 transitions.
[2021-06-01 16:24:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-01 16:24:42,498 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:42,498 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:42,498 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-01 16:24:42,498 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1886868052, now seen corresponding path program 3 times
[2021-06-01 16:24:42,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:42,499 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041909405]
[2021-06-01 16:24:42,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:42,634 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:42,634 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041909405]
[2021-06-01 16:24:42,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041909405] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:42,635 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:42,635 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:24:42,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832376470]
[2021-06-01 16:24:42,635 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:24:42,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:42,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:24:42,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:24:42,635 INFO L87 Difference]: Start difference. First operand 44780 states and 187806 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:43,602 INFO L93 Difference]: Finished difference Result 53006 states and 221633 transitions.
[2021-06-01 16:24:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-06-01 16:24:43,604 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2021-06-01 16:24:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:43,856 INFO L225 Difference]: With dead ends: 53006
[2021-06-01 16:24:43,856 INFO L226 Difference]: Without dead ends: 47158
[2021-06-01 16:24:43,857 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 138.2ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240
[2021-06-01 16:24:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47158 states.
[2021-06-01 16:24:44,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47158 to 44950.
[2021-06-01 16:24:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44950 states, 44949 states have (on average 4.187768359696545) internal successors, (188236), 44949 states have internal predecessors, (188236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44950 states to 44950 states and 188236 transitions.
[2021-06-01 16:24:45,298 INFO L78 Accepts]: Start accepts. Automaton has 44950 states and 188236 transitions. Word has length 84
[2021-06-01 16:24:45,298 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:45,298 INFO L482 AbstractCegarLoop]: Abstraction has 44950 states and 188236 transitions.
[2021-06-01 16:24:45,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 44950 states and 188236 transitions.
[2021-06-01 16:24:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2021-06-01 16:24:45,362 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:45,362 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:45,363 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-01 16:24:45,363 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:45,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:45,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1750242831, now seen corresponding path program 1 times
[2021-06-01 16:24:45,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:45,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99773335]
[2021-06-01 16:24:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:45,632 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:45,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99773335]
[2021-06-01 16:24:45,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99773335] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:45,632 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:45,632 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-06-01 16:24:45,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70795912]
[2021-06-01 16:24:45,633 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states
[2021-06-01 16:24:45,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:45,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-06-01 16:24:45,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2021-06-01 16:24:45,633 INFO L87 Difference]: Start difference. First operand 44950 states and 188236 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:46,190 INFO L93 Difference]: Finished difference Result 53586 states and 224262 transitions.
[2021-06-01 16:24:46,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2021-06-01 16:24:46,190 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85
[2021-06-01 16:24:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:46,334 INFO L225 Difference]: With dead ends: 53586
[2021-06-01 16:24:46,334 INFO L226 Difference]: Without dead ends: 49458
[2021-06-01 16:24:46,334 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 278.0ms TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420
[2021-06-01 16:24:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49458 states.
[2021-06-01 16:24:47,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49458 to 45832.
[2021-06-01 16:24:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45832 states, 45831 states have (on average 4.193013462503545) internal successors, (192170), 45831 states have internal predecessors, (192170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45832 states to 45832 states and 192170 transitions.
[2021-06-01 16:24:47,926 INFO L78 Accepts]: Start accepts. Automaton has 45832 states and 192170 transitions. Word has length 85
[2021-06-01 16:24:47,926 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:47,926 INFO L482 AbstractCegarLoop]: Abstraction has 45832 states and 192170 transitions.
[2021-06-01 16:24:47,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 45832 states and 192170 transitions.
[2021-06-01 16:24:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2021-06-01 16:24:48,408 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:48,408 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:48,409 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-01 16:24:48,409 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:48,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:48,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1156020575, now seen corresponding path program 1 times
[2021-06-01 16:24:48,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:48,409 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495096075]
[2021-06-01 16:24:48,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:48,596 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:48,596 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495096075]
[2021-06-01 16:24:48,596 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495096075] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:48,596 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:48,596 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:24:48,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422707504]
[2021-06-01 16:24:48,597 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:24:48,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:48,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:24:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:24:48,597 INFO L87 Difference]: Start difference. First operand 45832 states and 192170 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:49,044 INFO L93 Difference]: Finished difference Result 57940 states and 240020 transitions.
[2021-06-01 16:24:49,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 16:24:49,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85
[2021-06-01 16:24:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:49,158 INFO L225 Difference]: With dead ends: 57940
[2021-06-01 16:24:49,158 INFO L226 Difference]: Without dead ends: 42652
[2021-06-01 16:24:49,158 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 74.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:24:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42652 states.
[2021-06-01 16:24:50,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42652 to 42652.
[2021-06-01 16:24:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42652 states, 42651 states have (on average 4.144099786640407) internal successors, (176750), 42651 states have internal predecessors, (176750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42652 states to 42652 states and 176750 transitions.
[2021-06-01 16:24:50,409 INFO L78 Accepts]: Start accepts. Automaton has 42652 states and 176750 transitions. Word has length 85
[2021-06-01 16:24:50,410 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:50,410 INFO L482 AbstractCegarLoop]: Abstraction has 42652 states and 176750 transitions.
[2021-06-01 16:24:50,410 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 42652 states and 176750 transitions.
[2021-06-01 16:24:50,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2021-06-01 16:24:50,477 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:50,477 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:50,478 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-06-01 16:24:50,478 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:50,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:50,478 INFO L82 PathProgramCache]: Analyzing trace with hash -262332207, now seen corresponding path program 1 times
[2021-06-01 16:24:50,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:50,478 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026958581]
[2021-06-01 16:24:50,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:50,553 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:50,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026958581]
[2021-06-01 16:24:50,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026958581] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:50,553 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:50,553 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 16:24:50,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232739862]
[2021-06-01 16:24:50,554 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 16:24:50,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:50,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 16:24:50,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-01 16:24:50,554 INFO L87 Difference]: Start difference. First operand 42652 states and 176750 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:50,863 INFO L93 Difference]: Finished difference Result 46156 states and 187204 transitions.
[2021-06-01 16:24:50,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-06-01 16:24:50,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86
[2021-06-01 16:24:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:50,947 INFO L225 Difference]: With dead ends: 46156
[2021-06-01 16:24:50,947 INFO L226 Difference]: Without dead ends: 32788
[2021-06-01 16:24:50,947 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 76.0ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2021-06-01 16:24:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32788 states.
[2021-06-01 16:24:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32788 to 32788.
[2021-06-01 16:24:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32788 states, 32787 states have (on average 4.02202092292677) internal successors, (131870), 32787 states have internal predecessors, (131870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32788 states to 32788 states and 131870 transitions.
[2021-06-01 16:24:52,093 INFO L78 Accepts]: Start accepts. Automaton has 32788 states and 131870 transitions. Word has length 86
[2021-06-01 16:24:52,093 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:52,093 INFO L482 AbstractCegarLoop]: Abstraction has 32788 states and 131870 transitions.
[2021-06-01 16:24:52,093 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 32788 states and 131870 transitions.
[2021-06-01 16:24:52,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2021-06-01 16:24:52,146 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:52,146 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:52,146 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-06-01 16:24:52,146 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:52,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:52,147 INFO L82 PathProgramCache]: Analyzing trace with hash 397022798, now seen corresponding path program 1 times
[2021-06-01 16:24:52,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:52,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769555139]
[2021-06-01 16:24:52,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:52,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:52,232 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:52,232 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769555139]
[2021-06-01 16:24:52,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769555139] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:52,233 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:52,233 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 16:24:52,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493399093]
[2021-06-01 16:24:52,233 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 16:24:52,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:52,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 16:24:52,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-01 16:24:52,234 INFO L87 Difference]: Start difference. First operand 32788 states and 131870 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:53,153 INFO L93 Difference]: Finished difference Result 50551 states and 202980 transitions.
[2021-06-01 16:24:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-06-01 16:24:53,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88
[2021-06-01 16:24:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:53,284 INFO L225 Difference]: With dead ends: 50551
[2021-06-01 16:24:53,284 INFO L226 Difference]: Without dead ends: 30906
[2021-06-01 16:24:53,285 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:24:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30906 states.
[2021-06-01 16:24:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30906 to 28206.
[2021-06-01 16:24:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28206 states, 28205 states have (on average 3.94472611239142) internal successors, (111261), 28205 states have internal predecessors, (111261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28206 states to 28206 states and 111261 transitions.
[2021-06-01 16:24:53,992 INFO L78 Accepts]: Start accepts. Automaton has 28206 states and 111261 transitions. Word has length 88
[2021-06-01 16:24:53,992 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:53,992 INFO L482 AbstractCegarLoop]: Abstraction has 28206 states and 111261 transitions.
[2021-06-01 16:24:53,992 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 28206 states and 111261 transitions.
[2021-06-01 16:24:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2021-06-01 16:24:54,029 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:54,029 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:54,030 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-06-01 16:24:54,030 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:54,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:54,030 INFO L82 PathProgramCache]: Analyzing trace with hash -976731322, now seen corresponding path program 1 times
[2021-06-01 16:24:54,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:54,030 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82271322]
[2021-06-01 16:24:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:54,210 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:54,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82271322]
[2021-06-01 16:24:54,210 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82271322] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:54,211 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:54,211 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-01 16:24:54,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737644288]
[2021-06-01 16:24:54,211 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-01 16:24:54,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:54,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-01 16:24:54,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2021-06-01 16:24:54,212 INFO L87 Difference]: Start difference. First operand 28206 states and 111261 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:55,107 INFO L93 Difference]: Finished difference Result 41358 states and 162497 transitions.
[2021-06-01 16:24:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-06-01 16:24:55,108 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88
[2021-06-01 16:24:55,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:55,206 INFO L225 Difference]: With dead ends: 41358
[2021-06-01 16:24:55,207 INFO L226 Difference]: Without dead ends: 25349
[2021-06-01 16:24:55,207 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 195.7ms TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306
[2021-06-01 16:24:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25349 states.
[2021-06-01 16:24:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25349 to 20354.
[2021-06-01 16:24:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20354 states, 20353 states have (on average 3.926742986291947) internal successors, (79921), 20353 states have internal predecessors, (79921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20354 states to 20354 states and 79921 transitions.
[2021-06-01 16:24:55,639 INFO L78 Accepts]: Start accepts. Automaton has 20354 states and 79921 transitions. Word has length 88
[2021-06-01 16:24:55,639 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:55,639 INFO L482 AbstractCegarLoop]: Abstraction has 20354 states and 79921 transitions.
[2021-06-01 16:24:55,640 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 20354 states and 79921 transitions.
[2021-06-01 16:24:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2021-06-01 16:24:55,665 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:55,666 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:55,666 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-06-01 16:24:55,666 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash 13230426, now seen corresponding path program 2 times
[2021-06-01 16:24:55,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:55,666 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954164101]
[2021-06-01 16:24:55,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:55,736 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:55,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954164101]
[2021-06-01 16:24:55,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954164101] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:55,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:55,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:24:55,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507514744]
[2021-06-01 16:24:55,736 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:24:55,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:55,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:24:55,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:24:55,737 INFO L87 Difference]: Start difference. First operand 20354 states and 79921 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:55,973 INFO L93 Difference]: Finished difference Result 31430 states and 122243 transitions.
[2021-06-01 16:24:55,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 16:24:55,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88
[2021-06-01 16:24:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:56,038 INFO L225 Difference]: With dead ends: 31430
[2021-06-01 16:24:56,038 INFO L226 Difference]: Without dead ends: 21398
[2021-06-01 16:24:56,038 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 71.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:24:56,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21398 states.
[2021-06-01 16:24:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21398 to 19454.
[2021-06-01 16:24:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19454 states, 19453 states have (on average 3.849329152315838) internal successors, (74881), 19453 states have internal predecessors, (74881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19454 states to 19454 states and 74881 transitions.
[2021-06-01 16:24:56,885 INFO L78 Accepts]: Start accepts. Automaton has 19454 states and 74881 transitions. Word has length 88
[2021-06-01 16:24:56,885 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:56,885 INFO L482 AbstractCegarLoop]: Abstraction has 19454 states and 74881 transitions.
[2021-06-01 16:24:56,885 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 19454 states and 74881 transitions.
[2021-06-01 16:24:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2021-06-01 16:24:56,916 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:56,916 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:56,916 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-06-01 16:24:56,916 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:56,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:56,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1655762774, now seen corresponding path program 1 times
[2021-06-01 16:24:56,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:56,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301087083]
[2021-06-01 16:24:56,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:57,006 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:57,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301087083]
[2021-06-01 16:24:57,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301087083] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:57,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:57,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-01 16:24:57,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705938271]
[2021-06-01 16:24:57,007 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-01 16:24:57,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:57,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-01 16:24:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-01 16:24:57,007 INFO L87 Difference]: Start difference. First operand 19454 states and 74881 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:57,215 INFO L93 Difference]: Finished difference Result 17924 states and 67225 transitions.
[2021-06-01 16:24:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-06-01 16:24:57,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88
[2021-06-01 16:24:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:57,245 INFO L225 Difference]: With dead ends: 17924
[2021-06-01 16:24:57,245 INFO L226 Difference]: Without dead ends: 11666
[2021-06-01 16:24:57,246 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 96.8ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2021-06-01 16:24:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11666 states.
[2021-06-01 16:24:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11666 to 11666.
[2021-06-01 16:24:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11666 states, 11665 states have (on average 3.702957565366481) internal successors, (43195), 11665 states have internal predecessors, (43195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11666 states to 11666 states and 43195 transitions.
[2021-06-01 16:24:57,520 INFO L78 Accepts]: Start accepts. Automaton has 11666 states and 43195 transitions. Word has length 88
[2021-06-01 16:24:57,520 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:57,521 INFO L482 AbstractCegarLoop]: Abstraction has 11666 states and 43195 transitions.
[2021-06-01 16:24:57,521 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 11666 states and 43195 transitions.
[2021-06-01 16:24:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2021-06-01 16:24:57,540 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:57,540 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:57,540 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-06-01 16:24:57,540 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:57,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:57,541 INFO L82 PathProgramCache]: Analyzing trace with hash 615457511, now seen corresponding path program 1 times
[2021-06-01 16:24:57,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:57,542 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288904009]
[2021-06-01 16:24:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:24:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:24:57,642 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:24:57,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288904009]
[2021-06-01 16:24:57,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288904009] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:24:57,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:24:57,643 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-01 16:24:57,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917356975]
[2021-06-01 16:24:57,643 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-01 16:24:57,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:24:57,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-01 16:24:57,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2021-06-01 16:24:57,644 INFO L87 Difference]: Start difference. First operand 11666 states and 43195 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:24:57,834 INFO L93 Difference]: Finished difference Result 9560 states and 34744 transitions.
[2021-06-01 16:24:57,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-06-01 16:24:57,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91
[2021-06-01 16:24:57,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:24:57,839 INFO L225 Difference]: With dead ends: 9560
[2021-06-01 16:24:57,839 INFO L226 Difference]: Without dead ends: 2636
[2021-06-01 16:24:57,839 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 119.3ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272
[2021-06-01 16:24:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states.
[2021-06-01 16:24:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636.
[2021-06-01 16:24:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 3.541935483870968) internal successors, (9333), 2635 states have internal predecessors, (9333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 9333 transitions.
[2021-06-01 16:24:57,873 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 9333 transitions. Word has length 91
[2021-06-01 16:24:57,873 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:24:57,873 INFO L482 AbstractCegarLoop]: Abstraction has 2636 states and 9333 transitions.
[2021-06-01 16:24:57,873 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:24:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 9333 transitions.
[2021-06-01 16:24:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2021-06-01 16:24:57,876 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:24:57,876 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:24:57,876 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-06-01 16:24:57,876 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:24:57,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:24:57,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1807411347, now seen corresponding path program 1 times
[2021-06-01 16:24:57,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:24:57,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890528541]
[2021-06-01 16:24:57,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:24:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 16:24:57,903 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 16:24:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 16:24:57,935 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 16:24:57,974 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-01 16:24:57,975 INFO L655 BasicCegarLoop]: Counterexample might be feasible
[2021-06-01 16:24:57,975 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-06-01 16:24:57,975 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3)
[2021-06-01 16:24:57,976 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 16:24:57,977 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:24:57,977 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 16:24:57,977 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:24:57,977 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:24:57,977 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:24:57,977 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 16:24:57,978 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:24:57,978 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P3Thread1of1ForFork0========
[2021-06-01 16:24:57,980 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 135 places, 124 transitions, 268 flow
[2021-06-01 16:25:16,423 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:25:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:25:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2021-06-01 16:25:16,592 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:25:16,592 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:25:16,593 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:25:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:25:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1183912701, now seen corresponding path program 1 times
[2021-06-01 16:25:16,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:25:16,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894009269]
[2021-06-01 16:25:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:25:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:25:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:25:16,619 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:25:16,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894009269]
[2021-06-01 16:25:16,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894009269] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:25:16,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:25:16,619 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-01 16:25:16,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860357781]
[2021-06-01 16:25:16,620 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-01 16:25:16,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:25:16,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-01 16:25:16,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 16:25:16,761 INFO L87 Difference]: Start difference. First operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:25:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:25:17,549 INFO L93 Difference]: Finished difference Result 90986 states and 399777 transitions.
[2021-06-01 16:25:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-06-01 16:25:17,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65
[2021-06-01 16:25:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:25:17,550 INFO L225 Difference]: With dead ends: 90986
[2021-06-01 16:25:17,550 INFO L226 Difference]: Without dead ends: 0
[2021-06-01 16:25:17,550 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 16:25:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-06-01 16:25:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-06-01 16:25:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:25:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-06-01 16:25:17,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65
[2021-06-01 16:25:17,550 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:25:17,550 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-06-01 16:25:17,550 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:25:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-06-01 16:25:17,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 16:25:17,550 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2021-06-01 16:25:17,551 INFO L301 ceAbstractionStarter]: Result for error location P3Thread1of1ForFork0 was SAFE (3/3)
[2021-06-01 16:25:17,551 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-06-01 16:25:17,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.06 04:25:17 BasicIcfg
[2021-06-01 16:25:17,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-01 16:25:17,671 INFO L168 Benchmark]: Toolchain (without parser) took 103273.71 ms. Allocated memory was 381.7 MB in the beginning and 15.2 GB in the end (delta: 14.8 GB). Free memory was 343.6 MB in the beginning and 8.8 GB in the end (delta: -8.4 GB). Peak memory consumption was 6.4 GB. Max. memory is 16.0 GB.
[2021-06-01 16:25:17,671 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 381.7 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-01 16:25:17,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.35 ms. Allocated memory is still 381.7 MB. Free memory was 343.4 MB in the beginning and 339.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB.
[2021-06-01 16:25:17,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.25 ms. Allocated memory is still 381.7 MB. Free memory was 339.2 MB in the beginning and 336.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-06-01 16:25:17,671 INFO L168 Benchmark]: Boogie Preprocessor took 27.37 ms. Allocated memory is still 381.7 MB. Free memory was 336.0 MB in the beginning and 333.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 16:25:17,671 INFO L168 Benchmark]: RCFGBuilder took 1668.12 ms. Allocated memory is still 381.7 MB. Free memory was 333.9 MB in the beginning and 284.1 MB in the end (delta: 49.8 MB). Peak memory consumption was 144.2 MB. Max. memory is 16.0 GB.
[2021-06-01 16:25:17,672 INFO L168 Benchmark]: TraceAbstraction took 100885.72 ms. Allocated memory was 381.7 MB in the beginning and 15.2 GB in the end (delta: 14.8 GB). Free memory was 284.1 MB in the beginning and 8.8 GB in the end (delta: -8.5 GB). Peak memory consumption was 6.3 GB. Max. memory is 16.0 GB.
[2021-06-01 16:25:17,672 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.16 ms. Allocated memory is still 381.7 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 611.35 ms. Allocated memory is still 381.7 MB. Free memory was 343.4 MB in the beginning and 339.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 76.25 ms. Allocated memory is still 381.7 MB. Free memory was 339.2 MB in the beginning and 336.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 27.37 ms. Allocated memory is still 381.7 MB. Free memory was 336.0 MB in the beginning and 333.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 1668.12 ms. Allocated memory is still 381.7 MB. Free memory was 333.9 MB in the beginning and 284.1 MB in the end (delta: 49.8 MB). Peak memory consumption was 144.2 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 100885.72 ms. Allocated memory was 381.7 MB in the beginning and 15.2 GB in the end (delta: 14.8 GB). Free memory was 284.1 MB in the beginning and 8.8 GB in the end (delta: -8.5 GB). Peak memory consumption was 6.3 GB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 18]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L712] 0 int __unbuffered_p3_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0]
[L714] 0 int a = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0]
[L715] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0]
[L716] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L718] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L720] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L722] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0]
[L723] 0 _Bool z$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0]
[L724] 0 int z$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0]
[L725] 0 _Bool z$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0]
[L726] 0 _Bool z$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L727] 0 _Bool z$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L728] 0 _Bool z$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L729] 0 _Bool z$r_buff0_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0]
[L730] 0 _Bool z$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0]
[L731] 0 _Bool z$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0]
[L732] 0 _Bool z$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0]
[L733] 0 _Bool z$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0]
[L734] 0 _Bool z$r_buff1_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0]
[L735] 0 _Bool z$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0]
[L736] 0 int *z$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}]
[L737] 0 int z$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0]
[L738] 0 _Bool z$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0]
[L739] 0 int z$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0]
[L740] 0 _Bool z$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L741] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L742] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L834] 0 pthread_t t1541;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L835] FCALL, FORK 0 pthread_create(&t1541, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L836] 0 pthread_t t1542;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L837] FCALL, FORK 0 pthread_create(&t1542, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L838] 0 pthread_t t1543;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L839] FCALL, FORK 0 pthread_create(&t1543, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L840] 0 pthread_t t1544;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L841] FCALL, FORK 0 pthread_create(&t1544, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L796] 4 z$w_buff1 = z$w_buff0
[L797] 4 z$w_buff0 = 2
[L798] 4 z$w_buff1_used = z$w_buff0_used
[L799] 4 z$w_buff0_used = (_Bool)1
[L18] COND FALSE 4 !(!expression)
[L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0
[L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1
[L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2
[L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3
[L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4
[L806] 4 z$r_buff0_thd4 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L809] 4 __unbuffered_p3_EAX = a
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L746] 1 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L749] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L761] 2 x = 2
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L764] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L776] 3 y = 2
VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L779] 3 z = 1
VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L782] 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)
[L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L782] 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)
[L782] 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)
[L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L784] 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
[L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L786] 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
[L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L3] COND FALSE 0 !(!cond)
VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L854] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L855] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L856] 0 z$flush_delayed = weak$$choice2
[L857] 0 z$mem_tmp = z
[L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)
[L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)
[L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)
[L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0)
[L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z
[L866] 0 z = z$flush_delayed ? z$mem_tmp : z
[L867] 0 z$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L18] COND TRUE 0 !expression
VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L18] 0 reach_error()
VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P3 with 1 thread instances
CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18722.4ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 721.1ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17997.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105490occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 62342.9ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 1978.0ms, AutomataDifference: 16076.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16946.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3230 SDtfs, 5766 SDslu, 12961 SDs, 0 SdLazy, 1302 SolverSat, 310 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1180.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2453.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105490occurred in iteration=0, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 23374.6ms AutomataMinimizationTime, 18 MinimizatonAttempts, 27831 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 78.0ms SsaConstructionTime, 1243.3ms SatisfiabilityAnalysisTime, 2333.6ms InterpolantComputationTime, 1611 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 8117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P3Thread1of1ForFork0 with 1 thread instances
CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 19573.4ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 169.0ms, AutomataDifference: 929.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18445.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 112 SDtfs, 43 SDslu, 77 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105490occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 0.2ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4ms SsaConstructionTime, 3.7ms SatisfiabilityAnalysisTime, 18.7ms InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...