/usr/bin/java -Xmx8000000000 -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-PN-NoLbe-OGIterative-CovSimpl-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 15:16:25,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 15:16:25,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 15:16:25,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 15:16:25,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 15:16:25,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 15:16:25,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 15:16:25,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 15:16:25,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 15:16:25,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 15:16:25,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 15:16:25,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 15:16:25,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 15:16:25,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 15:16:25,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 15:16:25,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 15:16:25,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 15:16:25,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 15:16:25,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 15:16:25,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 15:16:25,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 15:16:25,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 15:16:25,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 15:16:25,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 15:16:25,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 15:16:25,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 15:16:25,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 15:16:25,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 15:16:25,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 15:16:25,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 15:16:25,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 15:16:25,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 15:16:25,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 15:16:25,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 15:16:25,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 15:16:25,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 15:16:25,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 15:16:25,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 15:16:25,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 15:16:25,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 15:16:25,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 15:16:25,242 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-PN-NoLbe-OGIterative-CovSimpl-Hitting.epf [2021-08-13 15:16:25,265 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 15:16:25,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 15:16:25,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 15:16:25,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 15:16:25,267 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 15:16:25,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 15:16:25,267 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 15:16:25,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 15:16:25,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 15:16:25,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 15:16:25,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 15:16:25,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 15:16:25,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 15:16:25,268 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 15:16:25,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 15:16:25,268 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 15:16:25,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 15:16:25,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 15:16:25,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 15:16:25,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 15:16:25,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 15:16:25,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 15:16:25,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 15:16:25,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 15:16:25,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 15:16:25,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 15:16:25,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 15:16:25,270 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 15:16:25,270 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 15:16:25,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 15:16:25,270 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 15:16:25,270 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 15:16:25,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-13 15:16:25,271 INFO L138 SettingsManager]: * Simplify away covered predicates in OwickiGries annotation=true 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-08-13 15:16:25,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 15:16:25,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 15:16:25,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 15:16:25,588 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 15:16:25,588 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 15:16:25,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2021-08-13 15:16:25,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad060a61a/a8d8cecacd864cc58d44b793b359af07/FLAGffc414542 [2021-08-13 15:16:26,147 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 15:16:26,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2021-08-13 15:16:26,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad060a61a/a8d8cecacd864cc58d44b793b359af07/FLAGffc414542 [2021-08-13 15:16:26,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad060a61a/a8d8cecacd864cc58d44b793b359af07 [2021-08-13 15:16:26,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 15:16:26,619 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 15:16:26,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 15:16:26,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 15:16:26,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 15:16:26,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 03:16:26" (1/1) ... [2021-08-13 15:16:26,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a491b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:26, skipping insertion in model container [2021-08-13 15:16:26,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 03:16:26" (1/1) ... [2021-08-13 15:16:26,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 15:16:26,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 15:16:26,824 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/mix042_rmo.opt.i[948,961] [2021-08-13 15:16:26,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 15:16:26,994 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 15:16:27,003 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/mix042_rmo.opt.i[948,961] [2021-08-13 15:16:27,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 15:16:27,106 INFO L208 MainTranslator]: Completed translation [2021-08-13 15:16:27,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:27 WrapperNode [2021-08-13 15:16:27,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 15:16:27,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 15:16:27,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 15:16:27,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 15:16:27,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:27" (1/1) ... [2021-08-13 15:16:27,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:27" (1/1) ... [2021-08-13 15:16:27,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 15:16:27,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 15:16:27,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 15:16:27,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 15:16:27,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:27" (1/1) ... [2021-08-13 15:16:27,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:27" (1/1) ... [2021-08-13 15:16:27,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:27" (1/1) ... [2021-08-13 15:16:27,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:27" (1/1) ... [2021-08-13 15:16:27,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:27" (1/1) ... [2021-08-13 15:16:27,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:27" (1/1) ... [2021-08-13 15:16:27,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:27" (1/1) ... [2021-08-13 15:16:27,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 15:16:27,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 15:16:27,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 15:16:27,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 15:16:27,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:27" (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-08-13 15:16:27,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 15:16:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 15:16:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 15:16:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 15:16:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 15:16:27,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 15:16:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 15:16:27,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 15:16:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 15:16:27,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 15:16:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 15:16:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 15:16:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 15:16:27,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 15:16:27,294 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 15:16:29,100 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 15:16:29,101 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 15:16:29,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 03:16:29 BoogieIcfgContainer [2021-08-13 15:16:29,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 15:16:29,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 15:16:29,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 15:16:29,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 15:16:29,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 03:16:26" (1/3) ... [2021-08-13 15:16:29,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a4daa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 03:16:29, skipping insertion in model container [2021-08-13 15:16:29,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:16:27" (2/3) ... [2021-08-13 15:16:29,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a4daa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 03:16:29, skipping insertion in model container [2021-08-13 15:16:29,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 03:16:29" (3/3) ... [2021-08-13 15:16:29,109 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_rmo.opt.i [2021-08-13 15:16:29,114 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 15:16:29,114 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 15:16:29,115 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 15:16:29,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,145 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,146 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,146 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,146 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,147 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,148 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,148 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,148 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,152 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,152 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,153 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,153 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,153 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,153 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,153 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,154 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,159 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,160 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,166 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,166 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,166 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,169 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:16:29,171 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 15:16:29,191 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-13 15:16:29,208 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 15:16:29,209 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 15:16:29,209 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 15:16:29,209 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 15:16:29,209 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 15:16:29,209 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 15:16:29,209 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 15:16:29,209 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 15:16:29,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2021-08-13 15:16:29,252 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2021-08-13 15:16:29,253 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:16:29,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-08-13 15:16:29,256 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2021-08-13 15:16:29,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2021-08-13 15:16:29,272 INFO L129 PetriNetUnfolder]: 0/72 cut-off events. [2021-08-13 15:16:29,272 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:16:29,273 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:16:29,273 INFO L266 CegarLoopForPetriNet]: 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] [2021-08-13 15:16:29,274 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:16:29,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:16:29,278 INFO L82 PathProgramCache]: Analyzing trace with hash -978306701, now seen corresponding path program 1 times [2021-08-13 15:16:29,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:16:29,285 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587035338] [2021-08-13 15:16:29,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:16:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:16:29,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:29,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:29,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:29,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:16:29,528 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:16:29,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587035338] [2021-08-13 15:16:29,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587035338] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:16:29,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:16:29,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 15:16:29,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275616505] [2021-08-13 15:16:29,536 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 15:16:29,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:16:29,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 15:16:29,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 15:16:29,549 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 110 [2021-08-13 15:16:29,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-08-13 15:16:29,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:16:29,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 110 [2021-08-13 15:16:29,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:16:29,643 INFO L129 PetriNetUnfolder]: 16/221 cut-off events. [2021-08-13 15:16:29,643 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:16:29,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 221 events. 16/221 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 663 event pairs, 6 based on Foata normal form. 9/219 useless extension candidates. Maximal degree in co-relation 216. Up to 27 conditions per place. [2021-08-13 15:16:29,647 INFO L132 encePairwiseOnDemand]: 105/110 looper letters, 7 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2021-08-13 15:16:29,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 106 transitions, 239 flow [2021-08-13 15:16:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 15:16:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 15:16:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2021-08-13 15:16:29,658 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9515151515151515 [2021-08-13 15:16:29,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2021-08-13 15:16:29,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2021-08-13 15:16:29,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:16:29,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2021-08-13 15:16:29,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-08-13 15:16:29,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 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-08-13 15:16:29,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 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-08-13 15:16:29,672 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 0 predicate places. [2021-08-13 15:16:29,672 INFO L482 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 239 flow [2021-08-13 15:16:29,672 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-08-13 15:16:29,673 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:16:29,673 INFO L266 CegarLoopForPetriNet]: 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] [2021-08-13 15:16:29,673 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 15:16:29,673 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:16:29,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:16:29,674 INFO L82 PathProgramCache]: Analyzing trace with hash -779061261, now seen corresponding path program 1 times [2021-08-13 15:16:29,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:16:29,674 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38775542] [2021-08-13 15:16:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:16:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:16:29,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:29,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:29,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:29,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:29,807 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:16:29,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:16:29,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:29,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:16:29,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:29,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:16:29,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:29,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:16:29,846 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:16:29,846 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38775542] [2021-08-13 15:16:29,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38775542] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:16:29,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:16:29,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:16:29,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185032048] [2021-08-13 15:16:29,848 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:16:29,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:16:29,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:16:29,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:16:29,850 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 110 [2021-08-13 15:16:29,851 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 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-08-13 15:16:29,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:16:29,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 110 [2021-08-13 15:16:29,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:16:30,064 INFO L129 PetriNetUnfolder]: 30/319 cut-off events. [2021-08-13 15:16:30,064 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-08-13 15:16:30,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 319 events. 30/319 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1471 event pairs, 6 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 396. Up to 45 conditions per place. [2021-08-13 15:16:30,066 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 7 selfloop transitions, 2 changer transitions 13/118 dead transitions. [2021-08-13 15:16:30,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 118 transitions, 309 flow [2021-08-13 15:16:30,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 15:16:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 15:16:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 905 transitions. [2021-08-13 15:16:30,075 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9141414141414141 [2021-08-13 15:16:30,075 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 905 transitions. [2021-08-13 15:16:30,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 905 transitions. [2021-08-13 15:16:30,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:16:30,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 905 transitions. [2021-08-13 15:16:30,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.55555555555556) internal successors, (905), 9 states have internal predecessors, (905), 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-08-13 15:16:30,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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-08-13 15:16:30,084 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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-08-13 15:16:30,085 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 8 predicate places. [2021-08-13 15:16:30,085 INFO L482 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 309 flow [2021-08-13 15:16:30,085 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 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-08-13 15:16:30,085 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:16:30,085 INFO L266 CegarLoopForPetriNet]: 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] [2021-08-13 15:16:30,085 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 15:16:30,087 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:16:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:16:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash -212336426, now seen corresponding path program 1 times [2021-08-13 15:16:30,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:16:30,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989770803] [2021-08-13 15:16:30,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:16:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:16:30,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:30,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:30,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:30,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:30,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:30,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:16:30,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:30,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 15:16:30,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:30,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 15:16:30,264 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 15:16:30,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 15:16:30,285 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:16:30,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:16:30,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:30,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:16:30,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:30,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:16:30,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:30,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:16:30,330 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:16:30,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989770803] [2021-08-13 15:16:30,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989770803] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:16:30,331 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:16:30,331 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 15:16:30,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475432101] [2021-08-13 15:16:30,331 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 15:16:30,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:16:30,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 15:16:30,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-13 15:16:30,336 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 110 [2021-08-13 15:16:30,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 309 flow. Second operand has 10 states, 10 states have (on average 90.3) internal successors, (903), 10 states have internal predecessors, (903), 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-08-13 15:16:30,337 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:16:30,337 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 110 [2021-08-13 15:16:30,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:16:30,795 INFO L129 PetriNetUnfolder]: 196/829 cut-off events. [2021-08-13 15:16:30,795 INFO L130 PetriNetUnfolder]: For 173/211 co-relation queries the response was YES. [2021-08-13 15:16:30,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 829 events. 196/829 cut-off events. For 173/211 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5655 event pairs, 32 based on Foata normal form. 2/821 useless extension candidates. Maximal degree in co-relation 1490. Up to 166 conditions per place. [2021-08-13 15:16:30,800 INFO L132 encePairwiseOnDemand]: 99/110 looper letters, 16 selfloop transitions, 8 changer transitions 81/182 dead transitions. [2021-08-13 15:16:30,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 182 transitions, 735 flow [2021-08-13 15:16:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 15:16:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 15:16:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1487 transitions. [2021-08-13 15:16:30,803 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8448863636363636 [2021-08-13 15:16:30,803 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1487 transitions. [2021-08-13 15:16:30,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1487 transitions. [2021-08-13 15:16:30,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:16:30,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1487 transitions. [2021-08-13 15:16:30,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 92.9375) internal successors, (1487), 16 states have internal predecessors, (1487), 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-08-13 15:16:30,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 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-08-13 15:16:30,809 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 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-08-13 15:16:30,810 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 23 predicate places. [2021-08-13 15:16:30,810 INFO L482 AbstractCegarLoop]: Abstraction has has 138 places, 182 transitions, 735 flow [2021-08-13 15:16:30,810 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 90.3) internal successors, (903), 10 states have internal predecessors, (903), 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-08-13 15:16:30,810 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:16:30,810 INFO L266 CegarLoopForPetriNet]: 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] [2021-08-13 15:16:30,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 15:16:30,810 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:16:30,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:16:30,811 INFO L82 PathProgramCache]: Analyzing trace with hash -466192105, now seen corresponding path program 1 times [2021-08-13 15:16:30,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:16:30,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772402017] [2021-08-13 15:16:30,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:16:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:16:30,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:30,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:30,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:30,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:30,973 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:16:30,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:16:30,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:30,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:16:30,997 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:16:30,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:16:31,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:31,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:16:31,008 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:16:31,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772402017] [2021-08-13 15:16:31,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772402017] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:16:31,008 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:16:31,008 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:16:31,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932854114] [2021-08-13 15:16:31,009 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:16:31,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:16:31,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:16:31,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:16:31,011 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-13 15:16:31,011 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 182 transitions, 735 flow. Second operand has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 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-08-13 15:16:31,011 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:16:31,011 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-13 15:16:31,011 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:16:31,289 INFO L129 PetriNetUnfolder]: 444/1633 cut-off events. [2021-08-13 15:16:31,289 INFO L130 PetriNetUnfolder]: For 262/332 co-relation queries the response was YES. [2021-08-13 15:16:31,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 1633 events. 444/1633 cut-off events. For 262/332 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13522 event pairs, 58 based on Foata normal form. 0/1558 useless extension candidates. Maximal degree in co-relation 3030. Up to 350 conditions per place. [2021-08-13 15:16:31,300 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 21 selfloop transitions, 15 changer transitions 63/212 dead transitions. [2021-08-13 15:16:31,300 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 212 transitions, 877 flow [2021-08-13 15:16:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 15:16:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 15:16:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1003 transitions. [2021-08-13 15:16:31,302 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9118181818181819 [2021-08-13 15:16:31,302 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1003 transitions. [2021-08-13 15:16:31,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1003 transitions. [2021-08-13 15:16:31,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:16:31,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1003 transitions. [2021-08-13 15:16:31,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.3) internal successors, (1003), 10 states have internal predecessors, (1003), 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-08-13 15:16:31,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 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-08-13 15:16:31,306 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 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-08-13 15:16:31,306 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 32 predicate places. [2021-08-13 15:16:31,306 INFO L482 AbstractCegarLoop]: Abstraction has has 147 places, 212 transitions, 877 flow [2021-08-13 15:16:31,307 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 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-08-13 15:16:31,307 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:16:31,307 INFO L266 CegarLoopForPetriNet]: 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-08-13 15:16:31,307 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 15:16:31,307 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:16:31,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:16:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1477621861, now seen corresponding path program 1 times [2021-08-13 15:16:31,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:16:31,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829440114] [2021-08-13 15:16:31,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:16:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:16:31,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:31,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:31,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:31,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:31,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:31,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:31,434 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:16:31,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:16:31,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:31,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:16:31,458 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:16:31,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:16:31,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:31,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:16:31,469 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:16:31,469 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829440114] [2021-08-13 15:16:31,469 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829440114] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:16:31,469 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:16:31,469 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:16:31,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424882473] [2021-08-13 15:16:31,469 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:16:31,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:16:31,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:16:31,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:16:31,471 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-13 15:16:31,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 212 transitions, 877 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 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-08-13 15:16:31,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:16:31,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-13 15:16:31,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:16:31,695 INFO L129 PetriNetUnfolder]: 203/704 cut-off events. [2021-08-13 15:16:31,695 INFO L130 PetriNetUnfolder]: For 99/804 co-relation queries the response was YES. [2021-08-13 15:16:31,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1625 conditions, 704 events. 203/704 cut-off events. For 99/804 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4285 event pairs, 7 based on Foata normal form. 73/734 useless extension candidates. Maximal degree in co-relation 1559. Up to 142 conditions per place. [2021-08-13 15:16:31,699 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 22 selfloop transitions, 36 changer transitions 42/198 dead transitions. [2021-08-13 15:16:31,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 198 transitions, 887 flow [2021-08-13 15:16:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 15:16:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 15:16:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1305 transitions. [2021-08-13 15:16:31,702 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9125874125874126 [2021-08-13 15:16:31,702 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1305 transitions. [2021-08-13 15:16:31,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1305 transitions. [2021-08-13 15:16:31,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:16:31,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1305 transitions. [2021-08-13 15:16:31,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.38461538461539) internal successors, (1305), 13 states have internal predecessors, (1305), 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-08-13 15:16:31,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 110.0) internal successors, (1540), 14 states have internal predecessors, (1540), 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-08-13 15:16:31,706 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 110.0) internal successors, (1540), 14 states have internal predecessors, (1540), 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-08-13 15:16:31,706 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 35 predicate places. [2021-08-13 15:16:31,706 INFO L482 AbstractCegarLoop]: Abstraction has has 150 places, 198 transitions, 887 flow [2021-08-13 15:16:31,707 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 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-08-13 15:16:31,707 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:16:31,707 INFO L266 CegarLoopForPetriNet]: 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-08-13 15:16:31,707 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 15:16:31,707 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:16:31,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:16:31,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1430138851, now seen corresponding path program 1 times [2021-08-13 15:16:31,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:16:31,708 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837385635] [2021-08-13 15:16:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:16:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:16:31,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:31,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:31,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:31,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:31,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:31,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:31,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:31,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:31,809 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:16:31,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:16:31,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:31,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:16:31,836 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:16:31,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:16:31,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:31,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:16:31,847 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:16:31,847 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837385635] [2021-08-13 15:16:31,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837385635] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:16:31,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:16:31,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 15:16:31,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089498808] [2021-08-13 15:16:31,848 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 15:16:31,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:16:31,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 15:16:31,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 15:16:31,850 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-13 15:16:31,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 198 transitions, 887 flow. Second operand has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 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-08-13 15:16:31,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:16:31,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-13 15:16:31,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:16:32,180 INFO L129 PetriNetUnfolder]: 163/513 cut-off events. [2021-08-13 15:16:32,180 INFO L130 PetriNetUnfolder]: For 182/1560 co-relation queries the response was YES. [2021-08-13 15:16:32,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 513 events. 163/513 cut-off events. For 182/1560 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2951 event pairs, 0 based on Foata normal form. 109/591 useless extension candidates. Maximal degree in co-relation 1477. Up to 131 conditions per place. [2021-08-13 15:16:32,185 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 19 selfloop transitions, 40 changer transitions 61/207 dead transitions. [2021-08-13 15:16:32,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 207 transitions, 1163 flow [2021-08-13 15:16:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 15:16:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 15:16:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1592 transitions. [2021-08-13 15:16:32,189 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9045454545454545 [2021-08-13 15:16:32,189 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1592 transitions. [2021-08-13 15:16:32,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1592 transitions. [2021-08-13 15:16:32,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:16:32,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1592 transitions. [2021-08-13 15:16:32,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 99.5) internal successors, (1592), 16 states have internal predecessors, (1592), 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-08-13 15:16:32,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 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-08-13 15:16:32,196 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 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-08-13 15:16:32,197 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 44 predicate places. [2021-08-13 15:16:32,197 INFO L482 AbstractCegarLoop]: Abstraction has has 159 places, 207 transitions, 1163 flow [2021-08-13 15:16:32,197 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 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-08-13 15:16:32,197 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:16:32,197 INFO L266 CegarLoopForPetriNet]: 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-08-13 15:16:32,197 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 15:16:32,198 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:16:32,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:16:32,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1523074943, now seen corresponding path program 1 times [2021-08-13 15:16:32,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:16:32,198 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444347449] [2021-08-13 15:16:32,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:16:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:16:32,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:32,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:32,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:32,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:32,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:32,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:32,276 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:16:32,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:16:32,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:32,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:16:32,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:32,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:16:32,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:32,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:16:32,317 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:16:32,317 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444347449] [2021-08-13 15:16:32,317 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444347449] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:16:32,317 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:16:32,317 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:16:32,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067091484] [2021-08-13 15:16:32,318 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:16:32,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:16:32,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:16:32,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:16:32,320 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-13 15:16:32,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 207 transitions, 1163 flow. Second operand has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 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-08-13 15:16:32,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:16:32,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-13 15:16:32,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:16:32,487 INFO L129 PetriNetUnfolder]: 322/941 cut-off events. [2021-08-13 15:16:32,487 INFO L130 PetriNetUnfolder]: For 363/1463 co-relation queries the response was YES. [2021-08-13 15:16:32,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 941 events. 322/941 cut-off events. For 363/1463 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 6778 event pairs, 0 based on Foata normal form. 1/854 useless extension candidates. Maximal degree in co-relation 2855. Up to 257 conditions per place. [2021-08-13 15:16:32,496 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 9 selfloop transitions, 2 changer transitions 66/213 dead transitions. [2021-08-13 15:16:32,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 213 transitions, 1231 flow [2021-08-13 15:16:32,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-13 15:16:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-13 15:16:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 690 transitions. [2021-08-13 15:16:32,498 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8961038961038961 [2021-08-13 15:16:32,498 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 690 transitions. [2021-08-13 15:16:32,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 690 transitions. [2021-08-13 15:16:32,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:16:32,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 690 transitions. [2021-08-13 15:16:32,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 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-08-13 15:16:32,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 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-08-13 15:16:32,501 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 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-08-13 15:16:32,501 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 50 predicate places. [2021-08-13 15:16:32,501 INFO L482 AbstractCegarLoop]: Abstraction has has 165 places, 213 transitions, 1231 flow [2021-08-13 15:16:32,502 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 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-08-13 15:16:32,502 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:16:32,502 INFO L266 CegarLoopForPetriNet]: 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-08-13 15:16:32,502 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 15:16:32,502 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:16:32,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:16:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash -802700227, now seen corresponding path program 2 times [2021-08-13 15:16:32,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:16:32,503 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234819972] [2021-08-13 15:16:32,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:16:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:16:32,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:32,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:32,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:32,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:32,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:32,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:16:32,572 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:16:32,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:16:32,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:32,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:16:32,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:32,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:16:32,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:16:32,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:16:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:16:32,608 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:16:32,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234819972] [2021-08-13 15:16:32,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234819972] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:16:32,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:16:32,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:16:32,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498296590] [2021-08-13 15:16:32,609 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:16:32,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:16:32,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:16:32,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:16:32,610 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-13 15:16:32,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 213 transitions, 1231 flow. Second operand has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 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-08-13 15:16:32,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:16:32,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-13 15:16:32,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:16:32,872 INFO L129 PetriNetUnfolder]: 644/1941 cut-off events. [2021-08-13 15:16:32,872 INFO L130 PetriNetUnfolder]: For 756/2602 co-relation queries the response was YES. [2021-08-13 15:16:32,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5921 conditions, 1941 events. 644/1941 cut-off events. For 756/2602 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 17832 event pairs, 1 based on Foata normal form. 0/1782 useless extension candidates. Maximal degree in co-relation 5844. Up to 517 conditions per place. [2021-08-13 15:16:32,884 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 9 selfloop transitions, 1 changer transitions 80/224 dead transitions. [2021-08-13 15:16:32,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 224 transitions, 1371 flow [2021-08-13 15:16:32,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-13 15:16:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-13 15:16:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 690 transitions. [2021-08-13 15:16:32,886 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8961038961038961 [2021-08-13 15:16:32,886 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 690 transitions. [2021-08-13 15:16:32,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 690 transitions. [2021-08-13 15:16:32,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:16:32,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 690 transitions. [2021-08-13 15:16:32,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 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-08-13 15:16:32,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 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-08-13 15:16:32,889 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 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-08-13 15:16:32,889 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 56 predicate places. [2021-08-13 15:16:32,890 INFO L482 AbstractCegarLoop]: Abstraction has has 171 places, 224 transitions, 1371 flow [2021-08-13 15:16:32,890 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 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-08-13 15:16:32,890 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:16:32,890 INFO L266 CegarLoopForPetriNet]: 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-08-13 15:16:32,890 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 15:16:32,891 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:16:32,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:16:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1192443907, now seen corresponding path program 3 times [2021-08-13 15:16:32,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:16:32,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925506277] [2021-08-13 15:16:32,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:16:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 15:16:32,930 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 15:16:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 15:16:32,976 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 15:16:33,018 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 15:16:33,018 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 15:16:33,018 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 15:16:33,021 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 15:16:33,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 03:16:33 BasicIcfg [2021-08-13 15:16:33,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 15:16:33,111 INFO L168 Benchmark]: Toolchain (without parser) took 6491.58 ms. Allocated memory was 203.4 MB in the beginning and 355.5 MB in the end (delta: 152.0 MB). Free memory was 167.2 MB in the beginning and 213.2 MB in the end (delta: -45.9 MB). Peak memory consumption was 107.1 MB. Max. memory is 8.0 GB. [2021-08-13 15:16:33,111 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 203.4 MB. Free memory is still 185.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 15:16:33,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.87 ms. Allocated memory is still 203.4 MB. Free memory was 167.0 MB in the beginning and 161.4 MB in the end (delta: 5.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-08-13 15:16:33,112 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.15 ms. Allocated memory is still 203.4 MB. Free memory was 161.4 MB in the beginning and 158.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 15:16:33,112 INFO L168 Benchmark]: Boogie Preprocessor took 34.66 ms. Allocated memory is still 203.4 MB. Free memory was 158.8 MB in the beginning and 156.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 15:16:33,113 INFO L168 Benchmark]: RCFGBuilder took 1869.93 ms. Allocated memory was 203.4 MB in the beginning and 265.3 MB in the end (delta: 61.9 MB). Free memory was 156.2 MB in the beginning and 217.6 MB in the end (delta: -61.4 MB). Peak memory consumption was 92.2 MB. Max. memory is 8.0 GB. [2021-08-13 15:16:33,113 INFO L168 Benchmark]: TraceAbstraction took 4006.50 ms. Allocated memory was 265.3 MB in the beginning and 355.5 MB in the end (delta: 90.2 MB). Free memory was 217.1 MB in the beginning and 213.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 94.1 MB. Max. memory is 8.0 GB. [2021-08-13 15:16:33,114 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.11 ms. Allocated memory is still 203.4 MB. Free memory is still 185.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 477.87 ms. Allocated memory is still 203.4 MB. Free memory was 167.0 MB in the beginning and 161.4 MB in the end (delta: 5.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 69.15 ms. Allocated memory is still 203.4 MB. Free memory was 161.4 MB in the beginning and 158.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.66 ms. Allocated memory is still 203.4 MB. Free memory was 158.8 MB in the beginning and 156.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1869.93 ms. Allocated memory was 203.4 MB in the beginning and 265.3 MB in the end (delta: 61.9 MB). Free memory was 156.2 MB in the beginning and 217.6 MB in the end (delta: -61.4 MB). Peak memory consumption was 92.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4006.50 ms. Allocated memory was 265.3 MB in the beginning and 355.5 MB in the end (delta: 90.2 MB). Free memory was 217.1 MB in the beginning and 213.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 94.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L729] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L735] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L736] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L737] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L738] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L739] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1120; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1120, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1121; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1121, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1122; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t1122, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 3813.8ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2186.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 50.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 63 SDtfs, 255 SDslu, 213 SDs, 0 SdLazy, 368 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 375.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 927.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1371occurred in iteration=8, InterpolantAutomatonStates: 81, 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: TRACE_CHECK: 32.9ms SsaConstructionTime, 368.2ms SatisfiabilityAnalysisTime, 858.5ms InterpolantComputationTime, 694 NumberOfCodeBlocks, 694 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 1888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...