/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 09:57:28,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 09:57:28,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 09:57:28,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 09:57:28,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 09:57:28,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 09:57:28,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 09:57:28,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 09:57:28,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 09:57:28,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 09:57:28,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 09:57:28,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 09:57:28,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 09:57:28,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 09:57:28,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 09:57:28,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 09:57:28,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 09:57:28,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 09:57:28,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 09:57:28,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 09:57:28,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 09:57:28,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 09:57:28,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 09:57:28,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 09:57:28,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 09:57:28,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 09:57:28,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 09:57:28,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 09:57:28,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 09:57:28,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 09:57:28,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 09:57:28,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 09:57:28,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 09:57:28,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 09:57:28,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 09:57:28,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 09:57:28,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 09:57:28,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 09:57:28,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 09:57:28,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 09:57:28,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 09:57:28,129 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 09:57:28,163 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 09:57:28,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 09:57:28,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 09:57:28,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 09:57:28,166 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 09:57:28,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 09:57:28,167 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 09:57:28,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 09:57:28,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 09:57:28,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 09:57:28,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 09:57:28,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 09:57:28,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 09:57:28,169 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 09:57:28,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 09:57:28,169 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 09:57:28,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 09:57:28,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 09:57:28,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 09:57:28,170 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 09:57:28,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 09:57:28,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 09:57:28,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 09:57:28,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 09:57:28,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 09:57:28,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 09:57:28,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 09:57:28,171 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 09:57:28,171 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 09:57:28,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 09:57:28,172 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 09:57:28,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 09:57:28,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 09:57:28,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 09:57:28,476 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 09:57:28,477 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 09:57:28,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i [2021-03-26 09:57:28,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc01992ad/d899a6e21dc94319a0f4aa8f54951d2a/FLAG94183d90c [2021-03-26 09:57:29,067 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 09:57:29,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i [2021-03-26 09:57:29,088 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc01992ad/d899a6e21dc94319a0f4aa8f54951d2a/FLAG94183d90c [2021-03-26 09:57:29,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc01992ad/d899a6e21dc94319a0f4aa8f54951d2a [2021-03-26 09:57:29,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 09:57:29,567 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 09:57:29,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 09:57:29,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 09:57:29,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 09:57:29,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:57:29" (1/1) ... [2021-03-26 09:57:29,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681ec50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:29, skipping insertion in model container [2021-03-26 09:57:29,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:57:29" (1/1) ... [2021-03-26 09:57:29,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 09:57:29,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 09:57:29,772 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/mix017_rmo.opt.i[948,961] [2021-03-26 09:57:29,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:57:29,926 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 09:57:29,938 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/mix017_rmo.opt.i[948,961] [2021-03-26 09:57:30,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:57:30,092 INFO L208 MainTranslator]: Completed translation [2021-03-26 09:57:30,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:30 WrapperNode [2021-03-26 09:57:30,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 09:57:30,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 09:57:30,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 09:57:30,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 09:57:30,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:30" (1/1) ... [2021-03-26 09:57:30,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:30" (1/1) ... [2021-03-26 09:57:30,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 09:57:30,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 09:57:30,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 09:57:30,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 09:57:30,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:30" (1/1) ... [2021-03-26 09:57:30,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:30" (1/1) ... [2021-03-26 09:57:30,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:30" (1/1) ... [2021-03-26 09:57:30,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:30" (1/1) ... [2021-03-26 09:57:30,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:30" (1/1) ... [2021-03-26 09:57:30,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:30" (1/1) ... [2021-03-26 09:57:30,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:30" (1/1) ... [2021-03-26 09:57:30,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 09:57:30,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 09:57:30,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 09:57:30,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 09:57:30,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:30" (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-26 09:57:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 09:57:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 09:57:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 09:57:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 09:57:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 09:57:30,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 09:57:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 09:57:30,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 09:57:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 09:57:30,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 09:57:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 09:57:30,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 09:57:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 09:57:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 09:57:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 09:57:30,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 09:57:30,302 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 09:57:32,053 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 09:57:32,053 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 09:57:32,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:57:32 BoogieIcfgContainer [2021-03-26 09:57:32,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 09:57:32,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 09:57:32,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 09:57:32,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 09:57:32,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 09:57:29" (1/3) ... [2021-03-26 09:57:32,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427da539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:57:32, skipping insertion in model container [2021-03-26 09:57:32,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:30" (2/3) ... [2021-03-26 09:57:32,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427da539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:57:32, skipping insertion in model container [2021-03-26 09:57:32,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:57:32" (3/3) ... [2021-03-26 09:57:32,064 INFO L111 eAbstractionObserver]: Analyzing ICFG mix017_rmo.opt.i [2021-03-26 09:57:32,070 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 09:57:32,074 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 09:57:32,075 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 09:57:32,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,113 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,113 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,113 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,113 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,140 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,140 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,140 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,140 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,141 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,141 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,141 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,142 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,145 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,145 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,145 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,145 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,150 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,152 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,158 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,159 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,159 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,161 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,162 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,164 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,164 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:32,165 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 09:57:32,182 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 09:57:32,201 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 09:57:32,201 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 09:57:32,201 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 09:57:32,201 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 09:57:32,201 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 09:57:32,201 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 09:57:32,201 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 09:57:32,201 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 09:57:32,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 09:57:32,248 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 09:57:32,248 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:32,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-26 09:57:32,252 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 09:57:32,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-26 09:57:32,258 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:32,269 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 09:57:32,272 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 09:57:32,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-26 09:57:32,292 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 09:57:32,293 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:32,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-26 09:57:32,297 INFO L142 LiptonReduction]: Number of co-enabled transitions 2512 [2021-03-26 09:57:33,708 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 09:57:34,125 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 09:57:34,295 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 09:57:35,544 INFO L154 LiptonReduction]: Checked pairs total: 4168 [2021-03-26 09:57:35,545 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-26 09:57:35,547 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3290 [2021-03-26 09:57:35,556 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-26 09:57:35,556 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:35,556 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:35,557 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:35,557 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:35,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:35,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1330076936, now seen corresponding path program 1 times [2021-03-26 09:57:35,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:35,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098189768] [2021-03-26 09:57:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:35,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:35,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:35,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:35,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:35,786 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-26 09:57:35,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098189768] [2021-03-26 09:57:35,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:35,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:57:35,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305961889] [2021-03-26 09:57:35,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 09:57:35,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:35,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 09:57:35,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 09:57:35,809 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 192 [2021-03-26 09:57:35,814 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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-26 09:57:35,814 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:35,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 192 [2021-03-26 09:57:35,815 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:35,910 INFO L129 PetriNetUnfolder]: 29/148 cut-off events. [2021-03-26 09:57:35,910 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:35,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 148 events. 29/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 595 event pairs, 15 based on Foata normal form. 9/140 useless extension candidates. Maximal degree in co-relation 193. Up to 41 conditions per place. [2021-03-26 09:57:35,914 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 7 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2021-03-26 09:57:35,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 122 flow [2021-03-26 09:57:35,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:57:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:57:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2021-03-26 09:57:35,957 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9114583333333334 [2021-03-26 09:57:35,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2021-03-26 09:57:35,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2021-03-26 09:57:35,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:35,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2021-03-26 09:57:35,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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-26 09:57:35,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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-26 09:57:35,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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-26 09:57:35,987 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 525 transitions. [2021-03-26 09:57:35,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 122 flow [2021-03-26 09:57:35,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 09:57:35,991 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 98 flow [2021-03-26 09:57:35,993 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-26 09:57:35,994 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-26 09:57:35,994 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:35,994 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-26 09:57:35,995 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-26 09:57:35,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2021-03-26 09:57:36,004 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-03-26 09:57:36,004 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:36,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 09:57:36,005 INFO L142 LiptonReduction]: Number of co-enabled transitions 512 [2021-03-26 09:57:36,401 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 09:57:36,546 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 09:57:37,919 INFO L154 LiptonReduction]: Checked pairs total: 2080 [2021-03-26 09:57:37,920 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-26 09:57:37,920 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1926 [2021-03-26 09:57:37,922 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-26 09:57:37,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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-26 09:57:37,923 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:37,923 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] [2021-03-26 09:57:37,923 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 09:57:37,923 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:37,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:37,926 INFO L82 PathProgramCache]: Analyzing trace with hash -855823093, now seen corresponding path program 1 times [2021-03-26 09:57:37,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:37,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496677756] [2021-03-26 09:57:37,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:38,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:38,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:38,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:38,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:38,061 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 09:57:38,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:57:38,065 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-26 09:57:38,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496677756] [2021-03-26 09:57:38,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:38,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:57:38,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490150537] [2021-03-26 09:57:38,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:57:38,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:38,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:57:38,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:57:38,069 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 206 [2021-03-26 09:57:38,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 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-26 09:57:38,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:38,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 206 [2021-03-26 09:57:38,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:38,096 INFO L129 PetriNetUnfolder]: 1/31 cut-off events. [2021-03-26 09:57:38,096 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:38,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 39. Up to 3 conditions per place. [2021-03-26 09:57:38,097 INFO L132 encePairwiseOnDemand]: 202/206 looper letters, 1 selfloop transitions, 2 changer transitions 3/31 dead transitions. [2021-03-26 09:57:38,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 86 flow [2021-03-26 09:57:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:57:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:57:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 912 transitions. [2021-03-26 09:57:38,100 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8854368932038835 [2021-03-26 09:57:38,100 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 912 transitions. [2021-03-26 09:57:38,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 912 transitions. [2021-03-26 09:57:38,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:38,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 912 transitions. [2021-03-26 09:57:38,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.4) internal successors, (912), 5 states have internal predecessors, (912), 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-26 09:57:38,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-26 09:57:38,114 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-26 09:57:38,114 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 5 states and 912 transitions. [2021-03-26 09:57:38,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 86 flow [2021-03-26 09:57:38,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:57:38,115 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 72 flow [2021-03-26 09:57:38,115 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2021-03-26 09:57:38,116 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -15 predicate places. [2021-03-26 09:57:38,116 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:38,116 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 72 flow [2021-03-26 09:57:38,117 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 72 flow [2021-03-26 09:57:38,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2021-03-26 09:57:38,122 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 09:57:38,122 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:38,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 09:57:38,122 INFO L142 LiptonReduction]: Number of co-enabled transitions 328 [2021-03-26 09:57:38,831 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 09:57:39,027 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 09:57:39,364 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 09:57:39,536 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 09:57:39,542 INFO L154 LiptonReduction]: Checked pairs total: 1088 [2021-03-26 09:57:39,542 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 09:57:39,542 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1426 [2021-03-26 09:57:39,543 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2021-03-26 09:57:39,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 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-26 09:57:39,544 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:39,544 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:39,544 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 09:57:39,544 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:39,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash 249399682, now seen corresponding path program 1 times [2021-03-26 09:57:39,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:39,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114268958] [2021-03-26 09:57:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:39,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:39,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:39,666 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 09:57:39,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 09:57:39,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:39,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:39,677 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-26 09:57:39,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114268958] [2021-03-26 09:57:39,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:39,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:57:39,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856618035] [2021-03-26 09:57:39,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:57:39,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:39,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:57:39,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:57:39,679 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 209 [2021-03-26 09:57:39,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 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-26 09:57:39,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:39,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 209 [2021-03-26 09:57:39,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:39,728 INFO L129 PetriNetUnfolder]: 90/184 cut-off events. [2021-03-26 09:57:39,728 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:39,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 184 events. 90/184 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 808 event pairs, 46 based on Foata normal form. 16/195 useless extension candidates. Maximal degree in co-relation 356. Up to 119 conditions per place. [2021-03-26 09:57:39,730 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 6 selfloop transitions, 5 changer transitions 9/38 dead transitions. [2021-03-26 09:57:39,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 132 flow [2021-03-26 09:57:39,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:57:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:57:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 902 transitions. [2021-03-26 09:57:39,733 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8631578947368421 [2021-03-26 09:57:39,733 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 902 transitions. [2021-03-26 09:57:39,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 902 transitions. [2021-03-26 09:57:39,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:39,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 902 transitions. [2021-03-26 09:57:39,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.4) internal successors, (902), 5 states have internal predecessors, (902), 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-26 09:57:39,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-26 09:57:39,738 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-26 09:57:39,739 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 5 states and 902 transitions. [2021-03-26 09:57:39,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 132 flow [2021-03-26 09:57:39,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:57:39,740 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 107 flow [2021-03-26 09:57:39,740 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2021-03-26 09:57:39,740 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -16 predicate places. [2021-03-26 09:57:39,740 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:39,741 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 107 flow [2021-03-26 09:57:39,741 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 29 transitions, 107 flow [2021-03-26 09:57:39,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 107 flow [2021-03-26 09:57:39,754 INFO L129 PetriNetUnfolder]: 73/145 cut-off events. [2021-03-26 09:57:39,754 INFO L130 PetriNetUnfolder]: For 72/76 co-relation queries the response was YES. [2021-03-26 09:57:39,755 INFO L84 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 145 events. 73/145 cut-off events. For 72/76 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 524 event pairs, 40 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 380. Up to 104 conditions per place. [2021-03-26 09:57:39,757 INFO L142 LiptonReduction]: Number of co-enabled transitions 356 [2021-03-26 09:57:39,864 INFO L154 LiptonReduction]: Checked pairs total: 307 [2021-03-26 09:57:39,864 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:57:39,865 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 125 [2021-03-26 09:57:39,865 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 107 flow [2021-03-26 09:57:39,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 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-26 09:57:39,866 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:39,866 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:39,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 09:57:39,866 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:39,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:39,867 INFO L82 PathProgramCache]: Analyzing trace with hash 136724570, now seen corresponding path program 1 times [2021-03-26 09:57:39,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:39,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576808783] [2021-03-26 09:57:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:39,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:39,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:39,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:39,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:39,920 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 09:57:39,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 09:57:39,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:39,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:39,928 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-26 09:57:39,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576808783] [2021-03-26 09:57:39,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:39,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:57:39,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313885073] [2021-03-26 09:57:39,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:57:39,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:39,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:57:39,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:57:39,930 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 209 [2021-03-26 09:57:39,931 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 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-26 09:57:39,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:39,932 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 209 [2021-03-26 09:57:39,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:40,007 INFO L129 PetriNetUnfolder]: 66/147 cut-off events. [2021-03-26 09:57:40,007 INFO L130 PetriNetUnfolder]: For 105/142 co-relation queries the response was YES. [2021-03-26 09:57:40,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 147 events. 66/147 cut-off events. For 105/142 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 557 event pairs, 14 based on Foata normal form. 23/166 useless extension candidates. Maximal degree in co-relation 502. Up to 108 conditions per place. [2021-03-26 09:57:40,013 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 6 selfloop transitions, 9 changer transitions 9/42 dead transitions. [2021-03-26 09:57:40,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 231 flow [2021-03-26 09:57:40,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:57:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:57:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1082 transitions. [2021-03-26 09:57:40,016 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8628389154704944 [2021-03-26 09:57:40,016 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1082 transitions. [2021-03-26 09:57:40,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1082 transitions. [2021-03-26 09:57:40,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:40,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1082 transitions. [2021-03-26 09:57:40,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.33333333333334) internal successors, (1082), 6 states have internal predecessors, (1082), 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-26 09:57:40,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-26 09:57:40,023 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-26 09:57:40,023 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 107 flow. Second operand 6 states and 1082 transitions. [2021-03-26 09:57:40,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 231 flow [2021-03-26 09:57:40,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 224 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 09:57:40,027 INFO L241 Difference]: Finished difference. Result has 46 places, 33 transitions, 172 flow [2021-03-26 09:57:40,027 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2021-03-26 09:57:40,027 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -12 predicate places. [2021-03-26 09:57:40,027 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:40,027 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 172 flow [2021-03-26 09:57:40,028 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 172 flow [2021-03-26 09:57:40,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 172 flow [2021-03-26 09:57:40,046 INFO L129 PetriNetUnfolder]: 49/115 cut-off events. [2021-03-26 09:57:40,047 INFO L130 PetriNetUnfolder]: For 182/213 co-relation queries the response was YES. [2021-03-26 09:57:40,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 115 events. 49/115 cut-off events. For 182/213 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 406 event pairs, 13 based on Foata normal form. 3/115 useless extension candidates. Maximal degree in co-relation 434. Up to 76 conditions per place. [2021-03-26 09:57:40,049 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 09:57:40,098 INFO L154 LiptonReduction]: Checked pairs total: 395 [2021-03-26 09:57:40,098 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:57:40,098 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-03-26 09:57:40,099 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 172 flow [2021-03-26 09:57:40,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 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-26 09:57:40,100 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:40,100 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:40,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 09:57:40,100 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1851099711, now seen corresponding path program 1 times [2021-03-26 09:57:40,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:40,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793648213] [2021-03-26 09:57:40,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:40,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:40,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:40,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:40,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:40,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:40,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:40,228 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 09:57:40,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 09:57:40,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:40,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:40,236 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-26 09:57:40,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793648213] [2021-03-26 09:57:40,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:40,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:57:40,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378913949] [2021-03-26 09:57:40,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 09:57:40,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:40,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 09:57:40,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 09:57:40,238 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 209 [2021-03-26 09:57:40,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 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-26 09:57:40,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:40,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 209 [2021-03-26 09:57:40,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:40,304 INFO L129 PetriNetUnfolder]: 36/95 cut-off events. [2021-03-26 09:57:40,304 INFO L130 PetriNetUnfolder]: For 208/289 co-relation queries the response was YES. [2021-03-26 09:57:40,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 95 events. 36/95 cut-off events. For 208/289 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 283 event pairs, 2 based on Foata normal form. 27/119 useless extension candidates. Maximal degree in co-relation 430. Up to 68 conditions per place. [2021-03-26 09:57:40,305 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 6 selfloop transitions, 13 changer transitions 9/46 dead transitions. [2021-03-26 09:57:40,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 354 flow [2021-03-26 09:57:40,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:57:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:57:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1262 transitions. [2021-03-26 09:57:40,309 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8626110731373889 [2021-03-26 09:57:40,309 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1262 transitions. [2021-03-26 09:57:40,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1262 transitions. [2021-03-26 09:57:40,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:40,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1262 transitions. [2021-03-26 09:57:40,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 180.28571428571428) internal successors, (1262), 7 states have internal predecessors, (1262), 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-26 09:57:40,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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-26 09:57:40,316 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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-26 09:57:40,316 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 172 flow. Second operand 7 states and 1262 transitions. [2021-03-26 09:57:40,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 354 flow [2021-03-26 09:57:40,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 292 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 09:57:40,319 INFO L241 Difference]: Finished difference. Result has 49 places, 37 transitions, 222 flow [2021-03-26 09:57:40,319 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2021-03-26 09:57:40,319 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2021-03-26 09:57:40,320 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:40,320 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 37 transitions, 222 flow [2021-03-26 09:57:40,320 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 37 transitions, 222 flow [2021-03-26 09:57:40,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 222 flow [2021-03-26 09:57:40,329 INFO L129 PetriNetUnfolder]: 25/73 cut-off events. [2021-03-26 09:57:40,329 INFO L130 PetriNetUnfolder]: For 172/195 co-relation queries the response was YES. [2021-03-26 09:57:40,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 73 events. 25/73 cut-off events. For 172/195 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 202 event pairs, 2 based on Foata normal form. 4/74 useless extension candidates. Maximal degree in co-relation 269. Up to 42 conditions per place. [2021-03-26 09:57:40,331 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 09:57:40,337 INFO L154 LiptonReduction]: Checked pairs total: 422 [2021-03-26 09:57:40,337 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:57:40,337 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-26 09:57:40,338 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 222 flow [2021-03-26 09:57:40,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 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-26 09:57:40,339 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:40,339 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] [2021-03-26 09:57:40,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 09:57:40,339 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:40,340 INFO L82 PathProgramCache]: Analyzing trace with hash 565894138, now seen corresponding path program 1 times [2021-03-26 09:57:40,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:40,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469699741] [2021-03-26 09:57:40,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:40,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:40,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:40,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:40,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:40,409 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 09:57:40,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 09:57:40,419 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-26 09:57:40,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469699741] [2021-03-26 09:57:40,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:40,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:57:40,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543419140] [2021-03-26 09:57:40,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:57:40,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:40,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:57:40,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:57:40,422 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 209 [2021-03-26 09:57:40,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 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-26 09:57:40,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:40,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 209 [2021-03-26 09:57:40,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:40,506 INFO L129 PetriNetUnfolder]: 149/367 cut-off events. [2021-03-26 09:57:40,506 INFO L130 PetriNetUnfolder]: For 730/799 co-relation queries the response was YES. [2021-03-26 09:57:40,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 367 events. 149/367 cut-off events. For 730/799 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1879 event pairs, 20 based on Foata normal form. 32/387 useless extension candidates. Maximal degree in co-relation 1227. Up to 168 conditions per place. [2021-03-26 09:57:40,510 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 10 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2021-03-26 09:57:40,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 295 flow [2021-03-26 09:57:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:57:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:57:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 887 transitions. [2021-03-26 09:57:40,513 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8488038277511962 [2021-03-26 09:57:40,513 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 887 transitions. [2021-03-26 09:57:40,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 887 transitions. [2021-03-26 09:57:40,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:40,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 887 transitions. [2021-03-26 09:57:40,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.4) internal successors, (887), 5 states have internal predecessors, (887), 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-26 09:57:40,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-26 09:57:40,518 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-26 09:57:40,518 INFO L185 Difference]: Start difference. First operand has 47 places, 37 transitions, 222 flow. Second operand 5 states and 887 transitions. [2021-03-26 09:57:40,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 295 flow [2021-03-26 09:57:40,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 241 flow, removed 18 selfloop flow, removed 5 redundant places. [2021-03-26 09:57:40,525 INFO L241 Difference]: Finished difference. Result has 49 places, 46 transitions, 245 flow [2021-03-26 09:57:40,525 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2021-03-26 09:57:40,525 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2021-03-26 09:57:40,525 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:40,525 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 46 transitions, 245 flow [2021-03-26 09:57:40,526 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 46 transitions, 245 flow [2021-03-26 09:57:40,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 46 transitions, 245 flow [2021-03-26 09:57:40,555 INFO L129 PetriNetUnfolder]: 130/324 cut-off events. [2021-03-26 09:57:40,555 INFO L130 PetriNetUnfolder]: For 427/492 co-relation queries the response was YES. [2021-03-26 09:57:40,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 324 events. 130/324 cut-off events. For 427/492 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1696 event pairs, 19 based on Foata normal form. 16/324 useless extension candidates. Maximal degree in co-relation 923. Up to 113 conditions per place. [2021-03-26 09:57:40,559 INFO L142 LiptonReduction]: Number of co-enabled transitions 558 [2021-03-26 09:57:40,574 INFO L154 LiptonReduction]: Checked pairs total: 254 [2021-03-26 09:57:40,574 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:57:40,574 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-03-26 09:57:40,580 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 245 flow [2021-03-26 09:57:40,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 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-26 09:57:40,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:40,581 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] [2021-03-26 09:57:40,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 09:57:40,581 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:40,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash -451057372, now seen corresponding path program 2 times [2021-03-26 09:57:40,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:40,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820970957] [2021-03-26 09:57:40,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:40,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:40,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:40,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:40,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:40,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:40,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:40,669 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-26 09:57:40,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820970957] [2021-03-26 09:57:40,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:40,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:57:40,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694108601] [2021-03-26 09:57:40,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:57:40,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:40,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:57:40,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:57:40,672 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 209 [2021-03-26 09:57:40,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 245 flow. Second operand has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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-26 09:57:40,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:40,672 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 209 [2021-03-26 09:57:40,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:40,729 INFO L129 PetriNetUnfolder]: 167/413 cut-off events. [2021-03-26 09:57:40,729 INFO L130 PetriNetUnfolder]: For 644/723 co-relation queries the response was YES. [2021-03-26 09:57:40,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 413 events. 167/413 cut-off events. For 644/723 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2230 event pairs, 22 based on Foata normal form. 35/428 useless extension candidates. Maximal degree in co-relation 1205. Up to 156 conditions per place. [2021-03-26 09:57:40,732 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 4 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2021-03-26 09:57:40,733 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 265 flow [2021-03-26 09:57:40,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:57:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:57:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 743 transitions. [2021-03-26 09:57:40,735 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.888755980861244 [2021-03-26 09:57:40,735 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 743 transitions. [2021-03-26 09:57:40,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 743 transitions. [2021-03-26 09:57:40,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:40,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 743 transitions. [2021-03-26 09:57:40,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 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-26 09:57:40,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-26 09:57:40,739 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-26 09:57:40,739 INFO L185 Difference]: Start difference. First operand has 49 places, 46 transitions, 245 flow. Second operand 4 states and 743 transitions. [2021-03-26 09:57:40,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 265 flow [2021-03-26 09:57:40,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 09:57:40,745 INFO L241 Difference]: Finished difference. Result has 53 places, 46 transitions, 254 flow [2021-03-26 09:57:40,745 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2021-03-26 09:57:40,746 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2021-03-26 09:57:40,746 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:40,746 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 254 flow [2021-03-26 09:57:40,746 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 254 flow [2021-03-26 09:57:40,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 254 flow [2021-03-26 09:57:40,784 INFO L129 PetriNetUnfolder]: 161/390 cut-off events. [2021-03-26 09:57:40,784 INFO L130 PetriNetUnfolder]: For 605/682 co-relation queries the response was YES. [2021-03-26 09:57:40,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 390 events. 161/390 cut-off events. For 605/682 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2182 event pairs, 23 based on Foata normal form. 19/389 useless extension candidates. Maximal degree in co-relation 1156. Up to 147 conditions per place. [2021-03-26 09:57:40,789 INFO L142 LiptonReduction]: Number of co-enabled transitions 558 [2021-03-26 09:57:40,813 INFO L154 LiptonReduction]: Checked pairs total: 247 [2021-03-26 09:57:40,813 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:57:40,813 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 67 [2021-03-26 09:57:40,813 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 254 flow [2021-03-26 09:57:40,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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-26 09:57:40,814 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:40,814 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] [2021-03-26 09:57:40,814 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 09:57:40,814 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:40,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:40,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1793460154, now seen corresponding path program 3 times [2021-03-26 09:57:40,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:40,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162122274] [2021-03-26 09:57:40,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:40,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:40,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:40,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:40,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:40,884 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 09:57:40,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 09:57:40,893 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-26 09:57:40,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162122274] [2021-03-26 09:57:40,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:40,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:57:40,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491402342] [2021-03-26 09:57:40,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:57:40,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:40,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:57:40,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:57:40,895 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 209 [2021-03-26 09:57:40,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 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-26 09:57:40,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:40,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 209 [2021-03-26 09:57:40,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:40,995 INFO L129 PetriNetUnfolder]: 290/693 cut-off events. [2021-03-26 09:57:40,995 INFO L130 PetriNetUnfolder]: For 1256/1498 co-relation queries the response was YES. [2021-03-26 09:57:40,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2199 conditions, 693 events. 290/693 cut-off events. For 1256/1498 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4312 event pairs, 17 based on Foata normal form. 64/731 useless extension candidates. Maximal degree in co-relation 2179. Up to 255 conditions per place. [2021-03-26 09:57:41,001 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 17 selfloop transitions, 20 changer transitions 0/67 dead transitions. [2021-03-26 09:57:41,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 67 transitions, 456 flow [2021-03-26 09:57:41,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:57:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:57:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 868 transitions. [2021-03-26 09:57:41,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.830622009569378 [2021-03-26 09:57:41,003 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 868 transitions. [2021-03-26 09:57:41,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 868 transitions. [2021-03-26 09:57:41,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:41,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 868 transitions. [2021-03-26 09:57:41,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.6) internal successors, (868), 5 states have internal predecessors, (868), 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-26 09:57:41,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-26 09:57:41,007 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-26 09:57:41,007 INFO L185 Difference]: Start difference. First operand has 53 places, 46 transitions, 254 flow. Second operand 5 states and 868 transitions. [2021-03-26 09:57:41,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 67 transitions, 456 flow [2021-03-26 09:57:41,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 09:57:41,014 INFO L241 Difference]: Finished difference. Result has 59 places, 60 transitions, 429 flow [2021-03-26 09:57:41,014 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=429, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2021-03-26 09:57:41,014 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2021-03-26 09:57:41,014 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:41,014 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 60 transitions, 429 flow [2021-03-26 09:57:41,016 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 60 transitions, 429 flow [2021-03-26 09:57:41,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 60 transitions, 429 flow [2021-03-26 09:57:41,072 INFO L129 PetriNetUnfolder]: 267/659 cut-off events. [2021-03-26 09:57:41,073 INFO L130 PetriNetUnfolder]: For 1243/1424 co-relation queries the response was YES. [2021-03-26 09:57:41,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2155 conditions, 659 events. 267/659 cut-off events. For 1243/1424 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4323 event pairs, 15 based on Foata normal form. 42/670 useless extension candidates. Maximal degree in co-relation 2133. Up to 256 conditions per place. [2021-03-26 09:57:41,082 INFO L142 LiptonReduction]: Number of co-enabled transitions 730 [2021-03-26 09:57:41,158 INFO L154 LiptonReduction]: Checked pairs total: 363 [2021-03-26 09:57:41,159 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:57:41,159 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 145 [2021-03-26 09:57:41,159 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 429 flow [2021-03-26 09:57:41,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 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-26 09:57:41,160 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:41,160 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] [2021-03-26 09:57:41,160 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 09:57:41,160 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1060996994, now seen corresponding path program 4 times [2021-03-26 09:57:41,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:41,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272871847] [2021-03-26 09:57:41,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:41,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:41,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:41,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:41,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:41,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:41,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:41,212 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-26 09:57:41,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272871847] [2021-03-26 09:57:41,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:41,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:57:41,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421615867] [2021-03-26 09:57:41,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:57:41,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:41,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:57:41,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:57:41,214 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 209 [2021-03-26 09:57:41,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 429 flow. Second operand has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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-26 09:57:41,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:41,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 209 [2021-03-26 09:57:41,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:41,340 INFO L129 PetriNetUnfolder]: 354/831 cut-off events. [2021-03-26 09:57:41,341 INFO L130 PetriNetUnfolder]: For 1829/2152 co-relation queries the response was YES. [2021-03-26 09:57:41,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 831 events. 354/831 cut-off events. For 1829/2152 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5523 event pairs, 32 based on Foata normal form. 72/852 useless extension candidates. Maximal degree in co-relation 2748. Up to 352 conditions per place. [2021-03-26 09:57:41,347 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 6 selfloop transitions, 4 changer transitions 4/62 dead transitions. [2021-03-26 09:57:41,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 471 flow [2021-03-26 09:57:41,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:57:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:57:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 727 transitions. [2021-03-26 09:57:41,349 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8696172248803827 [2021-03-26 09:57:41,349 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 727 transitions. [2021-03-26 09:57:41,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 727 transitions. [2021-03-26 09:57:41,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:41,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 727 transitions. [2021-03-26 09:57:41,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 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-26 09:57:41,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-26 09:57:41,353 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-26 09:57:41,353 INFO L185 Difference]: Start difference. First operand has 59 places, 60 transitions, 429 flow. Second operand 4 states and 727 transitions. [2021-03-26 09:57:41,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 471 flow [2021-03-26 09:57:41,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 62 transitions, 471 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 09:57:41,360 INFO L241 Difference]: Finished difference. Result has 64 places, 57 transitions, 413 flow [2021-03-26 09:57:41,360 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=413, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2021-03-26 09:57:41,360 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2021-03-26 09:57:41,360 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:41,360 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 57 transitions, 413 flow [2021-03-26 09:57:41,361 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 57 transitions, 413 flow [2021-03-26 09:57:41,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 57 transitions, 413 flow [2021-03-26 09:57:41,443 INFO L129 PetriNetUnfolder]: 342/818 cut-off events. [2021-03-26 09:57:41,443 INFO L130 PetriNetUnfolder]: For 1735/1893 co-relation queries the response was YES. [2021-03-26 09:57:41,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2712 conditions, 818 events. 342/818 cut-off events. For 1735/1893 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5777 event pairs, 32 based on Foata normal form. 52/827 useless extension candidates. Maximal degree in co-relation 2687. Up to 355 conditions per place. [2021-03-26 09:57:41,455 INFO L142 LiptonReduction]: Number of co-enabled transitions 656 [2021-03-26 09:57:41,715 INFO L154 LiptonReduction]: Checked pairs total: 800 [2021-03-26 09:57:41,716 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:57:41,716 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 356 [2021-03-26 09:57:41,716 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 416 flow [2021-03-26 09:57:41,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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-26 09:57:41,717 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:41,717 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] [2021-03-26 09:57:41,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 09:57:41,717 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash -780684334, now seen corresponding path program 5 times [2021-03-26 09:57:41,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:41,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576112393] [2021-03-26 09:57:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:41,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:41,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:41,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:41,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:41,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:41,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:41,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:41,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:41,806 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 09:57:41,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 09:57:41,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:41,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:41,815 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-26 09:57:41,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576112393] [2021-03-26 09:57:41,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:41,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 09:57:41,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847670090] [2021-03-26 09:57:41,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 09:57:41,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:41,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 09:57:41,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 09:57:41,817 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 210 [2021-03-26 09:57:41,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 416 flow. Second operand has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 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-26 09:57:41,819 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:41,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 210 [2021-03-26 09:57:41,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:41,971 INFO L129 PetriNetUnfolder]: 298/719 cut-off events. [2021-03-26 09:57:41,971 INFO L130 PetriNetUnfolder]: For 2038/2736 co-relation queries the response was YES. [2021-03-26 09:57:41,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 719 events. 298/719 cut-off events. For 2038/2736 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4730 event pairs, 12 based on Foata normal form. 330/1004 useless extension candidates. Maximal degree in co-relation 2875. Up to 320 conditions per place. [2021-03-26 09:57:41,977 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 2 selfloop transitions, 18 changer transitions 17/62 dead transitions. [2021-03-26 09:57:41,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 62 transitions, 512 flow [2021-03-26 09:57:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 09:57:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 09:57:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1442 transitions. [2021-03-26 09:57:41,980 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8583333333333333 [2021-03-26 09:57:41,981 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1442 transitions. [2021-03-26 09:57:41,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1442 transitions. [2021-03-26 09:57:41,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:41,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1442 transitions. [2021-03-26 09:57:41,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 180.25) internal successors, (1442), 8 states have internal predecessors, (1442), 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-26 09:57:41,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 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-26 09:57:41,988 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 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-26 09:57:41,988 INFO L185 Difference]: Start difference. First operand has 64 places, 57 transitions, 416 flow. Second operand 8 states and 1442 transitions. [2021-03-26 09:57:41,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 62 transitions, 512 flow [2021-03-26 09:57:41,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 484 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-03-26 09:57:41,996 INFO L241 Difference]: Finished difference. Result has 72 places, 45 transitions, 327 flow [2021-03-26 09:57:41,997 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=72, PETRI_TRANSITIONS=45} [2021-03-26 09:57:41,997 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2021-03-26 09:57:41,997 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:41,998 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 45 transitions, 327 flow [2021-03-26 09:57:41,998 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 45 transitions, 327 flow [2021-03-26 09:57:41,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 45 transitions, 327 flow [2021-03-26 09:57:42,028 INFO L129 PetriNetUnfolder]: 108/302 cut-off events. [2021-03-26 09:57:42,028 INFO L130 PetriNetUnfolder]: For 695/742 co-relation queries the response was YES. [2021-03-26 09:57:42,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 302 events. 108/302 cut-off events. For 695/742 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1730 event pairs, 6 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 1172. Up to 124 conditions per place. [2021-03-26 09:57:42,033 INFO L142 LiptonReduction]: Number of co-enabled transitions 372 [2021-03-26 09:57:42,393 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-03-26 09:57:42,529 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-03-26 09:57:42,876 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-26 09:57:43,034 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-26 09:57:43,041 INFO L154 LiptonReduction]: Checked pairs total: 430 [2021-03-26 09:57:43,041 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 09:57:43,041 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1044 [2021-03-26 09:57:43,041 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 315 flow [2021-03-26 09:57:43,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 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-26 09:57:43,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:43,042 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-26 09:57:43,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 09:57:43,042 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:43,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash -80408501, now seen corresponding path program 1 times [2021-03-26 09:57:43,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:43,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691139314] [2021-03-26 09:57:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:43,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:43,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:43,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:43,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:43,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:43,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:43,087 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-26 09:57:43,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691139314] [2021-03-26 09:57:43,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:43,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:57:43,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169016384] [2021-03-26 09:57:43,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:57:43,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:43,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:57:43,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:57:43,089 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 213 [2021-03-26 09:57:43,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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-26 09:57:43,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:43,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 213 [2021-03-26 09:57:43,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:43,150 INFO L129 PetriNetUnfolder]: 169/412 cut-off events. [2021-03-26 09:57:43,150 INFO L130 PetriNetUnfolder]: For 1279/1378 co-relation queries the response was YES. [2021-03-26 09:57:43,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 412 events. 169/412 cut-off events. For 1279/1378 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2545 event pairs, 11 based on Foata normal form. 17/396 useless extension candidates. Maximal degree in co-relation 1589. Up to 162 conditions per place. [2021-03-26 09:57:43,153 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 3 selfloop transitions, 1 changer transitions 7/42 dead transitions. [2021-03-26 09:57:43,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 42 transitions, 331 flow [2021-03-26 09:57:43,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:57:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:57:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 726 transitions. [2021-03-26 09:57:43,155 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.852112676056338 [2021-03-26 09:57:43,155 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 726 transitions. [2021-03-26 09:57:43,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 726 transitions. [2021-03-26 09:57:43,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:43,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 726 transitions. [2021-03-26 09:57:43,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.5) internal successors, (726), 4 states have internal predecessors, (726), 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-26 09:57:43,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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-26 09:57:43,159 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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-26 09:57:43,159 INFO L185 Difference]: Start difference. First operand has 66 places, 42 transitions, 315 flow. Second operand 4 states and 726 transitions. [2021-03-26 09:57:43,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 42 transitions, 331 flow [2021-03-26 09:57:43,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 42 transitions, 264 flow, removed 17 selfloop flow, removed 10 redundant places. [2021-03-26 09:57:43,166 INFO L241 Difference]: Finished difference. Result has 60 places, 35 transitions, 190 flow [2021-03-26 09:57:43,167 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=60, PETRI_TRANSITIONS=35} [2021-03-26 09:57:43,167 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2021-03-26 09:57:43,167 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:43,167 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 35 transitions, 190 flow [2021-03-26 09:57:43,167 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 35 transitions, 190 flow [2021-03-26 09:57:43,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 35 transitions, 190 flow [2021-03-26 09:57:43,176 INFO L129 PetriNetUnfolder]: 30/88 cut-off events. [2021-03-26 09:57:43,177 INFO L130 PetriNetUnfolder]: For 252/287 co-relation queries the response was YES. [2021-03-26 09:57:43,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 88 events. 30/88 cut-off events. For 252/287 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 280 event pairs, 3 based on Foata normal form. 9/92 useless extension candidates. Maximal degree in co-relation 258. Up to 26 conditions per place. [2021-03-26 09:57:43,178 INFO L142 LiptonReduction]: Number of co-enabled transitions 222 [2021-03-26 09:57:43,918 WARN L205 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-26 09:57:44,204 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-26 09:57:45,473 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-26 09:57:46,052 WARN L205 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 09:57:46,317 INFO L154 LiptonReduction]: Checked pairs total: 235 [2021-03-26 09:57:46,317 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 09:57:46,317 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3150 [2021-03-26 09:57:46,318 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 184 flow [2021-03-26 09:57:46,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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-26 09:57:46,318 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:46,318 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-26 09:57:46,318 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 09:57:46,319 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:46,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:46,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1078271109, now seen corresponding path program 1 times [2021-03-26 09:57:46,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:46,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381339804] [2021-03-26 09:57:46,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:46,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:46,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 09:57:46,393 INFO L142 QuantifierPusher]: treesize reduction 4, result has 82.6 percent of original size [2021-03-26 09:57:46,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 09:57:46,409 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-03-26 09:57:46,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 09:57:46,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:46,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 09:57:46,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:46,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:46,439 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-26 09:57:46,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381339804] [2021-03-26 09:57:46,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:46,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:57:46,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136485665] [2021-03-26 09:57:46,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 09:57:46,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:46,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 09:57:46,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 09:57:46,442 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 216 [2021-03-26 09:57:46,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 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-26 09:57:46,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:46,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 216 [2021-03-26 09:57:46,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:46,571 INFO L129 PetriNetUnfolder]: 121/275 cut-off events. [2021-03-26 09:57:46,571 INFO L130 PetriNetUnfolder]: For 1141/1212 co-relation queries the response was YES. [2021-03-26 09:57:46,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 275 events. 121/275 cut-off events. For 1141/1212 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1398 event pairs, 7 based on Foata normal form. 27/277 useless extension candidates. Maximal degree in co-relation 876. Up to 101 conditions per place. [2021-03-26 09:57:46,573 INFO L132 encePairwiseOnDemand]: 210/216 looper letters, 4 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2021-03-26 09:57:46,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 37 transitions, 252 flow [2021-03-26 09:57:46,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:57:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:57:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1119 transitions. [2021-03-26 09:57:46,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7400793650793651 [2021-03-26 09:57:46,577 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1119 transitions. [2021-03-26 09:57:46,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1119 transitions. [2021-03-26 09:57:46,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:46,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1119 transitions. [2021-03-26 09:57:46,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.85714285714286) internal successors, (1119), 7 states have internal predecessors, (1119), 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-26 09:57:46,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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-26 09:57:46,583 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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-26 09:57:46,583 INFO L185 Difference]: Start difference. First operand has 54 places, 32 transitions, 184 flow. Second operand 7 states and 1119 transitions. [2021-03-26 09:57:46,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 37 transitions, 252 flow [2021-03-26 09:57:46,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 37 transitions, 227 flow, removed 10 selfloop flow, removed 6 redundant places. [2021-03-26 09:57:46,587 INFO L241 Difference]: Finished difference. Result has 57 places, 36 transitions, 226 flow [2021-03-26 09:57:46,587 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2021-03-26 09:57:46,587 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2021-03-26 09:57:46,587 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:46,588 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 36 transitions, 226 flow [2021-03-26 09:57:46,588 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 36 transitions, 226 flow [2021-03-26 09:57:46,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 36 transitions, 226 flow [2021-03-26 09:57:46,614 INFO L129 PetriNetUnfolder]: 118/267 cut-off events. [2021-03-26 09:57:46,614 INFO L130 PetriNetUnfolder]: For 586/635 co-relation queries the response was YES. [2021-03-26 09:57:46,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 267 events. 118/267 cut-off events. For 586/635 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1348 event pairs, 7 based on Foata normal form. 15/258 useless extension candidates. Maximal degree in co-relation 835. Up to 99 conditions per place. [2021-03-26 09:57:46,618 INFO L142 LiptonReduction]: Number of co-enabled transitions 204 [2021-03-26 09:57:46,621 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 09:57:46,621 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:57:46,622 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-26 09:57:46,622 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 226 flow [2021-03-26 09:57:46,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 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-26 09:57:46,623 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:46,623 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] [2021-03-26 09:57:46,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 09:57:46,624 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:46,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1403575222, now seen corresponding path program 1 times [2021-03-26 09:57:46,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:46,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656069469] [2021-03-26 09:57:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:57:46,688 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:57:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:57:46,721 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:57:46,756 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 09:57:46,756 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 09:57:46,756 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 09:57:46,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 09:57:46 BasicIcfg [2021-03-26 09:57:46,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 09:57:46,867 INFO L168 Benchmark]: Toolchain (without parser) took 17299.10 ms. Allocated memory was 255.9 MB in the beginning and 675.3 MB in the end (delta: 419.4 MB). Free memory was 234.6 MB in the beginning and 515.4 MB in the end (delta: -280.8 MB). Peak memory consumption was 138.4 MB. Max. memory is 16.0 GB. [2021-03-26 09:57:46,867 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 157.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 09:57:46,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.68 ms. Allocated memory was 255.9 MB in the beginning and 383.8 MB in the end (delta: 127.9 MB). Free memory was 234.0 MB in the beginning and 342.8 MB in the end (delta: -108.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 09:57:46,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.44 ms. Allocated memory is still 383.8 MB. Free memory was 342.8 MB in the beginning and 340.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:57:46,868 INFO L168 Benchmark]: Boogie Preprocessor took 55.13 ms. Allocated memory is still 383.8 MB. Free memory was 340.0 MB in the beginning and 337.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:57:46,868 INFO L168 Benchmark]: RCFGBuilder took 1829.32 ms. Allocated memory is still 383.8 MB. Free memory was 337.9 MB in the beginning and 260.1 MB in the end (delta: 77.9 MB). Peak memory consumption was 81.0 MB. Max. memory is 16.0 GB. [2021-03-26 09:57:46,869 INFO L168 Benchmark]: TraceAbstraction took 14808.68 ms. Allocated memory was 383.8 MB in the beginning and 675.3 MB in the end (delta: 291.5 MB). Free memory was 260.1 MB in the beginning and 515.4 MB in the end (delta: -255.3 MB). Peak memory consumption was 36.2 MB. Max. memory is 16.0 GB. [2021-03-26 09:57:46,875 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.45 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 157.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 525.68 ms. Allocated memory was 255.9 MB in the beginning and 383.8 MB in the end (delta: 127.9 MB). Free memory was 234.0 MB in the beginning and 342.8 MB in the end (delta: -108.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 75.44 ms. Allocated memory is still 383.8 MB. Free memory was 342.8 MB in the beginning and 340.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 55.13 ms. Allocated memory is still 383.8 MB. Free memory was 340.0 MB in the beginning and 337.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1829.32 ms. Allocated memory is still 383.8 MB. Free memory was 337.9 MB in the beginning and 260.1 MB in the end (delta: 77.9 MB). Peak memory consumption was 81.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14808.68 ms. Allocated memory was 383.8 MB in the beginning and 675.3 MB in the end (delta: 291.5 MB). Free memory was 260.1 MB in the beginning and 515.4 MB in the end (delta: -255.3 MB). Peak memory consumption was 36.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3272.7ms, 124 PlacesBefore, 58 PlacesAfterwards, 113 TransitionsBefore, 46 TransitionsAfterwards, 2512 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4168 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2249, positive: 2156, positive conditional: 2156, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2249, positive: 2156, positive conditional: 0, positive unconditional: 2156, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2249, positive: 2156, positive conditional: 0, positive unconditional: 2156, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1683, positive: 1644, positive conditional: 0, positive unconditional: 1644, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1683, positive: 1623, positive conditional: 0, positive unconditional: 1623, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 420, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 353, negative conditional: 0, negative unconditional: 353, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2249, positive: 512, positive conditional: 0, positive unconditional: 512, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 1683, unknown conditional: 0, unknown unconditional: 1683] , Statistics on independence cache: Total cache size (in pairs): 1683, Positive cache size: 1644, Positive conditional cache size: 0, Positive unconditional cache size: 1644, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1924.9ms, 54 PlacesBefore, 40 PlacesAfterwards, 43 TransitionsBefore, 29 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 2080 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 791, positive: 680, positive conditional: 680, positive unconditional: 0, negative: 111, negative conditional: 111, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 791, positive: 680, positive conditional: 40, positive unconditional: 640, negative: 111, negative conditional: 4, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 791, positive: 680, positive conditional: 40, positive unconditional: 640, negative: 111, negative conditional: 4, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 222, positive: 194, positive conditional: 10, positive unconditional: 184, negative: 28, negative conditional: 2, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 222, positive: 182, positive conditional: 0, positive unconditional: 182, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 28, negative conditional: 2, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 526, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 476, negative conditional: 58, negative unconditional: 419, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 791, positive: 486, positive conditional: 30, positive unconditional: 456, negative: 83, negative conditional: 2, negative unconditional: 81, unknown: 222, unknown conditional: 12, unknown unconditional: 210] , Statistics on independence cache: Total cache size (in pairs): 1905, Positive cache size: 1838, Positive conditional cache size: 10, Positive unconditional cache size: 1828, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1425.3ms, 43 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1088 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 510, positive: 443, positive conditional: 443, positive unconditional: 0, negative: 67, negative conditional: 67, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 510, positive: 443, positive conditional: 0, positive unconditional: 443, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 510, positive: 443, positive conditional: 0, positive unconditional: 443, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 510, positive: 430, positive conditional: 0, positive unconditional: 430, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 1919, Positive cache size: 1851, Positive conditional cache size: 10, Positive unconditional cache size: 1841, Negative cache size: 68, Negative conditional cache size: 2, Negative unconditional cache size: 66, Eliminated conditions: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 123.6ms, 42 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 307 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, positive: 81, positive conditional: 81, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, positive: 81, positive conditional: 9, positive unconditional: 72, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 81, positive conditional: 9, positive unconditional: 72, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 1, positive unconditional: 4, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 104, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, positive: 76, positive conditional: 8, positive unconditional: 68, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 10, unknown conditional: 1, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1929, Positive cache size: 1856, Positive conditional cache size: 11, Positive unconditional cache size: 1845, Negative cache size: 73, Negative conditional cache size: 2, Negative unconditional cache size: 71, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 70.7ms, 46 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 395 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, positive: 103, positive conditional: 103, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121, positive: 103, positive conditional: 22, positive unconditional: 81, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 103, positive conditional: 22, positive unconditional: 81, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, positive: 98, positive conditional: 22, positive unconditional: 76, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1934, Positive cache size: 1861, Positive conditional cache size: 11, Positive unconditional cache size: 1850, Negative cache size: 73, Negative conditional cache size: 2, Negative unconditional cache size: 71, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.2ms, 49 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 422 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 136, positive: 117, positive conditional: 50, positive unconditional: 67, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 136, positive: 117, positive conditional: 50, positive unconditional: 67, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 136, positive: 108, positive conditional: 41, positive unconditional: 67, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1943, Positive cache size: 1870, Positive conditional cache size: 20, Positive unconditional cache size: 1850, Negative cache size: 73, Negative conditional cache size: 2, Negative unconditional cache size: 71, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 48.3ms, 49 PlacesBefore, 49 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 254 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, positive: 26, positive conditional: 12, positive unconditional: 14, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 26, positive conditional: 12, positive unconditional: 14, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, positive: 25, positive conditional: 12, positive unconditional: 13, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1944, Positive cache size: 1871, Positive conditional cache size: 20, Positive unconditional cache size: 1851, Negative cache size: 73, Negative conditional cache size: 2, Negative unconditional cache size: 71, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.7ms, 53 PlacesBefore, 53 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 247 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, positive: 28, positive conditional: 11, positive unconditional: 17, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 28, positive conditional: 11, positive unconditional: 17, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 28, positive conditional: 11, positive unconditional: 17, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1944, Positive cache size: 1871, Positive conditional cache size: 20, Positive unconditional cache size: 1851, Negative cache size: 73, Negative conditional cache size: 2, Negative unconditional cache size: 71, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 142.9ms, 59 PlacesBefore, 59 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 363 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1944, Positive cache size: 1871, Positive conditional cache size: 20, Positive unconditional cache size: 1851, Negative cache size: 73, Negative conditional cache size: 2, Negative unconditional cache size: 71, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 354.4ms, 64 PlacesBefore, 64 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 800 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, positive: 25, positive conditional: 14, positive unconditional: 11, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 25, positive conditional: 14, positive unconditional: 11, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, positive: 21, positive conditional: 10, positive unconditional: 11, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1948, Positive cache size: 1875, Positive conditional cache size: 24, Positive unconditional cache size: 1851, Negative cache size: 73, Negative conditional cache size: 2, Negative unconditional cache size: 71, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1043.0ms, 72 PlacesBefore, 66 PlacesAfterwards, 45 TransitionsBefore, 42 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 430 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, positive: 50, positive conditional: 18, positive unconditional: 32, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 50, positive conditional: 18, positive unconditional: 32, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 6, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 35, positive conditional: 12, positive unconditional: 23, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 15, unknown conditional: 6, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1963, Positive cache size: 1890, Positive conditional cache size: 30, Positive unconditional cache size: 1860, Negative cache size: 73, Negative conditional cache size: 2, Negative unconditional cache size: 71, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3149.9ms, 60 PlacesBefore, 54 PlacesAfterwards, 35 TransitionsBefore, 32 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 235 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, positive: 140, positive conditional: 140, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, positive: 140, positive conditional: 86, positive unconditional: 54, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, positive: 140, positive conditional: 86, positive unconditional: 54, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, positive: 36, positive conditional: 21, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 102, negative conditional: 0, negative unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, positive: 104, positive conditional: 65, positive unconditional: 39, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 39, unknown conditional: 21, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 2002, Positive cache size: 1926, Positive conditional cache size: 51, Positive unconditional cache size: 1875, Negative cache size: 76, Negative conditional cache size: 2, Negative unconditional cache size: 74, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.7ms, 57 PlacesBefore, 57 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2002, Positive cache size: 1926, Positive conditional cache size: 51, Positive unconditional cache size: 1875, Negative cache size: 76, Negative conditional cache size: 2, Negative unconditional cache size: 74, Eliminated conditions: 0 - 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; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t453; [L859] FCALL, FORK 0 pthread_create(&t453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t454; [L861] FCALL, FORK 0 pthread_create(&t454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t455; [L863] FCALL, FORK 0 pthread_create(&t455, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] 0 pthread_t t456; [L865] FCALL, FORK 0 pthread_create(&t456, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 4 z = 1 [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 a = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L836] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [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 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L871] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L871] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 14559.7ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1333.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3350.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 63 SDtfs, 36 SDslu, 37 SDs, 0 SdLazy, 275 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 246.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 233.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=8, InterpolantAutomatonStates: 63, 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: 45.3ms SsaConstructionTime, 416.6ms SatisfiabilityAnalysisTime, 720.1ms InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 953 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...