/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/mix029_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:03:33,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:03:33,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:03:33,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:03:33,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:03:33,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:03:33,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:03:33,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:03:33,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:03:33,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:03:33,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:03:33,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:03:33,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:03:33,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:03:33,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:03:33,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:03:33,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:03:33,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:03:33,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:03:33,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:03:33,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:03:33,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:03:33,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:03:33,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:03:33,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:03:33,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:03:33,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:03:33,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:03:33,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:03:33,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:03:33,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:03:33,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:03:33,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:03:33,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:03:33,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:03:33,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:03:33,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:03:33,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:03:33,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:03:33,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:03:33,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:03:33,417 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 10:03:33,454 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:03:33,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:03:33,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:03:33,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:03:33,458 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:03:33,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:03:33,458 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:03:33,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:03:33,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:03:33,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:03:33,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:03:33,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:03:33,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:03:33,460 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:03:33,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:03:33,460 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:03:33,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:03:33,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:03:33,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:03:33,461 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:03:33,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:03:33,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:03:33,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:03:33,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:03:33,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:03:33,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:03:33,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:03:33,462 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:03:33,462 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:03:33,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:03:33,463 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 10:03:33,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:03:33,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:03:33,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:03:33,750 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:03:33,755 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:03:33,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_tso.opt.i [2021-03-26 10:03:33,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936816f29/67236325423b4ef08361512697f8d894/FLAG01d1017f3 [2021-03-26 10:03:34,325 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:03:34,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_tso.opt.i [2021-03-26 10:03:34,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936816f29/67236325423b4ef08361512697f8d894/FLAG01d1017f3 [2021-03-26 10:03:34,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936816f29/67236325423b4ef08361512697f8d894 [2021-03-26 10:03:34,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:03:34,647 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:03:34,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:03:34,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:03:34,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:03:34,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:03:34" (1/1) ... [2021-03-26 10:03:34,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0ddd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:34, skipping insertion in model container [2021-03-26 10:03:34,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:03:34" (1/1) ... [2021-03-26 10:03:34,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:03:34,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:03:34,837 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/mix029_tso.opt.i[948,961] [2021-03-26 10:03:35,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:03:35,026 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:03:35,035 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/mix029_tso.opt.i[948,961] [2021-03-26 10:03:35,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:03:35,159 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:03:35,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:35 WrapperNode [2021-03-26 10:03:35,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:03:35,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:03:35,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:03:35,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:03:35,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:35" (1/1) ... [2021-03-26 10:03:35,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:35" (1/1) ... [2021-03-26 10:03:35,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:03:35,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:03:35,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:03:35,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:03:35,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:35" (1/1) ... [2021-03-26 10:03:35,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:35" (1/1) ... [2021-03-26 10:03:35,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:35" (1/1) ... [2021-03-26 10:03:35,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:35" (1/1) ... [2021-03-26 10:03:35,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:35" (1/1) ... [2021-03-26 10:03:35,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:35" (1/1) ... [2021-03-26 10:03:35,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:35" (1/1) ... [2021-03-26 10:03:35,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:03:35,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:03:35,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:03:35,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:03:35,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:03:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:03:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:03:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:03:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:03:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:03:35,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:03:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:03:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:03:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:03:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:03:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:03:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:03:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:03:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:03:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:03:35,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:03:35,346 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 10:03:37,251 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:03:37,251 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:03:37,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:03:37 BoogieIcfgContainer [2021-03-26 10:03:37,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:03:37,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:03:37,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:03:37,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:03:37,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:03:34" (1/3) ... [2021-03-26 10:03:37,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd34500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:03:37, skipping insertion in model container [2021-03-26 10:03:37,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:03:35" (2/3) ... [2021-03-26 10:03:37,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd34500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:03:37, skipping insertion in model container [2021-03-26 10:03:37,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:03:37" (3/3) ... [2021-03-26 10:03:37,259 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_tso.opt.i [2021-03-26 10:03:37,265 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:03:37,269 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:03:37,269 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:03:37,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,315 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,315 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,316 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,316 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,316 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,316 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,317 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,317 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,329 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,330 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,330 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,330 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,335 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,335 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,335 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,335 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,365 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,365 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,373 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:37,384 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:03:37,400 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:03:37,428 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:03:37,429 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:03:37,429 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:03:37,429 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:03:37,429 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:03:37,429 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:03:37,429 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:03:37,429 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:03:37,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 10:03:37,486 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 10:03:37,487 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:37,491 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 3. Compared 88 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-26 10:03:37,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 10:03:37,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-26 10:03:37,502 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:37,513 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 10:03:37,515 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 10:03:37,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-26 10:03:37,536 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 10:03:37,537 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:37,537 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 3. Compared 90 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-26 10:03:37,540 INFO L142 LiptonReduction]: Number of co-enabled transitions 2774 [2021-03-26 10:03:38,991 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:03:39,380 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:03:41,239 INFO L154 LiptonReduction]: Checked pairs total: 5523 [2021-03-26 10:03:41,239 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-26 10:03:41,241 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3740 [2021-03-26 10:03:41,257 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-26 10:03:41,257 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:41,257 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:41,258 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:41,258 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:03:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash 394833245, now seen corresponding path program 1 times [2021-03-26 10:03:41,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:41,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655468995] [2021-03-26 10:03:41,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:41,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:41,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:41,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:41,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:41,523 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 10:03:41,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655468995] [2021-03-26 10:03:41,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:41,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:03:41,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049844990] [2021-03-26 10:03:41,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:03:41,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:41,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:03:41,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:03:41,545 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 193 [2021-03-26 10:03:41,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:41,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:41,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 193 [2021-03-26 10:03:41,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:41,692 INFO L129 PetriNetUnfolder]: 133/294 cut-off events. [2021-03-26 10:03:41,692 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:41,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 294 events. 133/294 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1384 event pairs, 110 based on Foata normal form. 32/308 useless extension candidates. Maximal degree in co-relation 493. Up to 153 conditions per place. [2021-03-26 10:03:41,697 INFO L132 encePairwiseOnDemand]: 189/193 looper letters, 11 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2021-03-26 10:03:41,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 132 flow [2021-03-26 10:03:41,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:03:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:03:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2021-03-26 10:03:41,717 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918825561312608 [2021-03-26 10:03:41,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2021-03-26 10:03:41,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2021-03-26 10:03:41,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:41,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2021-03-26 10:03:41,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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 10:03:41,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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 10:03:41,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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 10:03:41,742 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 532 transitions. [2021-03-26 10:03:41,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 132 flow [2021-03-26 10:03:41,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:03:41,746 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 96 flow [2021-03-26 10:03:41,748 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2021-03-26 10:03:41,749 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 10:03:41,749 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:41,749 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 42 transitions, 96 flow [2021-03-26 10:03:41,750 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 96 flow [2021-03-26 10:03:41,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 96 flow [2021-03-26 10:03:41,756 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-03-26 10:03:41,756 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:41,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:03:41,759 INFO L142 LiptonReduction]: Number of co-enabled transitions 584 [2021-03-26 10:03:42,177 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:03:42,300 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:03:43,315 INFO L154 LiptonReduction]: Checked pairs total: 2511 [2021-03-26 10:03:43,316 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 10:03:43,316 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1567 [2021-03-26 10:03:43,317 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-26 10:03:43,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:43,318 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:43,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] [2021-03-26 10:03:43,318 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:03:43,318 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:03:43,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:43,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1383342310, now seen corresponding path program 1 times [2021-03-26 10:03:43,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:43,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633483710] [2021-03-26 10:03:43,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:43,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:43,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:43,435 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:03:43,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:03:43,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 10:03:43,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633483710] [2021-03-26 10:03:43,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:43,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:03:43,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583812345] [2021-03-26 10:03:43,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:03:43,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:43,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:03:43,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:03:43,445 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 204 [2021-03-26 10:03:43,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 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 10:03:43,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:43,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 204 [2021-03-26 10:03:43,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:43,472 INFO L129 PetriNetUnfolder]: 1/33 cut-off events. [2021-03-26 10:03:43,473 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:43,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 41. Up to 3 conditions per place. [2021-03-26 10:03:43,473 INFO L132 encePairwiseOnDemand]: 200/204 looper letters, 1 selfloop transitions, 2 changer transitions 3/33 dead transitions. [2021-03-26 10:03:43,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 90 flow [2021-03-26 10:03:43,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:03:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:03:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 897 transitions. [2021-03-26 10:03:43,476 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8794117647058823 [2021-03-26 10:03:43,476 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 897 transitions. [2021-03-26 10:03:43,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 897 transitions. [2021-03-26 10:03:43,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:43,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 897 transitions. [2021-03-26 10:03:43,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 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 10:03:43,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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 10:03:43,482 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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 10:03:43,482 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 5 states and 897 transitions. [2021-03-26 10:03:43,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 90 flow [2021-03-26 10:03:43,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:03:43,483 INFO L241 Difference]: Finished difference. Result has 45 places, 30 transitions, 76 flow [2021-03-26 10:03:43,483 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2021-03-26 10:03:43,484 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -12 predicate places. [2021-03-26 10:03:43,484 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:43,484 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 30 transitions, 76 flow [2021-03-26 10:03:43,484 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 30 transitions, 76 flow [2021-03-26 10:03:43,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 76 flow [2021-03-26 10:03:43,490 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-26 10:03:43,490 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:43,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:03:43,490 INFO L142 LiptonReduction]: Number of co-enabled transitions 410 [2021-03-26 10:03:44,136 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 10:03:44,305 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 10:03:44,647 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 10:03:44,797 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 10:03:44,803 INFO L154 LiptonReduction]: Checked pairs total: 1542 [2021-03-26 10:03:44,804 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:03:44,804 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1320 [2021-03-26 10:03:44,805 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 72 flow [2021-03-26 10:03:44,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 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 10:03:44,805 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:44,806 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:44,806 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:03:44,806 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:03:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:44,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1013797571, now seen corresponding path program 1 times [2021-03-26 10:03:44,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:44,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029719592] [2021-03-26 10:03:44,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:44,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:44,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:44,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:44,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:44,878 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 10:03:44,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:03:44,888 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 10:03:44,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029719592] [2021-03-26 10:03:44,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:44,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:03:44,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712830818] [2021-03-26 10:03:44,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:03:44,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:44,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:03:44,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:03:44,892 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 206 [2021-03-26 10:03:44,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 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 10:03:44,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:44,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 206 [2021-03-26 10:03:44,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:44,965 INFO L129 PetriNetUnfolder]: 144/386 cut-off events. [2021-03-26 10:03:44,965 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-03-26 10:03:44,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 386 events. 144/386 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2213 event pairs, 11 based on Foata normal form. 20/400 useless extension candidates. Maximal degree in co-relation 702. Up to 164 conditions per place. [2021-03-26 10:03:44,969 INFO L132 encePairwiseOnDemand]: 197/206 looper letters, 12 selfloop transitions, 10 changer transitions 0/41 dead transitions. [2021-03-26 10:03:44,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 148 flow [2021-03-26 10:03:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:03:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:03:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 676 transitions. [2021-03-26 10:03:44,972 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8203883495145631 [2021-03-26 10:03:44,972 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 676 transitions. [2021-03-26 10:03:44,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 676 transitions. [2021-03-26 10:03:44,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:44,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 676 transitions. [2021-03-26 10:03:44,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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 10:03:44,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 10:03:44,977 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 10:03:44,977 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 72 flow. Second operand 4 states and 676 transitions. [2021-03-26 10:03:44,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 148 flow [2021-03-26 10:03:44,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:03:44,980 INFO L241 Difference]: Finished difference. Result has 44 places, 37 transitions, 145 flow [2021-03-26 10:03:44,980 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2021-03-26 10:03:44,980 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -13 predicate places. [2021-03-26 10:03:44,980 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:44,980 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 145 flow [2021-03-26 10:03:44,981 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 145 flow [2021-03-26 10:03:44,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 145 flow [2021-03-26 10:03:45,017 INFO L129 PetriNetUnfolder]: 131/390 cut-off events. [2021-03-26 10:03:45,017 INFO L130 PetriNetUnfolder]: For 136/144 co-relation queries the response was YES. [2021-03-26 10:03:45,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 390 events. 131/390 cut-off events. For 136/144 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2417 event pairs, 31 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 808. Up to 142 conditions per place. [2021-03-26 10:03:45,023 INFO L142 LiptonReduction]: Number of co-enabled transitions 572 [2021-03-26 10:03:45,205 INFO L154 LiptonReduction]: Checked pairs total: 423 [2021-03-26 10:03:45,205 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:03:45,205 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 225 [2021-03-26 10:03:45,206 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 145 flow [2021-03-26 10:03:45,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 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 10:03:45,207 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:45,207 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:45,207 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:03:45,207 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:03:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:45,208 INFO L82 PathProgramCache]: Analyzing trace with hash -788819116, now seen corresponding path program 1 times [2021-03-26 10:03:45,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:45,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367318952] [2021-03-26 10:03:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:45,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:45,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:45,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:45,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:03:45,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:45,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:45,293 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 10:03:45,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367318952] [2021-03-26 10:03:45,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:45,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:03:45,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060174841] [2021-03-26 10:03:45,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:03:45,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:45,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:03:45,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:03:45,295 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-03-26 10:03:45,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 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 10:03:45,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:45,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-03-26 10:03:45,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:45,474 INFO L129 PetriNetUnfolder]: 728/1509 cut-off events. [2021-03-26 10:03:45,475 INFO L130 PetriNetUnfolder]: For 297/360 co-relation queries the response was YES. [2021-03-26 10:03:45,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3238 conditions, 1509 events. 728/1509 cut-off events. For 297/360 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 11665 event pairs, 312 based on Foata normal form. 125/1497 useless extension candidates. Maximal degree in co-relation 3225. Up to 873 conditions per place. [2021-03-26 10:03:45,490 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 10 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2021-03-26 10:03:45,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 211 flow [2021-03-26 10:03:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:03:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:03:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 887 transitions. [2021-03-26 10:03:45,493 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8611650485436894 [2021-03-26 10:03:45,494 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 887 transitions. [2021-03-26 10:03:45,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 887 transitions. [2021-03-26 10:03:45,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:45,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 887 transitions. [2021-03-26 10:03:45,497 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 10:03:45,499 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 10:03:45,500 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 10:03:45,500 INFO L185 Difference]: Start difference. First operand has 44 places, 37 transitions, 145 flow. Second operand 5 states and 887 transitions. [2021-03-26 10:03:45,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 211 flow [2021-03-26 10:03:45,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:03:45,504 INFO L241 Difference]: Finished difference. Result has 51 places, 46 transitions, 220 flow [2021-03-26 10:03:45,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2021-03-26 10:03:45,505 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -6 predicate places. [2021-03-26 10:03:45,505 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:45,505 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 46 transitions, 220 flow [2021-03-26 10:03:45,505 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 46 transitions, 220 flow [2021-03-26 10:03:45,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 220 flow [2021-03-26 10:03:45,678 INFO L129 PetriNetUnfolder]: 794/1634 cut-off events. [2021-03-26 10:03:45,678 INFO L130 PetriNetUnfolder]: For 1087/1573 co-relation queries the response was YES. [2021-03-26 10:03:45,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4530 conditions, 1634 events. 794/1634 cut-off events. For 1087/1573 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 13006 event pairs, 335 based on Foata normal form. 11/1452 useless extension candidates. Maximal degree in co-relation 4514. Up to 1006 conditions per place. [2021-03-26 10:03:45,700 INFO L142 LiptonReduction]: Number of co-enabled transitions 864 [2021-03-26 10:03:46,531 INFO L154 LiptonReduction]: Checked pairs total: 965 [2021-03-26 10:03:46,531 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:03:46,531 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1026 [2021-03-26 10:03:46,532 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 214 flow [2021-03-26 10:03:46,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 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 10:03:46,533 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:46,533 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:46,533 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:03:46,533 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:03:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:46,534 INFO L82 PathProgramCache]: Analyzing trace with hash 124805121, now seen corresponding path program 1 times [2021-03-26 10:03:46,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:46,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845059697] [2021-03-26 10:03:46,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:46,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:46,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:46,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:46,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:46,593 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 10:03:46,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:03:46,603 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 10:03:46,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845059697] [2021-03-26 10:03:46,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:46,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:03:46,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184659135] [2021-03-26 10:03:46,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:03:46,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:46,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:03:46,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:03:46,609 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 206 [2021-03-26 10:03:46,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 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 10:03:46,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:46,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 206 [2021-03-26 10:03:46,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:46,830 INFO L129 PetriNetUnfolder]: 897/1790 cut-off events. [2021-03-26 10:03:46,830 INFO L130 PetriNetUnfolder]: For 1663/2165 co-relation queries the response was YES. [2021-03-26 10:03:46,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5292 conditions, 1790 events. 897/1790 cut-off events. For 1663/2165 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 13497 event pairs, 394 based on Foata normal form. 104/1748 useless extension candidates. Maximal degree in co-relation 5274. Up to 1130 conditions per place. [2021-03-26 10:03:46,850 INFO L132 encePairwiseOnDemand]: 197/206 looper letters, 16 selfloop transitions, 15 changer transitions 0/54 dead transitions. [2021-03-26 10:03:46,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 320 flow [2021-03-26 10:03:46,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:03:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:03:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 674 transitions. [2021-03-26 10:03:46,853 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8179611650485437 [2021-03-26 10:03:46,853 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 674 transitions. [2021-03-26 10:03:46,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 674 transitions. [2021-03-26 10:03:46,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:46,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 674 transitions. [2021-03-26 10:03:46,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 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 10:03:46,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 10:03:46,858 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 10:03:46,858 INFO L185 Difference]: Start difference. First operand has 51 places, 45 transitions, 214 flow. Second operand 4 states and 674 transitions. [2021-03-26 10:03:46,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 320 flow [2021-03-26 10:03:46,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 54 transitions, 313 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:03:46,877 INFO L241 Difference]: Finished difference. Result has 53 places, 50 transitions, 312 flow [2021-03-26 10:03:46,877 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2021-03-26 10:03:46,877 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 10:03:46,877 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:46,877 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 50 transitions, 312 flow [2021-03-26 10:03:46,878 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 50 transitions, 312 flow [2021-03-26 10:03:46,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 50 transitions, 312 flow [2021-03-26 10:03:47,064 INFO L129 PetriNetUnfolder]: 955/1892 cut-off events. [2021-03-26 10:03:47,064 INFO L130 PetriNetUnfolder]: For 1653/1864 co-relation queries the response was YES. [2021-03-26 10:03:47,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 1892 events. 955/1892 cut-off events. For 1653/1864 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 14908 event pairs, 448 based on Foata normal form. 1/1733 useless extension candidates. Maximal degree in co-relation 5358. Up to 1221 conditions per place. [2021-03-26 10:03:47,096 INFO L142 LiptonReduction]: Number of co-enabled transitions 840 [2021-03-26 10:03:47,393 INFO L154 LiptonReduction]: Checked pairs total: 505 [2021-03-26 10:03:47,394 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:03:47,394 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 517 [2021-03-26 10:03:47,397 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 312 flow [2021-03-26 10:03:47,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 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 10:03:47,397 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:47,397 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:47,397 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:03:47,397 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:03:47,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:47,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1555249359, now seen corresponding path program 1 times [2021-03-26 10:03:47,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:47,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252230558] [2021-03-26 10:03:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:47,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:47,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:47,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:47,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:47,469 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 10:03:47,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:03:47,479 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 10:03:47,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252230558] [2021-03-26 10:03:47,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:47,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:03:47,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315667077] [2021-03-26 10:03:47,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:03:47,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:47,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:03:47,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:03:47,484 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 206 [2021-03-26 10:03:47,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 164.5) internal successors, (658), 4 states have internal predecessors, (658), 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 10:03:47,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:47,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 206 [2021-03-26 10:03:47,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:47,839 INFO L129 PetriNetUnfolder]: 1248/2437 cut-off events. [2021-03-26 10:03:47,840 INFO L130 PetriNetUnfolder]: For 2746/3793 co-relation queries the response was YES. [2021-03-26 10:03:47,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7288 conditions, 2437 events. 1248/2437 cut-off events. For 2746/3793 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 19528 event pairs, 590 based on Foata normal form. 97/2287 useless extension candidates. Maximal degree in co-relation 7267. Up to 1636 conditions per place. [2021-03-26 10:03:47,869 INFO L132 encePairwiseOnDemand]: 197/206 looper letters, 19 selfloop transitions, 17 changer transitions 0/59 dead transitions. [2021-03-26 10:03:47,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 448 flow [2021-03-26 10:03:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:03:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:03:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 674 transitions. [2021-03-26 10:03:47,872 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8179611650485437 [2021-03-26 10:03:47,872 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 674 transitions. [2021-03-26 10:03:47,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 674 transitions. [2021-03-26 10:03:47,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:47,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 674 transitions. [2021-03-26 10:03:47,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 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 10:03:47,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 10:03:47,875 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 10:03:47,875 INFO L185 Difference]: Start difference. First operand has 53 places, 50 transitions, 312 flow. Second operand 4 states and 674 transitions. [2021-03-26 10:03:47,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 448 flow [2021-03-26 10:03:47,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:03:47,883 INFO L241 Difference]: Finished difference. Result has 59 places, 56 transitions, 441 flow [2021-03-26 10:03:47,883 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=441, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2021-03-26 10:03:47,883 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2021-03-26 10:03:47,883 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:47,883 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 56 transitions, 441 flow [2021-03-26 10:03:47,884 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 56 transitions, 441 flow [2021-03-26 10:03:47,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 56 transitions, 441 flow [2021-03-26 10:03:48,130 INFO L129 PetriNetUnfolder]: 1228/2391 cut-off events. [2021-03-26 10:03:48,130 INFO L130 PetriNetUnfolder]: For 2758/3279 co-relation queries the response was YES. [2021-03-26 10:03:48,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7135 conditions, 2391 events. 1228/2391 cut-off events. For 2758/3279 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 19606 event pairs, 571 based on Foata normal form. 4/2125 useless extension candidates. Maximal degree in co-relation 7111. Up to 1614 conditions per place. [2021-03-26 10:03:48,170 INFO L142 LiptonReduction]: Number of co-enabled transitions 978 [2021-03-26 10:03:48,656 INFO L154 LiptonReduction]: Checked pairs total: 826 [2021-03-26 10:03:48,656 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:03:48,656 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 773 [2021-03-26 10:03:48,657 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 441 flow [2021-03-26 10:03:48,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.5) internal successors, (658), 4 states have internal predecessors, (658), 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 10:03:48,657 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:48,657 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:48,657 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:03:48,658 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:03:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash 501691529, now seen corresponding path program 1 times [2021-03-26 10:03:48,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:48,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587806471] [2021-03-26 10:03:48,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:48,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:48,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:48,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:48,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:48,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:48,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:03:48,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:48,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:48,727 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 10:03:48,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587806471] [2021-03-26 10:03:48,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:48,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:03:48,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029519487] [2021-03-26 10:03:48,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:03:48,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:48,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:03:48,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:03:48,729 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-03-26 10:03:48,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 441 flow. Second operand has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 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 10:03:48,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:48,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-03-26 10:03:48,730 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:48,991 INFO L129 PetriNetUnfolder]: 933/2037 cut-off events. [2021-03-26 10:03:48,991 INFO L130 PetriNetUnfolder]: For 2661/4206 co-relation queries the response was YES. [2021-03-26 10:03:49,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7652 conditions, 2037 events. 933/2037 cut-off events. For 2661/4206 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 16735 event pairs, 161 based on Foata normal form. 441/2375 useless extension candidates. Maximal degree in co-relation 7626. Up to 1469 conditions per place. [2021-03-26 10:03:49,013 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 10 selfloop transitions, 14 changer transitions 0/69 dead transitions. [2021-03-26 10:03:49,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 69 transitions, 565 flow [2021-03-26 10:03:49,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:03:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:03:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1064 transitions. [2021-03-26 10:03:49,016 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.86084142394822 [2021-03-26 10:03:49,017 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1064 transitions. [2021-03-26 10:03:49,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1064 transitions. [2021-03-26 10:03:49,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:49,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1064 transitions. [2021-03-26 10:03:49,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.33333333333334) internal successors, (1064), 6 states have internal predecessors, (1064), 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 10:03:49,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 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 10:03:49,052 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 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 10:03:49,052 INFO L185 Difference]: Start difference. First operand has 59 places, 56 transitions, 441 flow. Second operand 6 states and 1064 transitions. [2021-03-26 10:03:49,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 69 transitions, 565 flow [2021-03-26 10:03:49,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 69 transitions, 563 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 10:03:49,059 INFO L241 Difference]: Finished difference. Result has 67 places, 65 transitions, 559 flow [2021-03-26 10:03:49,059 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=559, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2021-03-26 10:03:49,059 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2021-03-26 10:03:49,059 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:49,060 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 65 transitions, 559 flow [2021-03-26 10:03:49,060 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 65 transitions, 559 flow [2021-03-26 10:03:49,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 65 transitions, 559 flow [2021-03-26 10:03:49,234 INFO L129 PetriNetUnfolder]: 915/1991 cut-off events. [2021-03-26 10:03:49,234 INFO L130 PetriNetUnfolder]: For 4718/6157 co-relation queries the response was YES. [2021-03-26 10:03:49,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8838 conditions, 1991 events. 915/1991 cut-off events. For 4718/6157 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 16448 event pairs, 153 based on Foata normal form. 50/1919 useless extension candidates. Maximal degree in co-relation 8809. Up to 1446 conditions per place. [2021-03-26 10:03:49,270 INFO L142 LiptonReduction]: Number of co-enabled transitions 1420 [2021-03-26 10:03:50,141 INFO L154 LiptonReduction]: Checked pairs total: 2134 [2021-03-26 10:03:50,142 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:03:50,142 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1083 [2021-03-26 10:03:50,142 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 551 flow [2021-03-26 10:03:50,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 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 10:03:50,143 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:50,143 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 10:03:50,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:03:50,143 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:03:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash 529942340, now seen corresponding path program 1 times [2021-03-26 10:03:50,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:50,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758259921] [2021-03-26 10:03:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:50,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:50,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:50,234 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-26 10:03:50,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:03:50,250 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-03-26 10:03:50,252 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-03-26 10:03:50,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:50,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:50,275 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 10:03:50,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758259921] [2021-03-26 10:03:50,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:50,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:03:50,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460256322] [2021-03-26 10:03:50,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:03:50,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:50,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:03:50,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:03:50,278 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 206 [2021-03-26 10:03:50,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 551 flow. Second operand has 5 states, 5 states have (on average 162.4) internal successors, (812), 5 states have internal predecessors, (812), 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 10:03:50,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:50,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 206 [2021-03-26 10:03:50,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:51,494 INFO L129 PetriNetUnfolder]: 4098/8058 cut-off events. [2021-03-26 10:03:51,495 INFO L130 PetriNetUnfolder]: For 20586/23540 co-relation queries the response was YES. [2021-03-26 10:03:51,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31528 conditions, 8058 events. 4098/8058 cut-off events. For 20586/23540 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 72774 event pairs, 962 based on Foata normal form. 436/7928 useless extension candidates. Maximal degree in co-relation 31497. Up to 3896 conditions per place. [2021-03-26 10:03:51,646 INFO L132 encePairwiseOnDemand]: 198/206 looper letters, 15 selfloop transitions, 20 changer transitions 4/87 dead transitions. [2021-03-26 10:03:51,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 87 transitions, 743 flow [2021-03-26 10:03:51,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:03:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:03:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 998 transitions. [2021-03-26 10:03:51,649 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8074433656957929 [2021-03-26 10:03:51,649 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 998 transitions. [2021-03-26 10:03:51,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 998 transitions. [2021-03-26 10:03:51,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:51,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 998 transitions. [2021-03-26 10:03:51,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.33333333333334) internal successors, (998), 6 states have internal predecessors, (998), 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 10:03:51,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 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 10:03:51,655 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 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 10:03:51,655 INFO L185 Difference]: Start difference. First operand has 67 places, 64 transitions, 551 flow. Second operand 6 states and 998 transitions. [2021-03-26 10:03:51,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 87 transitions, 743 flow [2021-03-26 10:03:52,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 663 flow, removed 22 selfloop flow, removed 5 redundant places. [2021-03-26 10:03:52,144 INFO L241 Difference]: Finished difference. Result has 68 places, 81 transitions, 618 flow [2021-03-26 10:03:52,144 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=618, PETRI_PLACES=68, PETRI_TRANSITIONS=81} [2021-03-26 10:03:52,145 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2021-03-26 10:03:52,145 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:52,145 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 81 transitions, 618 flow [2021-03-26 10:03:52,145 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 81 transitions, 618 flow [2021-03-26 10:03:52,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 81 transitions, 618 flow [2021-03-26 10:03:52,789 INFO L129 PetriNetUnfolder]: 4122/8029 cut-off events. [2021-03-26 10:03:52,789 INFO L130 PetriNetUnfolder]: For 11121/12655 co-relation queries the response was YES. [2021-03-26 10:03:52,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25630 conditions, 8029 events. 4122/8029 cut-off events. For 11121/12655 co-relation queries the response was YES. Maximal size of possible extension queue 852. Compared 73036 event pairs, 866 based on Foata normal form. 289/7732 useless extension candidates. Maximal degree in co-relation 25602. Up to 3885 conditions per place. [2021-03-26 10:03:52,863 INFO L142 LiptonReduction]: Number of co-enabled transitions 1800 [2021-03-26 10:04:05,125 INFO L154 LiptonReduction]: Checked pairs total: 336 [2021-03-26 10:04:05,125 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:04:05,125 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12980 [2021-03-26 10:04:05,125 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 81 transitions, 621 flow [2021-03-26 10:04:05,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.4) internal successors, (812), 5 states have internal predecessors, (812), 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 10:04:05,126 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:04:05,126 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 10:04:05,126 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:04:05,126 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:04:05,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:04:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1106665924, now seen corresponding path program 1 times [2021-03-26 10:04:05,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:04:05,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534243547] [2021-03-26 10:04:05,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:04:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:04:05,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:05,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:04:05,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:05,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:04:05,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:05,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:04:05,241 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 10:04:05,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:04:05,254 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 10:04:05,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534243547] [2021-03-26 10:04:05,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:04:05,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:04:05,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984504333] [2021-03-26 10:04:05,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:04:05,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:04:05,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:04:05,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:04:05,256 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 207 [2021-03-26 10:04:05,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 81 transitions, 621 flow. Second operand has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 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 10:04:05,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:04:05,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 207 [2021-03-26 10:04:05,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:04:06,541 INFO L129 PetriNetUnfolder]: 6698/13059 cut-off events. [2021-03-26 10:04:06,542 INFO L130 PetriNetUnfolder]: For 21995/25300 co-relation queries the response was YES. [2021-03-26 10:04:06,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42724 conditions, 13059 events. 6698/13059 cut-off events. For 21995/25300 co-relation queries the response was YES. Maximal size of possible extension queue 1407. Compared 126233 event pairs, 1470 based on Foata normal form. 906/12969 useless extension candidates. Maximal degree in co-relation 42694. Up to 6470 conditions per place. [2021-03-26 10:04:06,602 INFO L132 encePairwiseOnDemand]: 196/207 looper letters, 34 selfloop transitions, 30 changer transitions 28/129 dead transitions. [2021-03-26 10:04:06,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 129 transitions, 1279 flow [2021-03-26 10:04:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:04:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:04:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 999 transitions. [2021-03-26 10:04:06,604 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8043478260869565 [2021-03-26 10:04:06,605 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 999 transitions. [2021-03-26 10:04:06,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 999 transitions. [2021-03-26 10:04:06,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:04:06,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 999 transitions. [2021-03-26 10:04:06,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:04:06,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 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 10:04:06,609 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 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 10:04:06,610 INFO L185 Difference]: Start difference. First operand has 68 places, 81 transitions, 621 flow. Second operand 6 states and 999 transitions. [2021-03-26 10:04:06,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 129 transitions, 1279 flow [2021-03-26 10:04:06,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 129 transitions, 1279 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:04:06,649 INFO L241 Difference]: Finished difference. Result has 76 places, 85 transitions, 811 flow [2021-03-26 10:04:06,649 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=811, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2021-03-26 10:04:06,650 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2021-03-26 10:04:06,650 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:04:06,650 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 85 transitions, 811 flow [2021-03-26 10:04:06,650 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 85 transitions, 811 flow [2021-03-26 10:04:06,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 85 transitions, 811 flow [2021-03-26 10:04:07,446 INFO L129 PetriNetUnfolder]: 4793/9765 cut-off events. [2021-03-26 10:04:07,446 INFO L130 PetriNetUnfolder]: For 17656/19793 co-relation queries the response was YES. [2021-03-26 10:04:07,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32005 conditions, 9765 events. 4793/9765 cut-off events. For 17656/19793 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 95804 event pairs, 1039 based on Foata normal form. 413/9483 useless extension candidates. Maximal degree in co-relation 31972. Up to 4937 conditions per place. [2021-03-26 10:04:07,573 INFO L142 LiptonReduction]: Number of co-enabled transitions 1954 [2021-03-26 10:04:11,006 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:04:11,007 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:04:11,007 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4357 [2021-03-26 10:04:11,007 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 811 flow [2021-03-26 10:04:11,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 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 10:04:11,008 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:04:11,008 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 10:04:11,008 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:04:11,008 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:04:11,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:04:11,008 INFO L82 PathProgramCache]: Analyzing trace with hash 784272420, now seen corresponding path program 1 times [2021-03-26 10:04:11,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:04:11,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814267948] [2021-03-26 10:04:11,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:04:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:04:11,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:11,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:04:11,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:11,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:04:11,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:11,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:04:11,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:11,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:04:11,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:11,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:04:11,070 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 10:04:11,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814267948] [2021-03-26 10:04:11,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:04:11,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:04:11,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460936279] [2021-03-26 10:04:11,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:04:11,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:04:11,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:04:11,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:04:11,072 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 207 [2021-03-26 10:04:11,073 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 811 flow. Second operand has 6 states, 6 states have (on average 174.83333333333334) internal successors, (1049), 6 states have internal predecessors, (1049), 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 10:04:11,073 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:04:11,073 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 207 [2021-03-26 10:04:11,073 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:04:11,849 INFO L129 PetriNetUnfolder]: 3299/7673 cut-off events. [2021-03-26 10:04:11,849 INFO L130 PetriNetUnfolder]: For 16457/23278 co-relation queries the response was YES. [2021-03-26 10:04:11,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29594 conditions, 7673 events. 3299/7673 cut-off events. For 16457/23278 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 79184 event pairs, 393 based on Foata normal form. 3519/10770 useless extension candidates. Maximal degree in co-relation 29559. Up to 4226 conditions per place. [2021-03-26 10:04:11,895 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 8 selfloop transitions, 18 changer transitions 6/98 dead transitions. [2021-03-26 10:04:11,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 98 transitions, 973 flow [2021-03-26 10:04:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:04:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:04:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1248 transitions. [2021-03-26 10:04:11,898 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8612836438923396 [2021-03-26 10:04:11,898 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1248 transitions. [2021-03-26 10:04:11,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1248 transitions. [2021-03-26 10:04:11,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:04:11,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1248 transitions. [2021-03-26 10:04:11,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 178.28571428571428) internal successors, (1248), 7 states have internal predecessors, (1248), 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 10:04:11,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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 10:04:11,904 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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 10:04:11,904 INFO L185 Difference]: Start difference. First operand has 76 places, 85 transitions, 811 flow. Second operand 7 states and 1248 transitions. [2021-03-26 10:04:11,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 98 transitions, 973 flow [2021-03-26 10:04:11,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 98 transitions, 954 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-26 10:04:11,952 INFO L241 Difference]: Finished difference. Result has 82 places, 92 transitions, 908 flow [2021-03-26 10:04:11,953 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=908, PETRI_PLACES=82, PETRI_TRANSITIONS=92} [2021-03-26 10:04:11,953 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2021-03-26 10:04:11,953 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:04:11,953 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 92 transitions, 908 flow [2021-03-26 10:04:11,953 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 92 transitions, 908 flow [2021-03-26 10:04:11,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 92 transitions, 908 flow [2021-03-26 10:04:12,630 INFO L129 PetriNetUnfolder]: 3255/7463 cut-off events. [2021-03-26 10:04:12,630 INFO L130 PetriNetUnfolder]: For 21359/23839 co-relation queries the response was YES. [2021-03-26 10:04:12,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31548 conditions, 7463 events. 3255/7463 cut-off events. For 21359/23839 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 76230 event pairs, 315 based on Foata normal form. 107/7200 useless extension candidates. Maximal degree in co-relation 31513. Up to 4299 conditions per place. [2021-03-26 10:04:12,714 INFO L142 LiptonReduction]: Number of co-enabled transitions 2092 [2021-03-26 10:04:12,963 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:04:12,963 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:04:12,963 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1010 [2021-03-26 10:04:12,964 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 92 transitions, 908 flow [2021-03-26 10:04:12,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 174.83333333333334) internal successors, (1049), 6 states have internal predecessors, (1049), 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 10:04:12,964 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:04:12,964 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 10:04:12,964 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:04:12,964 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:04:12,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:04:12,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1379459477, now seen corresponding path program 1 times [2021-03-26 10:04:12,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:04:12,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737948214] [2021-03-26 10:04:12,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:04:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:04:13,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:13,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:04:13,063 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-26 10:04:13,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 10:04:13,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:13,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:04:13,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:13,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:04:13,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:13,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:04:13,120 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 10:04:13,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737948214] [2021-03-26 10:04:13,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:04:13,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:04:13,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498038712] [2021-03-26 10:04:13,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:04:13,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:04:13,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:04:13,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:04:13,122 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 207 [2021-03-26 10:04:13,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 92 transitions, 908 flow. Second operand has 7 states, 7 states have (on average 153.14285714285714) internal successors, (1072), 7 states have internal predecessors, (1072), 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 10:04:13,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:04:13,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 207 [2021-03-26 10:04:13,123 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:04:14,077 INFO L129 PetriNetUnfolder]: 4090/9480 cut-off events. [2021-03-26 10:04:14,077 INFO L130 PetriNetUnfolder]: For 29990/35951 co-relation queries the response was YES. [2021-03-26 10:04:14,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42026 conditions, 9480 events. 4090/9480 cut-off events. For 29990/35951 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 100874 event pairs, 351 based on Foata normal form. 658/9655 useless extension candidates. Maximal degree in co-relation 41989. Up to 5368 conditions per place. [2021-03-26 10:04:14,124 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 26 selfloop transitions, 18 changer transitions 5/114 dead transitions. [2021-03-26 10:04:14,125 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 114 transitions, 1178 flow [2021-03-26 10:04:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:04:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:04:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1093 transitions. [2021-03-26 10:04:14,127 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7543133195307108 [2021-03-26 10:04:14,127 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1093 transitions. [2021-03-26 10:04:14,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1093 transitions. [2021-03-26 10:04:14,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:04:14,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1093 transitions. [2021-03-26 10:04:14,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.14285714285714) internal successors, (1093), 7 states have internal predecessors, (1093), 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 10:04:14,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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 10:04:14,133 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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 10:04:14,133 INFO L185 Difference]: Start difference. First operand has 82 places, 92 transitions, 908 flow. Second operand 7 states and 1093 transitions. [2021-03-26 10:04:14,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 114 transitions, 1178 flow [2021-03-26 10:04:15,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 114 transitions, 1088 flow, removed 26 selfloop flow, removed 3 redundant places. [2021-03-26 10:04:15,351 INFO L241 Difference]: Finished difference. Result has 88 places, 99 transitions, 943 flow [2021-03-26 10:04:15,351 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=943, PETRI_PLACES=88, PETRI_TRANSITIONS=99} [2021-03-26 10:04:15,351 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2021-03-26 10:04:15,352 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:04:15,352 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 99 transitions, 943 flow [2021-03-26 10:04:15,352 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 99 transitions, 943 flow [2021-03-26 10:04:15,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 99 transitions, 943 flow [2021-03-26 10:04:15,999 INFO L129 PetriNetUnfolder]: 4033/9222 cut-off events. [2021-03-26 10:04:15,999 INFO L130 PetriNetUnfolder]: For 19151/20215 co-relation queries the response was YES. [2021-03-26 10:04:16,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32427 conditions, 9222 events. 4033/9222 cut-off events. For 19151/20215 co-relation queries the response was YES. Maximal size of possible extension queue 1060. Compared 99027 event pairs, 343 based on Foata normal form. 172/8900 useless extension candidates. Maximal degree in co-relation 32389. Up to 2614 conditions per place. [2021-03-26 10:04:16,088 INFO L142 LiptonReduction]: Number of co-enabled transitions 2290 [2021-03-26 10:04:16,510 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:04:16,510 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:04:16,510 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1158 [2021-03-26 10:04:16,511 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 99 transitions, 943 flow [2021-03-26 10:04:16,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 153.14285714285714) internal successors, (1072), 7 states have internal predecessors, (1072), 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 10:04:16,511 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:04:16,512 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 10:04:16,512 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:04:16,512 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:04:16,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:04:16,512 INFO L82 PathProgramCache]: Analyzing trace with hash 191786991, now seen corresponding path program 2 times [2021-03-26 10:04:16,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:04:16,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73004985] [2021-03-26 10:04:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:04:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:04:16,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:16,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:04:16,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:16,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:04:16,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:16,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:04:16,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:16,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:04:16,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:16,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:04:16,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:16,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:04:16,602 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 10:04:16,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73004985] [2021-03-26 10:04:16,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:04:16,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:04:16,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069950756] [2021-03-26 10:04:16,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:04:16,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:04:16,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:04:16,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:04:16,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 207 [2021-03-26 10:04:16,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 99 transitions, 943 flow. Second operand has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 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 10:04:16,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:04:16,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 207 [2021-03-26 10:04:16,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:04:17,546 INFO L129 PetriNetUnfolder]: 3651/8675 cut-off events. [2021-03-26 10:04:17,546 INFO L130 PetriNetUnfolder]: For 23526/30302 co-relation queries the response was YES. [2021-03-26 10:04:17,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35654 conditions, 8675 events. 3651/8675 cut-off events. For 23526/30302 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 93171 event pairs, 327 based on Foata normal form. 2971/11162 useless extension candidates. Maximal degree in co-relation 35614. Up to 2486 conditions per place. [2021-03-26 10:04:17,585 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 2 selfloop transitions, 23 changer transitions 44/102 dead transitions. [2021-03-26 10:04:17,585 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 1026 flow [2021-03-26 10:04:17,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:04:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:04:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1597 transitions. [2021-03-26 10:04:17,588 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8572195383789587 [2021-03-26 10:04:17,588 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1597 transitions. [2021-03-26 10:04:17,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1597 transitions. [2021-03-26 10:04:17,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:04:17,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1597 transitions. [2021-03-26 10:04:17,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 177.44444444444446) internal successors, (1597), 9 states have internal predecessors, (1597), 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 10:04:17,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 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 10:04:17,596 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 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 10:04:17,596 INFO L185 Difference]: Start difference. First operand has 88 places, 99 transitions, 943 flow. Second operand 9 states and 1597 transitions. [2021-03-26 10:04:17,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 1026 flow [2021-03-26 10:04:18,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 998 flow, removed 11 selfloop flow, removed 3 redundant places. [2021-03-26 10:04:18,006 INFO L241 Difference]: Finished difference. Result has 96 places, 58 transitions, 494 flow [2021-03-26 10:04:18,006 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=494, PETRI_PLACES=96, PETRI_TRANSITIONS=58} [2021-03-26 10:04:18,006 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 39 predicate places. [2021-03-26 10:04:18,007 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:04:18,007 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 58 transitions, 494 flow [2021-03-26 10:04:18,007 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 58 transitions, 494 flow [2021-03-26 10:04:18,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 58 transitions, 494 flow [2021-03-26 10:04:18,044 INFO L129 PetriNetUnfolder]: 276/641 cut-off events. [2021-03-26 10:04:18,045 INFO L130 PetriNetUnfolder]: For 1462/1536 co-relation queries the response was YES. [2021-03-26 10:04:18,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2670 conditions, 641 events. 276/641 cut-off events. For 1462/1536 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4129 event pairs, 15 based on Foata normal form. 3/613 useless extension candidates. Maximal degree in co-relation 2638. Up to 201 conditions per place. [2021-03-26 10:04:18,050 INFO L142 LiptonReduction]: Number of co-enabled transitions 672 [2021-03-26 10:04:18,384 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:04:18,508 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:04:18,672 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 69 [2021-03-26 10:04:18,982 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 88 [2021-03-26 10:04:19,396 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:04:19,541 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:04:19,545 INFO L154 LiptonReduction]: Checked pairs total: 134 [2021-03-26 10:04:19,545 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 10:04:19,545 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1539 [2021-03-26 10:04:19,546 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 52 transitions, 476 flow [2021-03-26 10:04:19,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 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 10:04:19,546 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:04:19,547 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:04:19,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:04:19,547 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:04:19,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:04:19,547 INFO L82 PathProgramCache]: Analyzing trace with hash 913347877, now seen corresponding path program 1 times [2021-03-26 10:04:19,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:04:19,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336032815] [2021-03-26 10:04:19,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:04:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:04:19,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:19,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:04:19,621 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-26 10:04:19,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 10:04:19,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:19,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:04:19,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:19,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:04:19,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:19,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:04:19,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 10:04:19,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336032815] [2021-03-26 10:04:19,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:04:19,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:04:19,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602717817] [2021-03-26 10:04:19,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:04:19,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:04:19,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:04:19,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:04:19,672 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 214 [2021-03-26 10:04:19,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 52 transitions, 476 flow. Second operand has 7 states, 7 states have (on average 155.28571428571428) internal successors, (1087), 7 states have internal predecessors, (1087), 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 10:04:19,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:04:19,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 214 [2021-03-26 10:04:19,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:04:19,876 INFO L129 PetriNetUnfolder]: 224/507 cut-off events. [2021-03-26 10:04:19,877 INFO L130 PetriNetUnfolder]: For 2032/2410 co-relation queries the response was YES. [2021-03-26 10:04:19,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 507 events. 224/507 cut-off events. For 2032/2410 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3034 event pairs, 5 based on Foata normal form. 33/508 useless extension candidates. Maximal degree in co-relation 2147. Up to 172 conditions per place. [2021-03-26 10:04:19,882 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 19 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2021-03-26 10:04:19,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 60 transitions, 566 flow [2021-03-26 10:04:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:04:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:04:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1099 transitions. [2021-03-26 10:04:19,886 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7336448598130841 [2021-03-26 10:04:19,886 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1099 transitions. [2021-03-26 10:04:19,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1099 transitions. [2021-03-26 10:04:19,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:04:19,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1099 transitions. [2021-03-26 10:04:19,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.0) internal successors, (1099), 7 states have internal predecessors, (1099), 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 10:04:19,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 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 10:04:19,903 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 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 10:04:19,903 INFO L185 Difference]: Start difference. First operand has 87 places, 52 transitions, 476 flow. Second operand 7 states and 1099 transitions. [2021-03-26 10:04:19,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 60 transitions, 566 flow [2021-03-26 10:04:19,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 422 flow, removed 25 selfloop flow, removed 23 redundant places. [2021-03-26 10:04:19,911 INFO L241 Difference]: Finished difference. Result has 69 places, 53 transitions, 366 flow [2021-03-26 10:04:19,911 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2021-03-26 10:04:19,911 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2021-03-26 10:04:19,912 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:04:19,912 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 53 transitions, 366 flow [2021-03-26 10:04:19,912 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 53 transitions, 366 flow [2021-03-26 10:04:19,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 53 transitions, 366 flow [2021-03-26 10:04:19,948 INFO L129 PetriNetUnfolder]: 218/476 cut-off events. [2021-03-26 10:04:19,948 INFO L130 PetriNetUnfolder]: For 731/889 co-relation queries the response was YES. [2021-03-26 10:04:19,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 476 events. 218/476 cut-off events. For 731/889 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2793 event pairs, 16 based on Foata normal form. 20/457 useless extension candidates. Maximal degree in co-relation 1504. Up to 146 conditions per place. [2021-03-26 10:04:19,953 INFO L142 LiptonReduction]: Number of co-enabled transitions 524 [2021-03-26 10:04:20,010 INFO L154 LiptonReduction]: Checked pairs total: 17 [2021-03-26 10:04:20,010 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:04:20,010 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 98 [2021-03-26 10:04:20,011 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 366 flow [2021-03-26 10:04:20,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 155.28571428571428) internal successors, (1087), 7 states have internal predecessors, (1087), 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 10:04:20,011 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:04:20,012 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] [2021-03-26 10:04:20,012 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:04:20,012 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:04:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:04:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash -365681912, now seen corresponding path program 1 times [2021-03-26 10:04:20,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:04:20,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863565243] [2021-03-26 10:04:20,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:04:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:04:20,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:20,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:04:20,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:20,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:04:20,145 INFO L142 QuantifierPusher]: treesize reduction 17, result has 74.2 percent of original size [2021-03-26 10:04:20,147 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.6 percent of original size 40 [2021-03-26 10:04:20,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:20,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:04:20,187 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 10:04:20,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:04:20,202 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 10:04:20,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863565243] [2021-03-26 10:04:20,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:04:20,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:04:20,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656321216] [2021-03-26 10:04:20,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:04:20,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:04:20,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:04:20,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:04:20,205 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 214 [2021-03-26 10:04:20,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 134.57142857142858) internal successors, (942), 7 states have internal predecessors, (942), 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 10:04:20,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:04:20,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 214 [2021-03-26 10:04:20,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:04:20,443 INFO L129 PetriNetUnfolder]: 392/821 cut-off events. [2021-03-26 10:04:20,443 INFO L130 PetriNetUnfolder]: For 1787/2114 co-relation queries the response was YES. [2021-03-26 10:04:20,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 821 events. 392/821 cut-off events. For 1787/2114 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5123 event pairs, 29 based on Foata normal form. 51/817 useless extension candidates. Maximal degree in co-relation 2925. Up to 230 conditions per place. [2021-03-26 10:04:20,448 INFO L132 encePairwiseOnDemand]: 204/214 looper letters, 29 selfloop transitions, 7 changer transitions 28/87 dead transitions. [2021-03-26 10:04:20,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 741 flow [2021-03-26 10:04:20,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:04:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:04:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 834 transitions. [2021-03-26 10:04:20,451 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6495327102803738 [2021-03-26 10:04:20,451 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 834 transitions. [2021-03-26 10:04:20,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 834 transitions. [2021-03-26 10:04:20,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:04:20,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 834 transitions. [2021-03-26 10:04:20,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 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 10:04:20,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 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 10:04:20,456 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 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 10:04:20,456 INFO L185 Difference]: Start difference. First operand has 69 places, 53 transitions, 366 flow. Second operand 6 states and 834 transitions. [2021-03-26 10:04:20,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 741 flow [2021-03-26 10:04:20,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 723 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:04:20,472 INFO L241 Difference]: Finished difference. Result has 74 places, 50 transitions, 355 flow [2021-03-26 10:04:20,472 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=74, PETRI_TRANSITIONS=50} [2021-03-26 10:04:20,473 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2021-03-26 10:04:20,473 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:04:20,473 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 50 transitions, 355 flow [2021-03-26 10:04:20,473 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 50 transitions, 355 flow [2021-03-26 10:04:20,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 50 transitions, 355 flow [2021-03-26 10:04:20,513 INFO L129 PetriNetUnfolder]: 235/512 cut-off events. [2021-03-26 10:04:20,513 INFO L130 PetriNetUnfolder]: For 704/770 co-relation queries the response was YES. [2021-03-26 10:04:20,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 512 events. 235/512 cut-off events. For 704/770 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3103 event pairs, 17 based on Foata normal form. 9/479 useless extension candidates. Maximal degree in co-relation 1607. Up to 168 conditions per place. [2021-03-26 10:04:20,517 INFO L142 LiptonReduction]: Number of co-enabled transitions 478 [2021-03-26 10:04:20,520 INFO L154 LiptonReduction]: Checked pairs total: 17 [2021-03-26 10:04:20,520 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:04:20,520 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47 [2021-03-26 10:04:20,521 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 50 transitions, 355 flow [2021-03-26 10:04:20,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 134.57142857142858) internal successors, (942), 7 states have internal predecessors, (942), 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 10:04:20,521 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:04:20,521 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 10:04:20,521 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:04:20,522 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:04:20,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:04:20,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1450997609, now seen corresponding path program 1 times [2021-03-26 10:04:20,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:04:20,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983535497] [2021-03-26 10:04:20,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:04:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:04:20,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:20,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:04:20,638 INFO L142 QuantifierPusher]: treesize reduction 4, result has 86.2 percent of original size [2021-03-26 10:04:20,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 10:04:20,655 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.0 percent of original size [2021-03-26 10:04:20,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 10:04:20,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:20,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:04:20,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:20,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:04:20,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:04:20,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:04:20,701 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 10:04:20,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983535497] [2021-03-26 10:04:20,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:04:20,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:04:20,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467874043] [2021-03-26 10:04:20,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:04:20,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:04:20,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:04:20,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:04:20,704 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 214 [2021-03-26 10:04:20,704 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 355 flow. Second operand has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 states have internal predecessors, (1248), 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 10:04:20,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:04:20,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 214 [2021-03-26 10:04:20,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:04:20,917 INFO L129 PetriNetUnfolder]: 291/647 cut-off events. [2021-03-26 10:04:20,917 INFO L130 PetriNetUnfolder]: For 1333/1626 co-relation queries the response was YES. [2021-03-26 10:04:20,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2193 conditions, 647 events. 291/647 cut-off events. For 1333/1626 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4244 event pairs, 10 based on Foata normal form. 47/651 useless extension candidates. Maximal degree in co-relation 2163. Up to 215 conditions per place. [2021-03-26 10:04:20,921 INFO L132 encePairwiseOnDemand]: 208/214 looper letters, 15 selfloop transitions, 10 changer transitions 6/58 dead transitions. [2021-03-26 10:04:20,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 58 transitions, 479 flow [2021-03-26 10:04:20,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:04:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:04:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1106 transitions. [2021-03-26 10:04:20,924 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7383177570093458 [2021-03-26 10:04:20,924 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1106 transitions. [2021-03-26 10:04:20,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1106 transitions. [2021-03-26 10:04:20,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:04:20,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1106 transitions. [2021-03-26 10:04:20,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 158.0) internal successors, (1106), 7 states have internal predecessors, (1106), 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 10:04:20,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 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 10:04:20,930 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 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 10:04:20,930 INFO L185 Difference]: Start difference. First operand has 71 places, 50 transitions, 355 flow. Second operand 7 states and 1106 transitions. [2021-03-26 10:04:20,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 58 transitions, 479 flow [2021-03-26 10:04:20,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 58 transitions, 449 flow, removed 8 selfloop flow, removed 5 redundant places. [2021-03-26 10:04:20,941 INFO L241 Difference]: Finished difference. Result has 74 places, 46 transitions, 348 flow [2021-03-26 10:04:20,941 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=348, PETRI_PLACES=74, PETRI_TRANSITIONS=46} [2021-03-26 10:04:20,941 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2021-03-26 10:04:20,941 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:04:20,942 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 46 transitions, 348 flow [2021-03-26 10:04:20,942 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 46 transitions, 348 flow [2021-03-26 10:04:20,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 46 transitions, 348 flow [2021-03-26 10:04:20,962 INFO L129 PetriNetUnfolder]: 113/239 cut-off events. [2021-03-26 10:04:20,962 INFO L130 PetriNetUnfolder]: For 616/780 co-relation queries the response was YES. [2021-03-26 10:04:20,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 239 events. 113/239 cut-off events. For 616/780 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1058 event pairs, 7 based on Foata normal form. 12/232 useless extension candidates. Maximal degree in co-relation 768. Up to 77 conditions per place. [2021-03-26 10:04:20,964 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-26 10:04:21,172 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:04:21,594 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2021-03-26 10:04:21,749 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-03-26 10:04:22,415 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 180 [2021-03-26 10:04:22,704 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:04:23,957 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 304 DAG size of output: 260 [2021-03-26 10:04:24,525 WARN L205 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 257 [2021-03-26 10:04:25,181 WARN L205 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 180 [2021-03-26 10:04:25,451 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:04:26,780 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 304 DAG size of output: 260 [2021-03-26 10:04:27,352 WARN L205 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 257 [2021-03-26 10:04:27,355 INFO L154 LiptonReduction]: Checked pairs total: 51 [2021-03-26 10:04:27,355 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:04:27,356 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6415 [2021-03-26 10:04:27,356 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 45 transitions, 354 flow [2021-03-26 10:04:27,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 states have internal predecessors, (1248), 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 10:04:27,356 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:04:27,357 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 10:04:27,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:04:27,357 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:04:27,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:04:27,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1367582581, now seen corresponding path program 2 times [2021-03-26 10:04:27,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:04:27,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967701432] [2021-03-26 10:04:27,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:04:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:04:27,396 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:04:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:04:27,434 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:04:27,472 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:04:27,474 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:04:27,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 10:04:27,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:04:27 BasicIcfg [2021-03-26 10:04:27,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:04:27,590 INFO L168 Benchmark]: Toolchain (without parser) took 52942.36 ms. Allocated memory was 255.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 233.2 MB in the beginning and 775.2 MB in the end (delta: -542.0 MB). Peak memory consumption was 651.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:04:27,590 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:04:27,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.89 ms. Allocated memory was 255.9 MB in the beginning and 388.0 MB in the end (delta: 132.1 MB). Free memory was 233.2 MB in the beginning and 347.0 MB in the end (delta: -113.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:04:27,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.51 ms. Allocated memory is still 388.0 MB. Free memory was 347.0 MB in the beginning and 344.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:04:27,590 INFO L168 Benchmark]: Boogie Preprocessor took 51.69 ms. Allocated memory is still 388.0 MB. Free memory was 344.5 MB in the beginning and 341.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:04:27,591 INFO L168 Benchmark]: RCFGBuilder took 1974.86 ms. Allocated memory was 388.0 MB in the beginning and 471.9 MB in the end (delta: 83.9 MB). Free memory was 341.9 MB in the beginning and 421.7 MB in the end (delta: -79.8 MB). Peak memory consumption was 64.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:04:27,591 INFO L168 Benchmark]: TraceAbstraction took 50334.62 ms. Allocated memory was 471.9 MB in the beginning and 1.4 GB in the end (delta: 977.3 MB). Free memory was 421.7 MB in the beginning and 775.2 MB in the end (delta: -353.4 MB). Peak memory consumption was 625.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:04:27,592 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.17 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 510.89 ms. Allocated memory was 255.9 MB in the beginning and 388.0 MB in the end (delta: 132.1 MB). Free memory was 233.2 MB in the beginning and 347.0 MB in the end (delta: -113.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 64.51 ms. Allocated memory is still 388.0 MB. Free memory was 347.0 MB in the beginning and 344.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 51.69 ms. Allocated memory is still 388.0 MB. Free memory was 344.5 MB in the beginning and 341.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1974.86 ms. Allocated memory was 388.0 MB in the beginning and 471.9 MB in the end (delta: 83.9 MB). Free memory was 341.9 MB in the beginning and 421.7 MB in the end (delta: -79.8 MB). Peak memory consumption was 64.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 50334.62 ms. Allocated memory was 471.9 MB in the beginning and 1.4 GB in the end (delta: 977.3 MB). Free memory was 421.7 MB in the beginning and 775.2 MB in the end (delta: -353.4 MB). Peak memory consumption was 625.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3724.3ms, 124 PlacesBefore, 57 PlacesAfterwards, 113 TransitionsBefore, 45 TransitionsAfterwards, 2774 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 5523 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2572, positive: 2441, positive conditional: 2441, positive unconditional: 0, negative: 131, negative conditional: 131, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2572, positive: 2441, positive conditional: 0, positive unconditional: 2441, negative: 131, negative conditional: 0, negative unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2572, positive: 2441, positive conditional: 0, positive unconditional: 2441, negative: 131, negative conditional: 0, negative unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1858, positive: 1805, positive conditional: 0, positive unconditional: 1805, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1858, positive: 1795, positive conditional: 0, positive unconditional: 1795, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 736, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 706, negative conditional: 0, negative unconditional: 706, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2572, positive: 636, positive conditional: 0, positive unconditional: 636, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 1858, unknown conditional: 0, unknown unconditional: 1858] , Statistics on independence cache: Total cache size (in pairs): 1858, Positive cache size: 1805, Positive conditional cache size: 0, Positive unconditional cache size: 1805, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1565.8ms, 53 PlacesBefore, 42 PlacesAfterwards, 42 TransitionsBefore, 31 TransitionsAfterwards, 584 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 2511 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 572, positive: 451, positive conditional: 451, positive unconditional: 0, negative: 121, negative conditional: 121, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 572, positive: 451, positive conditional: 27, positive unconditional: 424, negative: 121, negative conditional: 12, negative unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 572, positive: 451, positive conditional: 27, positive unconditional: 424, negative: 121, negative conditional: 12, negative unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 168, positive: 130, positive conditional: 8, positive unconditional: 122, negative: 38, negative conditional: 3, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 168, positive: 127, positive conditional: 0, positive unconditional: 127, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 38, negative conditional: 3, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 414, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 403, negative conditional: 56, negative unconditional: 346, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 572, positive: 321, positive conditional: 19, positive unconditional: 302, negative: 83, negative conditional: 9, negative unconditional: 74, unknown: 168, unknown conditional: 11, unknown unconditional: 157] , Statistics on independence cache: Total cache size (in pairs): 2026, Positive cache size: 1935, Positive conditional cache size: 8, Positive unconditional cache size: 1927, Negative cache size: 91, Negative conditional cache size: 3, Negative unconditional cache size: 88, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1319.2ms, 45 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1542 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 399, positive: 315, positive conditional: 315, positive unconditional: 0, negative: 84, negative conditional: 84, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 399, positive: 315, positive conditional: 0, positive unconditional: 315, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 399, positive: 315, positive conditional: 0, positive unconditional: 315, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 192, negative conditional: 0, negative unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 399, positive: 306, positive conditional: 0, positive unconditional: 306, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 2044, Positive cache size: 1944, Positive conditional cache size: 8, Positive unconditional cache size: 1936, Negative cache size: 100, Negative conditional cache size: 3, Negative unconditional cache size: 97, Eliminated conditions: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 224.5ms, 44 PlacesBefore, 44 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 423 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, positive: 65, positive conditional: 1, positive unconditional: 64, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 65, positive conditional: 1, positive unconditional: 64, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 16, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 117, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, positive: 52, positive conditional: 1, positive unconditional: 51, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 2060, Positive cache size: 1957, Positive conditional cache size: 8, Positive unconditional cache size: 1949, Negative cache size: 103, Negative conditional cache size: 3, Negative unconditional cache size: 100, Eliminated conditions: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1025.8ms, 51 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 864 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 965 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, positive: 166, positive conditional: 166, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, positive: 166, positive conditional: 55, positive unconditional: 111, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, positive: 166, positive conditional: 55, positive unconditional: 111, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 13, positive conditional: 11, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, positive: 153, positive conditional: 44, positive unconditional: 109, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 17, unknown conditional: 11, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 2077, Positive cache size: 1970, Positive conditional cache size: 19, Positive unconditional cache size: 1951, Negative cache size: 107, Negative conditional cache size: 3, Negative unconditional cache size: 104, Eliminated conditions: 57 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 515.9ms, 53 PlacesBefore, 53 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 840 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 505 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, positive: 52, positive conditional: 52, 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: 78, positive: 52, positive conditional: 3, positive unconditional: 49, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 52, positive conditional: 3, positive unconditional: 49, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 78, positive: 50, positive conditional: 3, positive unconditional: 47, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2079, Positive cache size: 1972, Positive conditional cache size: 19, Positive unconditional cache size: 1953, Negative cache size: 107, Negative conditional cache size: 3, Negative unconditional cache size: 104, Eliminated conditions: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 772.3ms, 59 PlacesBefore, 59 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 978 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 826 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 87, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2081, Positive cache size: 1974, Positive conditional cache size: 19, Positive unconditional cache size: 1955, Negative cache size: 107, Negative conditional cache size: 3, Negative unconditional cache size: 104, Eliminated conditions: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1081.8ms, 67 PlacesBefore, 67 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 1420 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2134 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 254, positive: 204, positive conditional: 204, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 287, positive: 204, positive conditional: 34, positive unconditional: 170, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 287, positive: 204, positive conditional: 34, positive unconditional: 170, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 2, positive unconditional: 4, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 287, positive: 198, positive conditional: 32, positive unconditional: 166, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 2087, Positive cache size: 1980, Positive conditional cache size: 21, Positive unconditional cache size: 1959, Negative cache size: 107, Negative conditional cache size: 3, Negative unconditional cache size: 104, Eliminated conditions: 157 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12979.8ms, 68 PlacesBefore, 68 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1800 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 336 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, positive: 81, positive conditional: 81, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, positive: 81, positive conditional: 18, positive unconditional: 63, 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: 93, positive: 81, positive conditional: 18, positive unconditional: 63, 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: 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] , 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: 93, positive: 72, positive conditional: 18, positive unconditional: 54, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 2096, Positive cache size: 1989, Positive conditional cache size: 21, Positive unconditional cache size: 1968, Negative cache size: 107, Negative conditional cache size: 3, Negative unconditional cache size: 104, Eliminated conditions: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4356.5ms, 76 PlacesBefore, 76 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 1954 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): 2096, Positive cache size: 1989, Positive conditional cache size: 21, Positive unconditional cache size: 1968, Negative cache size: 107, Negative conditional cache size: 3, Negative unconditional cache size: 104, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1009.7ms, 82 PlacesBefore, 82 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 2092 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): 2096, Positive cache size: 1989, Positive conditional cache size: 21, Positive unconditional cache size: 1968, Negative cache size: 107, Negative conditional cache size: 3, Negative unconditional cache size: 104, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1158.3ms, 88 PlacesBefore, 88 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 2290 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): 2096, Positive cache size: 1989, Positive conditional cache size: 21, Positive unconditional cache size: 1968, Negative cache size: 107, Negative conditional cache size: 3, Negative unconditional cache size: 104, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1538.5ms, 96 PlacesBefore, 87 PlacesAfterwards, 58 TransitionsBefore, 52 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 134 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, positive: 134, positive conditional: 134, 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: 134, positive: 134, positive conditional: 102, positive unconditional: 32, 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: 134, positive: 134, positive conditional: 102, positive unconditional: 32, 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: 17, positive: 17, positive conditional: 11, positive unconditional: 6, 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: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 134, positive: 117, positive conditional: 91, positive unconditional: 26, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 17, unknown conditional: 11, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 2113, Positive cache size: 2006, Positive conditional cache size: 32, Positive unconditional cache size: 1974, Negative cache size: 107, Negative conditional cache size: 3, Negative unconditional cache size: 104, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 98.2ms, 69 PlacesBefore, 69 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 17 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, positive: 12, positive conditional: 9, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 9, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, 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: 8, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2121, Positive cache size: 2014, Positive conditional cache size: 39, Positive unconditional cache size: 1975, Negative cache size: 107, Negative conditional cache size: 3, Negative unconditional cache size: 104, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47.2ms, 74 PlacesBefore, 71 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 17 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, positive: 12, positive conditional: 9, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 9, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, 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: 13, positive: 12, positive conditional: 9, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2121, Positive cache size: 2014, Positive conditional cache size: 39, Positive unconditional cache size: 1975, Negative cache size: 107, Negative conditional cache size: 3, Negative unconditional cache size: 104, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6413.6ms, 74 PlacesBefore, 71 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 51 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, positive: 51, positive conditional: 51, 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: 51, positive: 51, positive conditional: 40, positive unconditional: 11, 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: 51, positive: 51, positive conditional: 40, positive unconditional: 11, 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: 21, positive: 21, positive conditional: 15, positive unconditional: 6, 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: 21, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 51, positive: 30, positive conditional: 25, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 21, unknown conditional: 15, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 2142, Positive cache size: 2035, Positive conditional cache size: 54, Positive unconditional cache size: 1981, Negative cache size: 107, Negative conditional cache size: 3, Negative unconditional cache size: 104, Eliminated conditions: 11 - 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t797; [L865] FCALL, FORK 0 pthread_create(&t797, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t798; [L867] FCALL, FORK 0 pthread_create(&t798, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t799; [L869] FCALL, FORK 0 pthread_create(&t799, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t800; [L871] FCALL, FORK 0 pthread_create(&t800, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L820] 4 z = 2 [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L831] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L832] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L833] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L834] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L835] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L836] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2] [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L806] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L786] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L877] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __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_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 50051.8ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 10078.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3820.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 123 SDtfs, 80 SDslu, 104 SDs, 0 SdLazy, 578 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 682.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 622.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=943occurred in iteration=11, InterpolantAutomatonStates: 86, 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: 50.9ms SsaConstructionTime, 473.7ms SatisfiabilityAnalysisTime, 1209.6ms InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 1944 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...