/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-24 19:27:41,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-24 19:27:41,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-24 19:27:41,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-24 19:27:41,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-24 19:27:41,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-24 19:27:41,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-24 19:27:41,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-24 19:27:41,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-24 19:27:41,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-24 19:27:41,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-24 19:27:41,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-24 19:27:41,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-24 19:27:41,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-24 19:27:41,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-24 19:27:41,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-24 19:27:41,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-24 19:27:41,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-24 19:27:41,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-24 19:27:41,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-24 19:27:41,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-24 19:27:41,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-24 19:27:41,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-24 19:27:41,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-24 19:27:41,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-24 19:27:41,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-24 19:27:41,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-24 19:27:41,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-24 19:27:41,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-24 19:27:41,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-24 19:27:41,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-24 19:27:41,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-24 19:27:41,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-24 19:27:41,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-24 19:27:41,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-24 19:27:41,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-24 19:27:41,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-24 19:27:41,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-24 19:27:41,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-24 19:27:41,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-24 19:27:41,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-24 19:27:41,103 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-SemanticLbe.epf [2021-03-24 19:27:41,123 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-24 19:27:41,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-24 19:27:41,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-24 19:27:41,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-24 19:27:41,125 INFO L138 SettingsManager]: * Use SBE=true [2021-03-24 19:27:41,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-24 19:27:41,125 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-24 19:27:41,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-24 19:27:41,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-24 19:27:41,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-24 19:27:41,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-24 19:27:41,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-24 19:27:41,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-24 19:27:41,126 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-24 19:27:41,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-24 19:27:41,126 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-24 19:27:41,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-24 19:27:41,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-24 19:27:41,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-24 19:27:41,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-24 19:27:41,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-24 19:27:41,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 19:27:41,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-24 19:27:41,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-24 19:27:41,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-24 19:27:41,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-24 19:27:41,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-24 19:27:41,129 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-24 19:27:41,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-24 19:27:41,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-24 19:27:41,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-24 19:27:41,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-24 19:27:41,444 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-24 19:27:41,445 INFO L275 PluginConnector]: CDTParser initialized [2021-03-24 19:27:41,446 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2021-03-24 19:27:41,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823ecde36/9d43d6bc285a40b4b757dc8e65a2584d/FLAG91b77397c [2021-03-24 19:27:42,266 INFO L306 CDTParser]: Found 1 translation units. [2021-03-24 19:27:42,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2021-03-24 19:27:42,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823ecde36/9d43d6bc285a40b4b757dc8e65a2584d/FLAG91b77397c [2021-03-24 19:27:42,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823ecde36/9d43d6bc285a40b4b757dc8e65a2584d [2021-03-24 19:27:42,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-24 19:27:42,358 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-24 19:27:42,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-24 19:27:42,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-24 19:27:42,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-24 19:27:42,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 07:27:42" (1/1) ... [2021-03-24 19:27:42,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6d1ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42, skipping insertion in model container [2021-03-24 19:27:42,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 07:27:42" (1/1) ... [2021-03-24 19:27:42,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-24 19:27:42,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-24 19:27:42,608 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i[949,962] [2021-03-24 19:27:42,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 19:27:42,857 INFO L203 MainTranslator]: Completed pre-run [2021-03-24 19:27:42,866 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i[949,962] [2021-03-24 19:27:42,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 19:27:42,977 INFO L208 MainTranslator]: Completed translation [2021-03-24 19:27:42,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42 WrapperNode [2021-03-24 19:27:42,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-24 19:27:42,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-24 19:27:42,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-24 19:27:42,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-24 19:27:42,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42" (1/1) ... [2021-03-24 19:27:42,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42" (1/1) ... [2021-03-24 19:27:43,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-24 19:27:43,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-24 19:27:43,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-24 19:27:43,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-24 19:27:43,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42" (1/1) ... [2021-03-24 19:27:43,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42" (1/1) ... [2021-03-24 19:27:43,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42" (1/1) ... [2021-03-24 19:27:43,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42" (1/1) ... [2021-03-24 19:27:43,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42" (1/1) ... [2021-03-24 19:27:43,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42" (1/1) ... [2021-03-24 19:27:43,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42" (1/1) ... [2021-03-24 19:27:43,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-24 19:27:43,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-24 19:27:43,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-24 19:27:43,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-24 19:27:43,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42" (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-03-24 19:27:43,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-24 19:27:43,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-24 19:27:43,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-24 19:27:43,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-24 19:27:43,138 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-24 19:27:43,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-24 19:27:43,138 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-24 19:27:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-24 19:27:43,139 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-24 19:27:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-24 19:27:43,139 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-24 19:27:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-24 19:27:43,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-24 19:27:43,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-24 19:27:43,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-24 19:27:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-24 19:27:43,142 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-24 19:27:45,103 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-24 19:27:45,103 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-24 19:27:45,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 07:27:45 BoogieIcfgContainer [2021-03-24 19:27:45,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-24 19:27:45,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-24 19:27:45,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-24 19:27:45,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-24 19:27:45,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 07:27:42" (1/3) ... [2021-03-24 19:27:45,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e44152b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 07:27:45, skipping insertion in model container [2021-03-24 19:27:45,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:27:42" (2/3) ... [2021-03-24 19:27:45,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e44152b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 07:27:45, skipping insertion in model container [2021-03-24 19:27:45,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 07:27:45" (3/3) ... [2021-03-24 19:27:45,112 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2021-03-24 19:27:45,118 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-24 19:27:45,122 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-24 19:27:45,122 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-24 19:27:45,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,162 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,162 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,162 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,162 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,167 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,167 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,168 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,168 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,168 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,169 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,169 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,169 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,170 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,170 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,170 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,170 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,170 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,170 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,170 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,173 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,173 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,173 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,174 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,178 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,178 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,178 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,179 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,179 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,179 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,179 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,179 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,179 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,179 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,179 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,181 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,188 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,191 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,192 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,195 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,195 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,196 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,197 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,198 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,198 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,198 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:27:45,200 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-24 19:27:45,215 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-24 19:27:45,241 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-24 19:27:45,241 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-24 19:27:45,241 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-24 19:27:45,241 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-24 19:27:45,241 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-24 19:27:45,241 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-24 19:27:45,241 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-24 19:27:45,242 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-24 19:27:45,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-24 19:27:45,307 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-24 19:27:45,307 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:27:45,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-24 19:27:45,311 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-24 19:27:45,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-24 19:27:45,319 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-24 19:27:45,328 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-24 19:27:45,331 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-24 19:27:45,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-24 19:27:45,362 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-24 19:27:45,362 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:27:45,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-24 19:27:45,367 INFO L142 LiptonReduction]: Number of co-enabled transitions 2878 [2021-03-24 19:27:47,406 WARN L205 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 191 [2021-03-24 19:27:47,680 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-24 19:27:49,065 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 316 DAG size of output: 272 [2021-03-24 19:27:49,728 WARN L205 SmtUtils]: Spent 648.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-24 19:27:50,320 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-24 19:27:50,710 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-24 19:27:50,833 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-24 19:27:52,248 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-24 19:27:52,573 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-24 19:27:53,165 WARN L205 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 271 [2021-03-24 19:27:53,835 WARN L205 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 271 [2021-03-24 19:27:54,283 INFO L154 LiptonReduction]: Checked pairs total: 5805 [2021-03-24 19:27:54,283 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-24 19:27:54,285 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8967 [2021-03-24 19:27:54,293 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-24 19:27:54,293 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:27:54,293 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:27:54,294 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:27:54,294 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:27:54,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:27:54,297 INFO L82 PathProgramCache]: Analyzing trace with hash 731378152, now seen corresponding path program 1 times [2021-03-24 19:27:54,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:27:54,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938560160] [2021-03-24 19:27:54,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:27:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:27:54,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:54,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:27:54,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:54,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:27:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:27:54,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938560160] [2021-03-24 19:27:54,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:27:54,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-24 19:27:54,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258467173] [2021-03-24 19:27:54,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-24 19:27:54,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:27:54,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-24 19:27:54,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-24 19:27:54,602 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 196 [2021-03-24 19:27:54,608 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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-03-24 19:27:54,608 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:27:54,608 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 196 [2021-03-24 19:27:54,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:27:54,790 INFO L129 PetriNetUnfolder]: 185/412 cut-off events. [2021-03-24 19:27:54,790 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:27:54,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 412 events. 185/412 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2244 event pairs, 123 based on Foata normal form. 21/395 useless extension candidates. Maximal degree in co-relation 686. Up to 209 conditions per place. [2021-03-24 19:27:54,797 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 11 selfloop transitions, 2 changer transitions 4/50 dead transitions. [2021-03-24 19:27:54,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 142 flow [2021-03-24 19:27:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-24 19:27:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-24 19:27:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2021-03-24 19:27:54,818 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9081632653061225 [2021-03-24 19:27:54,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2021-03-24 19:27:54,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2021-03-24 19:27:54,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:27:54,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2021-03-24 19:27:54,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 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-03-24 19:27:54,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 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-03-24 19:27:54,840 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 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-03-24 19:27:54,842 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 106 flow. Second operand 3 states and 534 transitions. [2021-03-24 19:27:54,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 142 flow [2021-03-24 19:27:54,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-24 19:27:54,846 INFO L241 Difference]: Finished difference. Result has 55 places, 41 transitions, 94 flow [2021-03-24 19:27:54,848 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2021-03-24 19:27:54,849 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2021-03-24 19:27:54,849 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 94 flow [2021-03-24 19:27:54,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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-03-24 19:27:54,849 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:27:54,850 INFO L263 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] [2021-03-24 19:27:54,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-24 19:27:54,850 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:27:54,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:27:54,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1380818098, now seen corresponding path program 1 times [2021-03-24 19:27:54,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:27:54,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906592807] [2021-03-24 19:27:54,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:27:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:27:55,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:27:55,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:27:55,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:27:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:27:55,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906592807] [2021-03-24 19:27:55,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:27:55,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 19:27:55,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38528476] [2021-03-24 19:27:55,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 19:27:55,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:27:55,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 19:27:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 19:27:55,033 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 196 [2021-03-24 19:27:55,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 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-03-24 19:27:55,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:27:55,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 196 [2021-03-24 19:27:55,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:27:55,062 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-24 19:27:55,063 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:27:55,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 2/48 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-24 19:27:55,063 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 2 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2021-03-24 19:27:55,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 110 flow [2021-03-24 19:27:55,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 19:27:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 19:27:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 893 transitions. [2021-03-24 19:27:55,066 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9112244897959184 [2021-03-24 19:27:55,066 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 893 transitions. [2021-03-24 19:27:55,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 893 transitions. [2021-03-24 19:27:55,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:27:55,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 893 transitions. [2021-03-24 19:27:55,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.6) internal successors, (893), 5 states have internal predecessors, (893), 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-03-24 19:27:55,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 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-03-24 19:27:55,071 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 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-03-24 19:27:55,071 INFO L185 Difference]: Start difference. First operand has 55 places, 41 transitions, 94 flow. Second operand 5 states and 893 transitions. [2021-03-24 19:27:55,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 110 flow [2021-03-24 19:27:55,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 19:27:55,073 INFO L241 Difference]: Finished difference. Result has 57 places, 41 transitions, 102 flow [2021-03-24 19:27:55,073 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2021-03-24 19:27:55,073 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2021-03-24 19:27:55,073 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 102 flow [2021-03-24 19:27:55,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 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-03-24 19:27:55,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:27:55,074 INFO L263 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] [2021-03-24 19:27:55,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-24 19:27:55,074 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:27:55,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:27:55,075 INFO L82 PathProgramCache]: Analyzing trace with hash -178611110, now seen corresponding path program 1 times [2021-03-24 19:27:55,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:27:55,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019266447] [2021-03-24 19:27:55,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:27:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:27:55,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:27:55,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:27:55,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:27:55,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 19:27:55,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:27:55,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:27:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:27:55,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019266447] [2021-03-24 19:27:55,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:27:55,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 19:27:55,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561969397] [2021-03-24 19:27:55,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 19:27:55,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:27:55,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 19:27:55,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-24 19:27:55,273 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 196 [2021-03-24 19:27:55,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 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-03-24 19:27:55,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:27:55,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 196 [2021-03-24 19:27:55,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:27:55,567 INFO L129 PetriNetUnfolder]: 346/624 cut-off events. [2021-03-24 19:27:55,567 INFO L130 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2021-03-24 19:27:55,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 624 events. 346/624 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3361 event pairs, 236 based on Foata normal form. 36/640 useless extension candidates. Maximal degree in co-relation 1251. Up to 437 conditions per place. [2021-03-24 19:27:55,573 INFO L132 encePairwiseOnDemand]: 185/196 looper letters, 10 selfloop transitions, 13 changer transitions 15/67 dead transitions. [2021-03-24 19:27:55,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 234 flow [2021-03-24 19:27:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-24 19:27:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-24 19:27:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1337 transitions. [2021-03-24 19:27:55,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8526785714285714 [2021-03-24 19:27:55,577 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1337 transitions. [2021-03-24 19:27:55,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1337 transitions. [2021-03-24 19:27:55,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:27:55,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1337 transitions. [2021-03-24 19:27:55,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 167.125) internal successors, (1337), 8 states have internal predecessors, (1337), 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-03-24 19:27:55,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 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-03-24 19:27:55,585 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 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-03-24 19:27:55,585 INFO L185 Difference]: Start difference. First operand has 57 places, 41 transitions, 102 flow. Second operand 8 states and 1337 transitions. [2021-03-24 19:27:55,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 234 flow [2021-03-24 19:27:55,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 226 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-24 19:27:55,590 INFO L241 Difference]: Finished difference. Result has 63 places, 51 transitions, 182 flow [2021-03-24 19:27:55,590 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2021-03-24 19:27:55,590 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2021-03-24 19:27:55,591 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 182 flow [2021-03-24 19:27:55,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 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-03-24 19:27:55,591 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:27:55,591 INFO L263 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] [2021-03-24 19:27:55,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-24 19:27:55,592 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:27:55,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:27:55,592 INFO L82 PathProgramCache]: Analyzing trace with hash 831908180, now seen corresponding path program 1 times [2021-03-24 19:27:55,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:27:55,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927587739] [2021-03-24 19:27:55,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:27:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:27:55,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:27:55,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:27:55,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:27:55,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:27:55,728 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-24 19:27:55,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-24 19:27:55,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:27:55,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:55,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:27:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:27:55,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927587739] [2021-03-24 19:27:55,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:27:55,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 19:27:55,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928765081] [2021-03-24 19:27:55,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 19:27:55,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:27:55,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 19:27:55,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-24 19:27:55,764 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 196 [2021-03-24 19:27:55,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 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-03-24 19:27:55,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:27:55,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 196 [2021-03-24 19:27:55,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:27:56,013 INFO L129 PetriNetUnfolder]: 338/616 cut-off events. [2021-03-24 19:27:56,013 INFO L130 PetriNetUnfolder]: For 840/966 co-relation queries the response was YES. [2021-03-24 19:27:56,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 616 events. 338/616 cut-off events. For 840/966 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3243 event pairs, 214 based on Foata normal form. 51/648 useless extension candidates. Maximal degree in co-relation 1850. Up to 402 conditions per place. [2021-03-24 19:27:56,020 INFO L132 encePairwiseOnDemand]: 185/196 looper letters, 16 selfloop transitions, 16 changer transitions 17/77 dead transitions. [2021-03-24 19:27:56,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 77 transitions, 402 flow [2021-03-24 19:27:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 19:27:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 19:27:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1632 transitions. [2021-03-24 19:27:56,025 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8326530612244898 [2021-03-24 19:27:56,025 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1632 transitions. [2021-03-24 19:27:56,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1632 transitions. [2021-03-24 19:27:56,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:27:56,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1632 transitions. [2021-03-24 19:27:56,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 163.2) internal successors, (1632), 10 states have internal predecessors, (1632), 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-03-24 19:27:56,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 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-03-24 19:27:56,034 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 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-03-24 19:27:56,034 INFO L185 Difference]: Start difference. First operand has 63 places, 51 transitions, 182 flow. Second operand 10 states and 1632 transitions. [2021-03-24 19:27:56,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 77 transitions, 402 flow [2021-03-24 19:27:56,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 77 transitions, 398 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-24 19:27:56,040 INFO L241 Difference]: Finished difference. Result has 72 places, 56 transitions, 274 flow [2021-03-24 19:27:56,040 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=274, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2021-03-24 19:27:56,041 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 13 predicate places. [2021-03-24 19:27:56,041 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 274 flow [2021-03-24 19:27:56,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 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-03-24 19:27:56,041 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:27:56,041 INFO L263 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] [2021-03-24 19:27:56,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-24 19:27:56,042 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:27:56,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:27:56,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1333960488, now seen corresponding path program 1 times [2021-03-24 19:27:56,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:27:56,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684887522] [2021-03-24 19:27:56,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:27:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:27:56,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:56,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:27:56,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:56,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:27:56,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:56,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:27:56,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:56,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:27:56,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:56,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 19:27:56,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:56,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 19:27:56,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:56,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-24 19:27:56,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:56,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:27:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:27:56,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684887522] [2021-03-24 19:27:56,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:27:56,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-24 19:27:56,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316927949] [2021-03-24 19:27:56,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-24 19:27:56,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:27:56,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-24 19:27:56,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-03-24 19:27:56,225 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 196 [2021-03-24 19:27:56,226 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 274 flow. Second operand has 9 states, 9 states have (on average 158.0) internal successors, (1422), 9 states have internal predecessors, (1422), 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-03-24 19:27:56,226 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:27:56,226 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 196 [2021-03-24 19:27:56,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:27:56,629 INFO L129 PetriNetUnfolder]: 381/691 cut-off events. [2021-03-24 19:27:56,629 INFO L130 PetriNetUnfolder]: For 2458/2792 co-relation queries the response was YES. [2021-03-24 19:27:56,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2922 conditions, 691 events. 381/691 cut-off events. For 2458/2792 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3460 event pairs, 37 based on Foata normal form. 72/747 useless extension candidates. Maximal degree in co-relation 2882. Up to 334 conditions per place. [2021-03-24 19:27:56,638 INFO L132 encePairwiseOnDemand]: 184/196 looper letters, 27 selfloop transitions, 20 changer transitions 19/93 dead transitions. [2021-03-24 19:27:56,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 93 transitions, 672 flow [2021-03-24 19:27:56,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-24 19:27:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-24 19:27:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2098 transitions. [2021-03-24 19:27:56,643 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8233908948194663 [2021-03-24 19:27:56,643 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2098 transitions. [2021-03-24 19:27:56,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2098 transitions. [2021-03-24 19:27:56,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:27:56,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2098 transitions. [2021-03-24 19:27:56,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 161.3846153846154) internal successors, (2098), 13 states have internal predecessors, (2098), 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-03-24 19:27:56,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 196.0) internal successors, (2744), 14 states have internal predecessors, (2744), 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-03-24 19:27:56,653 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 196.0) internal successors, (2744), 14 states have internal predecessors, (2744), 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-03-24 19:27:56,653 INFO L185 Difference]: Start difference. First operand has 72 places, 56 transitions, 274 flow. Second operand 13 states and 2098 transitions. [2021-03-24 19:27:56,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 93 transitions, 672 flow [2021-03-24 19:27:56,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 638 flow, removed 14 selfloop flow, removed 5 redundant places. [2021-03-24 19:27:56,660 INFO L241 Difference]: Finished difference. Result has 83 places, 64 transitions, 409 flow [2021-03-24 19:27:56,661 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=409, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2021-03-24 19:27:56,661 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 24 predicate places. [2021-03-24 19:27:56,661 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 409 flow [2021-03-24 19:27:56,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 158.0) internal successors, (1422), 9 states have internal predecessors, (1422), 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-03-24 19:27:56,663 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:27:56,663 INFO L263 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] [2021-03-24 19:27:56,663 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-24 19:27:56,664 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:27:56,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:27:56,664 INFO L82 PathProgramCache]: Analyzing trace with hash -810073541, now seen corresponding path program 1 times [2021-03-24 19:27:56,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:27:56,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311391053] [2021-03-24 19:27:56,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:27:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:27:56,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:56,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:27:56,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:56,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:27:56,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:56,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:27:56,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:56,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:27:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:27:56,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311391053] [2021-03-24 19:27:56,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:27:56,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 19:27:56,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456943926] [2021-03-24 19:27:56,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 19:27:56,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:27:56,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 19:27:56,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 19:27:56,759 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 196 [2021-03-24 19:27:56,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 409 flow. Second operand has 5 states, 5 states have (on average 170.4) internal successors, (852), 5 states have internal predecessors, (852), 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-03-24 19:27:56,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:27:56,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 196 [2021-03-24 19:27:56,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:27:56,993 INFO L129 PetriNetUnfolder]: 536/1029 cut-off events. [2021-03-24 19:27:56,993 INFO L130 PetriNetUnfolder]: For 8447/8927 co-relation queries the response was YES. [2021-03-24 19:27:57,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5690 conditions, 1029 events. 536/1029 cut-off events. For 8447/8927 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6189 event pairs, 97 based on Foata normal form. 46/969 useless extension candidates. Maximal degree in co-relation 5646. Up to 618 conditions per place. [2021-03-24 19:27:57,008 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 8 selfloop transitions, 2 changer transitions 1/68 dead transitions. [2021-03-24 19:27:57,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 68 transitions, 470 flow [2021-03-24 19:27:57,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 19:27:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 19:27:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 857 transitions. [2021-03-24 19:27:57,011 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8744897959183674 [2021-03-24 19:27:57,011 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 857 transitions. [2021-03-24 19:27:57,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 857 transitions. [2021-03-24 19:27:57,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:27:57,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 857 transitions. [2021-03-24 19:27:57,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.4) internal successors, (857), 5 states have internal predecessors, (857), 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-03-24 19:27:57,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 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-03-24 19:27:57,015 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 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-03-24 19:27:57,015 INFO L185 Difference]: Start difference. First operand has 83 places, 64 transitions, 409 flow. Second operand 5 states and 857 transitions. [2021-03-24 19:27:57,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 68 transitions, 470 flow [2021-03-24 19:27:57,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 68 transitions, 400 flow, removed 30 selfloop flow, removed 9 redundant places. [2021-03-24 19:27:57,034 INFO L241 Difference]: Finished difference. Result has 77 places, 65 transitions, 364 flow [2021-03-24 19:27:57,034 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2021-03-24 19:27:57,034 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 18 predicate places. [2021-03-24 19:27:57,034 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 364 flow [2021-03-24 19:27:57,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 170.4) internal successors, (852), 5 states have internal predecessors, (852), 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-03-24 19:27:57,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:27:57,035 INFO L263 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] [2021-03-24 19:27:57,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-24 19:27:57,035 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:27:57,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:27:57,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1610623117, now seen corresponding path program 2 times [2021-03-24 19:27:57,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:27:57,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625506748] [2021-03-24 19:27:57,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:27:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:27:57,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:57,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:27:57,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:57,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:27:57,123 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-03-24 19:27:57,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-24 19:27:57,135 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.3 percent of original size [2021-03-24 19:27:57,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-24 19:27:57,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:57,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:27:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:27:57,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625506748] [2021-03-24 19:27:57,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:27:57,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 19:27:57,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762784254] [2021-03-24 19:27:57,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 19:27:57,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:27:57,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 19:27:57,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-24 19:27:57,157 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 196 [2021-03-24 19:27:57,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 162.33333333333334) internal successors, (974), 6 states have internal predecessors, (974), 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-03-24 19:27:57,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:27:57,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 196 [2021-03-24 19:27:57,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:27:57,446 INFO L129 PetriNetUnfolder]: 737/1386 cut-off events. [2021-03-24 19:27:57,447 INFO L130 PetriNetUnfolder]: For 7499/7773 co-relation queries the response was YES. [2021-03-24 19:27:57,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6635 conditions, 1386 events. 737/1386 cut-off events. For 7499/7773 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8554 event pairs, 90 based on Foata normal form. 135/1432 useless extension candidates. Maximal degree in co-relation 6595. Up to 749 conditions per place. [2021-03-24 19:27:57,463 INFO L132 encePairwiseOnDemand]: 187/196 looper letters, 41 selfloop transitions, 14 changer transitions 17/106 dead transitions. [2021-03-24 19:27:57,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 106 transitions, 838 flow [2021-03-24 19:27:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-24 19:27:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-24 19:27:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 999 transitions. [2021-03-24 19:27:57,465 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8494897959183674 [2021-03-24 19:27:57,465 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 999 transitions. [2021-03-24 19:27:57,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 999 transitions. [2021-03-24 19:27:57,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:27:57,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 999 transitions. [2021-03-24 19:27:57,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 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-03-24 19:27:57,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 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-03-24 19:27:57,472 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 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-03-24 19:27:57,472 INFO L185 Difference]: Start difference. First operand has 77 places, 65 transitions, 364 flow. Second operand 6 states and 999 transitions. [2021-03-24 19:27:57,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 106 transitions, 838 flow [2021-03-24 19:27:57,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 106 transitions, 835 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-24 19:27:57,482 INFO L241 Difference]: Finished difference. Result has 83 places, 77 transitions, 524 flow [2021-03-24 19:27:57,483 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=524, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2021-03-24 19:27:57,483 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 24 predicate places. [2021-03-24 19:27:57,483 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 524 flow [2021-03-24 19:27:57,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.33333333333334) internal successors, (974), 6 states have internal predecessors, (974), 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-03-24 19:27:57,484 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:27:57,484 INFO L263 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] [2021-03-24 19:27:57,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-24 19:27:57,484 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:27:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:27:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1071966716, now seen corresponding path program 1 times [2021-03-24 19:27:57,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:27:57,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978721640] [2021-03-24 19:27:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:27:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:27:57,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:57,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:27:57,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:57,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:27:57,549 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:27:57,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:27:57,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:57,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:27:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:27:57,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978721640] [2021-03-24 19:27:57,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:27:57,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 19:27:57,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377571107] [2021-03-24 19:27:57,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 19:27:57,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:27:57,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 19:27:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 19:27:57,560 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 196 [2021-03-24 19:27:57,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 524 flow. Second operand has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 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-03-24 19:27:57,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:27:57,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 196 [2021-03-24 19:27:57,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:27:58,080 INFO L129 PetriNetUnfolder]: 1523/2810 cut-off events. [2021-03-24 19:27:58,080 INFO L130 PetriNetUnfolder]: For 8149/8714 co-relation queries the response was YES. [2021-03-24 19:27:58,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9559 conditions, 2810 events. 1523/2810 cut-off events. For 8149/8714 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 21762 event pairs, 458 based on Foata normal form. 241/2693 useless extension candidates. Maximal degree in co-relation 9517. Up to 1197 conditions per place. [2021-03-24 19:27:58,124 INFO L132 encePairwiseOnDemand]: 188/196 looper letters, 16 selfloop transitions, 16 changer transitions 0/98 dead transitions. [2021-03-24 19:27:58,124 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 98 transitions, 618 flow [2021-03-24 19:27:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 19:27:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 19:27:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1174 transitions. [2021-03-24 19:27:58,128 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8556851311953353 [2021-03-24 19:27:58,128 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1174 transitions. [2021-03-24 19:27:58,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1174 transitions. [2021-03-24 19:27:58,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:27:58,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1174 transitions. [2021-03-24 19:27:58,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.71428571428572) internal successors, (1174), 7 states have internal predecessors, (1174), 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-03-24 19:27:58,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 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-03-24 19:27:58,134 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 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-03-24 19:27:58,134 INFO L185 Difference]: Start difference. First operand has 83 places, 77 transitions, 524 flow. Second operand 7 states and 1174 transitions. [2021-03-24 19:27:58,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 98 transitions, 618 flow [2021-03-24 19:27:58,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 98 transitions, 607 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-24 19:27:58,150 INFO L241 Difference]: Finished difference. Result has 88 places, 90 transitions, 617 flow [2021-03-24 19:27:58,151 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=617, PETRI_PLACES=88, PETRI_TRANSITIONS=90} [2021-03-24 19:27:58,151 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 29 predicate places. [2021-03-24 19:27:58,151 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 617 flow [2021-03-24 19:27:58,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 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-03-24 19:27:58,152 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:27:58,152 INFO L263 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] [2021-03-24 19:27:58,152 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-24 19:27:58,152 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:27:58,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:27:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash 695185129, now seen corresponding path program 1 times [2021-03-24 19:27:58,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:27:58,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861293798] [2021-03-24 19:27:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:27:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:27:58,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:58,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:27:58,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:58,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:27:58,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:58,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:27:58,228 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:27:58,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:27:58,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:58,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:27:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:27:58,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861293798] [2021-03-24 19:27:58,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:27:58,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 19:27:58,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865424775] [2021-03-24 19:27:58,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 19:27:58,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:27:58,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 19:27:58,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-24 19:27:58,243 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 196 [2021-03-24 19:27:58,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 90 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 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-03-24 19:27:58,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:27:58,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 196 [2021-03-24 19:27:58,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:27:58,704 INFO L129 PetriNetUnfolder]: 1119/2267 cut-off events. [2021-03-24 19:27:58,704 INFO L130 PetriNetUnfolder]: For 10357/19872 co-relation queries the response was YES. [2021-03-24 19:27:58,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10383 conditions, 2267 events. 1119/2267 cut-off events. For 10357/19872 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 17895 event pairs, 124 based on Foata normal form. 1024/3045 useless extension candidates. Maximal degree in co-relation 10338. Up to 1190 conditions per place. [2021-03-24 19:27:58,740 INFO L132 encePairwiseOnDemand]: 188/196 looper letters, 16 selfloop transitions, 32 changer transitions 0/114 dead transitions. [2021-03-24 19:27:58,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 114 transitions, 890 flow [2021-03-24 19:27:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 19:27:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 19:27:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1677 transitions. [2021-03-24 19:27:58,744 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8556122448979592 [2021-03-24 19:27:58,744 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1677 transitions. [2021-03-24 19:27:58,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1677 transitions. [2021-03-24 19:27:58,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:27:58,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1677 transitions. [2021-03-24 19:27:58,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 167.7) internal successors, (1677), 10 states have internal predecessors, (1677), 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-03-24 19:27:58,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 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-03-24 19:27:58,752 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 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-03-24 19:27:58,752 INFO L185 Difference]: Start difference. First operand has 88 places, 90 transitions, 617 flow. Second operand 10 states and 1677 transitions. [2021-03-24 19:27:58,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 114 transitions, 890 flow [2021-03-24 19:27:58,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 114 transitions, 890 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-24 19:27:58,768 INFO L241 Difference]: Finished difference. Result has 101 places, 106 transitions, 866 flow [2021-03-24 19:27:58,768 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=866, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2021-03-24 19:27:58,768 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 42 predicate places. [2021-03-24 19:27:58,768 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 866 flow [2021-03-24 19:27:58,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 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-03-24 19:27:58,769 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:27:58,769 INFO L263 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] [2021-03-24 19:27:58,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-24 19:27:58,769 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:27:58,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:27:58,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1644918899, now seen corresponding path program 1 times [2021-03-24 19:27:58,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:27:58,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564962794] [2021-03-24 19:27:58,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:27:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:27:58,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:58,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:27:58,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:58,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:27:58,869 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-03-24 19:27:58,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-24 19:27:58,882 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.3 percent of original size [2021-03-24 19:27:58,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-24 19:27:58,896 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.3 percent of original size [2021-03-24 19:27:58,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-24 19:27:58,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:58,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:27:58,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:27:58,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:27:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:27:58,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564962794] [2021-03-24 19:27:58,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:27:58,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 19:27:58,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642928001] [2021-03-24 19:27:58,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 19:27:58,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:27:58,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 19:27:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-24 19:27:58,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 196 [2021-03-24 19:27:58,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 866 flow. Second operand has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 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-03-24 19:27:58,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:27:58,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 196 [2021-03-24 19:27:58,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:27:59,946 INFO L129 PetriNetUnfolder]: 2743/5492 cut-off events. [2021-03-24 19:27:59,946 INFO L130 PetriNetUnfolder]: For 50910/85490 co-relation queries the response was YES. [2021-03-24 19:28:00,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30316 conditions, 5492 events. 2743/5492 cut-off events. For 50910/85490 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 48648 event pairs, 139 based on Foata normal form. 496/5426 useless extension candidates. Maximal degree in co-relation 30262. Up to 2421 conditions per place. [2021-03-24 19:28:00,052 INFO L132 encePairwiseOnDemand]: 186/196 looper letters, 86 selfloop transitions, 53 changer transitions 5/206 dead transitions. [2021-03-24 19:28:00,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 206 transitions, 2124 flow [2021-03-24 19:28:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 19:28:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 19:28:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1126 transitions. [2021-03-24 19:28:00,056 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8206997084548106 [2021-03-24 19:28:00,056 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1126 transitions. [2021-03-24 19:28:00,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1126 transitions. [2021-03-24 19:28:00,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:28:00,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1126 transitions. [2021-03-24 19:28:00,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 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-03-24 19:28:00,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 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-03-24 19:28:00,062 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 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-03-24 19:28:00,062 INFO L185 Difference]: Start difference. First operand has 101 places, 106 transitions, 866 flow. Second operand 7 states and 1126 transitions. [2021-03-24 19:28:00,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 206 transitions, 2124 flow [2021-03-24 19:28:00,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 206 transitions, 2031 flow, removed 38 selfloop flow, removed 3 redundant places. [2021-03-24 19:28:00,369 INFO L241 Difference]: Finished difference. Result has 108 places, 153 transitions, 1506 flow [2021-03-24 19:28:00,369 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1506, PETRI_PLACES=108, PETRI_TRANSITIONS=153} [2021-03-24 19:28:00,370 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 49 predicate places. [2021-03-24 19:28:00,370 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 153 transitions, 1506 flow [2021-03-24 19:28:00,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 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-03-24 19:28:00,370 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:28:00,370 INFO L263 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] [2021-03-24 19:28:00,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-24 19:28:00,371 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:28:00,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:28:00,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1381527849, now seen corresponding path program 2 times [2021-03-24 19:28:00,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:28:00,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071550410] [2021-03-24 19:28:00,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:28:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:28:00,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:00,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:28:00,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:00,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:28:00,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:00,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:28:00,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:00,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:28:00,455 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:28:00,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:28:00,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:00,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:28:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:28:00,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071550410] [2021-03-24 19:28:00,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:28:00,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 19:28:00,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458942917] [2021-03-24 19:28:00,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 19:28:00,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:28:00,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 19:28:00,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-24 19:28:00,466 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 196 [2021-03-24 19:28:00,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 153 transitions, 1506 flow. Second operand has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 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-03-24 19:28:00,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:28:00,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 196 [2021-03-24 19:28:00,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:28:01,369 INFO L129 PetriNetUnfolder]: 2380/4982 cut-off events. [2021-03-24 19:28:01,369 INFO L130 PetriNetUnfolder]: For 44582/67737 co-relation queries the response was YES. [2021-03-24 19:28:01,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26111 conditions, 4982 events. 2380/4982 cut-off events. For 44582/67737 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 45998 event pairs, 41 based on Foata normal form. 4425/9017 useless extension candidates. Maximal degree in co-relation 26056. Up to 1816 conditions per place. [2021-03-24 19:28:01,444 INFO L132 encePairwiseOnDemand]: 188/196 looper letters, 7 selfloop transitions, 49 changer transitions 11/176 dead transitions. [2021-03-24 19:28:01,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 176 transitions, 1908 flow [2021-03-24 19:28:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-24 19:28:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-24 19:28:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2180 transitions. [2021-03-24 19:28:01,449 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8555729984301413 [2021-03-24 19:28:01,449 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2180 transitions. [2021-03-24 19:28:01,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2180 transitions. [2021-03-24 19:28:01,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:28:01,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2180 transitions. [2021-03-24 19:28:01,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 167.69230769230768) internal successors, (2180), 13 states have internal predecessors, (2180), 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-03-24 19:28:01,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 196.0) internal successors, (2744), 14 states have internal predecessors, (2744), 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-03-24 19:28:01,458 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 196.0) internal successors, (2744), 14 states have internal predecessors, (2744), 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-03-24 19:28:01,458 INFO L185 Difference]: Start difference. First operand has 108 places, 153 transitions, 1506 flow. Second operand 13 states and 2180 transitions. [2021-03-24 19:28:01,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 176 transitions, 1908 flow [2021-03-24 19:28:01,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 176 transitions, 1873 flow, removed 11 selfloop flow, removed 1 redundant places. [2021-03-24 19:28:01,790 INFO L241 Difference]: Finished difference. Result has 122 places, 165 transitions, 1715 flow [2021-03-24 19:28:01,790 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1715, PETRI_PLACES=122, PETRI_TRANSITIONS=165} [2021-03-24 19:28:01,791 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 63 predicate places. [2021-03-24 19:28:01,791 INFO L480 AbstractCegarLoop]: Abstraction has has 122 places, 165 transitions, 1715 flow [2021-03-24 19:28:01,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 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-03-24 19:28:01,791 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:28:01,791 INFO L263 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] [2021-03-24 19:28:01,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-24 19:28:01,792 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:28:01,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:28:01,792 INFO L82 PathProgramCache]: Analyzing trace with hash -592300502, now seen corresponding path program 1 times [2021-03-24 19:28:01,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:28:01,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211223560] [2021-03-24 19:28:01,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:28:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:28:01,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:01,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:28:01,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:01,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:28:01,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:01,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:28:01,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:01,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:28:01,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:01,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:28:01,892 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:28:01,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:28:01,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:01,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:28:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:28:01,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211223560] [2021-03-24 19:28:01,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:28:01,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 19:28:01,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266156171] [2021-03-24 19:28:01,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 19:28:01,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:28:01,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 19:28:01,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-24 19:28:01,907 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 196 [2021-03-24 19:28:01,908 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 165 transitions, 1715 flow. Second operand has 8 states, 8 states have (on average 163.875) internal successors, (1311), 8 states have internal predecessors, (1311), 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-03-24 19:28:01,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:28:01,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 196 [2021-03-24 19:28:01,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:28:02,820 INFO L129 PetriNetUnfolder]: 2247/4741 cut-off events. [2021-03-24 19:28:02,820 INFO L130 PetriNetUnfolder]: For 52701/85813 co-relation queries the response was YES. [2021-03-24 19:28:02,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28514 conditions, 4741 events. 2247/4741 cut-off events. For 52701/85813 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 44359 event pairs, 21 based on Foata normal form. 3834/8187 useless extension candidates. Maximal degree in co-relation 28474. Up to 1699 conditions per place. [2021-03-24 19:28:02,903 INFO L132 encePairwiseOnDemand]: 188/196 looper letters, 3 selfloop transitions, 55 changer transitions 9/176 dead transitions. [2021-03-24 19:28:02,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 176 transitions, 1997 flow [2021-03-24 19:28:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-24 19:28:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-03-24 19:28:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2671 transitions. [2021-03-24 19:28:02,909 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8517219387755102 [2021-03-24 19:28:02,909 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2671 transitions. [2021-03-24 19:28:02,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2671 transitions. [2021-03-24 19:28:02,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:28:02,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2671 transitions. [2021-03-24 19:28:02,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 166.9375) internal successors, (2671), 16 states have internal predecessors, (2671), 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-03-24 19:28:02,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 196.0) internal successors, (3332), 17 states have internal predecessors, (3332), 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-03-24 19:28:02,922 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 196.0) internal successors, (3332), 17 states have internal predecessors, (3332), 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-03-24 19:28:02,922 INFO L185 Difference]: Start difference. First operand has 122 places, 165 transitions, 1715 flow. Second operand 16 states and 2671 transitions. [2021-03-24 19:28:02,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 176 transitions, 1997 flow [2021-03-24 19:28:03,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 176 transitions, 1683 flow, removed 120 selfloop flow, removed 11 redundant places. [2021-03-24 19:28:03,951 INFO L241 Difference]: Finished difference. Result has 130 places, 167 transitions, 1595 flow [2021-03-24 19:28:03,952 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1595, PETRI_PLACES=130, PETRI_TRANSITIONS=167} [2021-03-24 19:28:03,952 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 71 predicate places. [2021-03-24 19:28:03,952 INFO L480 AbstractCegarLoop]: Abstraction has has 130 places, 167 transitions, 1595 flow [2021-03-24 19:28:03,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 163.875) internal successors, (1311), 8 states have internal predecessors, (1311), 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-03-24 19:28:03,952 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:28:03,953 INFO L263 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] [2021-03-24 19:28:03,953 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-24 19:28:03,953 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:28:03,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:28:03,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1300192547, now seen corresponding path program 1 times [2021-03-24 19:28:03,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:28:03,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376561579] [2021-03-24 19:28:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:28:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:28:04,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:04,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:28:04,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:04,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:28:04,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:04,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:28:04,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:28:04,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:28:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:28:04,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376561579] [2021-03-24 19:28:04,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:28:04,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 19:28:04,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318253482] [2021-03-24 19:28:04,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 19:28:04,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:28:04,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 19:28:04,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 19:28:04,038 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 196 [2021-03-24 19:28:04,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 167 transitions, 1595 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 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-03-24 19:28:04,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:28:04,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 196 [2021-03-24 19:28:04,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:28:04,948 INFO L129 PetriNetUnfolder]: 3962/8250 cut-off events. [2021-03-24 19:28:04,949 INFO L130 PetriNetUnfolder]: For 33620/36223 co-relation queries the response was YES. [2021-03-24 19:28:05,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36924 conditions, 8250 events. 3962/8250 cut-off events. For 33620/36223 co-relation queries the response was YES. Maximal size of possible extension queue 1287. Compared 83639 event pairs, 37 based on Foata normal form. 161/7743 useless extension candidates. Maximal degree in co-relation 36864. Up to 1631 conditions per place. [2021-03-24 19:28:05,024 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 4 selfloop transitions, 2 changer transitions 34/169 dead transitions. [2021-03-24 19:28:05,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 169 transitions, 1617 flow [2021-03-24 19:28:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 19:28:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 19:28:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 878 transitions. [2021-03-24 19:28:05,026 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8959183673469387 [2021-03-24 19:28:05,026 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 878 transitions. [2021-03-24 19:28:05,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 878 transitions. [2021-03-24 19:28:05,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:28:05,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 878 transitions. [2021-03-24 19:28:05,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.6) internal successors, (878), 5 states have internal predecessors, (878), 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-03-24 19:28:05,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 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-03-24 19:28:05,030 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 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-03-24 19:28:05,030 INFO L185 Difference]: Start difference. First operand has 130 places, 167 transitions, 1595 flow. Second operand 5 states and 878 transitions. [2021-03-24 19:28:05,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 169 transitions, 1617 flow [2021-03-24 19:28:06,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 169 transitions, 1460 flow, removed 33 selfloop flow, removed 15 redundant places. [2021-03-24 19:28:06,760 INFO L241 Difference]: Finished difference. Result has 120 places, 135 transitions, 1071 flow [2021-03-24 19:28:06,760 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1071, PETRI_PLACES=120, PETRI_TRANSITIONS=135} [2021-03-24 19:28:06,760 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 61 predicate places. [2021-03-24 19:28:06,760 INFO L480 AbstractCegarLoop]: Abstraction has has 120 places, 135 transitions, 1071 flow [2021-03-24 19:28:06,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 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-03-24 19:28:06,761 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:28:06,761 INFO L263 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] [2021-03-24 19:28:06,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-24 19:28:06,761 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:28:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:28:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash -773836217, now seen corresponding path program 2 times [2021-03-24 19:28:06,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:28:06,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702234587] [2021-03-24 19:28:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:28:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 19:28:06,804 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 19:28:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 19:28:06,849 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 19:28:06,880 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-24 19:28:06,880 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-24 19:28:06,880 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-24 19:28:07,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 07:28:07 BasicIcfg [2021-03-24 19:28:07,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-24 19:28:07,004 INFO L168 Benchmark]: Toolchain (without parser) took 24646.26 ms. Allocated memory was 348.1 MB in the beginning and 897.6 MB in the end (delta: 549.5 MB). Free memory was 310.8 MB in the beginning and 628.4 MB in the end (delta: -317.6 MB). Peak memory consumption was 233.0 MB. Max. memory is 16.0 GB. [2021-03-24 19:28:07,005 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 348.1 MB. Free memory was 329.5 MB in the beginning and 329.4 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 19:28:07,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.24 ms. Allocated memory is still 348.1 MB. Free memory was 310.6 MB in the beginning and 307.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-03-24 19:28:07,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.37 ms. Allocated memory is still 348.1 MB. Free memory was 307.6 MB in the beginning and 303.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-24 19:28:07,005 INFO L168 Benchmark]: Boogie Preprocessor took 31.99 ms. Allocated memory is still 348.1 MB. Free memory was 303.4 MB in the beginning and 301.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 19:28:07,005 INFO L168 Benchmark]: RCFGBuilder took 2045.96 ms. Allocated memory is still 348.1 MB. Free memory was 301.3 MB in the beginning and 221.0 MB in the end (delta: 80.3 MB). Peak memory consumption was 161.0 MB. Max. memory is 16.0 GB. [2021-03-24 19:28:07,006 INFO L168 Benchmark]: TraceAbstraction took 21896.76 ms. Allocated memory was 348.1 MB in the beginning and 897.6 MB in the end (delta: 549.5 MB). Free memory was 220.0 MB in the beginning and 628.4 MB in the end (delta: -408.4 MB). Peak memory consumption was 142.1 MB. Max. memory is 16.0 GB. [2021-03-24 19:28:07,007 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.14 ms. Allocated memory is still 348.1 MB. Free memory was 329.5 MB in the beginning and 329.4 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 615.24 ms. Allocated memory is still 348.1 MB. Free memory was 310.6 MB in the beginning and 307.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.37 ms. Allocated memory is still 348.1 MB. Free memory was 307.6 MB in the beginning and 303.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.99 ms. Allocated memory is still 348.1 MB. Free memory was 303.4 MB in the beginning and 301.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2045.96 ms. Allocated memory is still 348.1 MB. Free memory was 301.3 MB in the beginning and 221.0 MB in the end (delta: 80.3 MB). Peak memory consumption was 161.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21896.76 ms. Allocated memory was 348.1 MB in the beginning and 897.6 MB in the end (delta: 549.5 MB). Free memory was 220.0 MB in the beginning and 628.4 MB in the end (delta: -408.4 MB). Peak memory consumption was 142.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8952.5ms, 127 PlacesBefore, 59 PlacesAfterwards, 116 TransitionsBefore, 47 TransitionsAfterwards, 2878 CoEnabledTransitionPairs, 5 FixpointIterations, 32 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 5805 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2635, positive: 2508, positive conditional: 0, positive unconditional: 2508, negative: 127, negative conditional: 0, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1809, positive: 1755, positive conditional: 0, positive unconditional: 1755, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1809, positive: 1755, positive conditional: 0, positive unconditional: 1755, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1809, positive: 1743, positive conditional: 0, positive unconditional: 1743, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1030, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 998, negative conditional: 0, negative unconditional: 998, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2635, positive: 753, positive conditional: 0, positive unconditional: 753, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 1809, unknown conditional: 0, unknown unconditional: 1809] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 278, Positive conditional cache size: 0, Positive unconditional cache size: 278, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21645.3ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 10597.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9048.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 106 SDtfs, 156 SDslu, 165 SDs, 0 SdLazy, 590 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 724.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 765.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1715occurred in iteration=11, InterpolantAutomatonStates: 108, 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: 58.7ms SsaConstructionTime, 593.1ms SatisfiabilityAnalysisTime, 1048.6ms InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 1546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...