/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/mix026_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:01:34,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:01:34,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:01:34,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:01:34,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:01:34,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:01:34,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:01:34,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:01:34,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:01:34,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:01:34,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:01:34,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:01:34,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:01:34,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:01:34,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:01:34,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:01:34,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:01:34,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:01:34,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:01:34,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:01:34,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:01:34,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:01:34,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:01:34,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:01:34,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:01:34,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:01:34,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:01:34,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:01:34,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:01:34,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:01:34,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:01:34,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:01:34,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:01:34,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:01:34,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:01:35,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:01:35,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:01:35,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:01:35,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:01:35,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:01:35,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:01:35,004 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:01:35,038 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:01:35,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:01:35,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:01:35,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:01:35,039 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:01:35,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:01:35,040 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:01:35,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:01:35,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:01:35,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:01:35,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:01:35,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:01:35,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:01:35,041 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:01:35,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:01:35,041 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:01:35,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:01:35,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:01:35,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:01:35,041 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:01:35,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:01:35,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:01:35,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:01:35,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:01:35,042 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:01:35,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:01:35,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:01:35,042 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:01:35,043 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:01:35,043 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:01:35,043 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:01:35,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:01:35,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:01:35,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:01:35,367 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:01:35,368 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:01:35,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_rmo.oepc.i [2021-03-26 10:01:35,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/861cd4223/6c2cddc6a8ee407b9f84ffbb4b02e8cb/FLAG680b5b1b3 [2021-03-26 10:01:36,282 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:01:36,283 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_rmo.oepc.i [2021-03-26 10:01:36,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/861cd4223/6c2cddc6a8ee407b9f84ffbb4b02e8cb/FLAG680b5b1b3 [2021-03-26 10:01:36,453 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/861cd4223/6c2cddc6a8ee407b9f84ffbb4b02e8cb [2021-03-26 10:01:36,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:01:36,457 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:01:36,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:01:36,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:01:36,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:01:36,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:01:36" (1/1) ... [2021-03-26 10:01:36,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190cfb04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:01:36, skipping insertion in model container [2021-03-26 10:01:36,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:01:36" (1/1) ... [2021-03-26 10:01:36,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:01:36,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:01:36,700 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/mix026_rmo.oepc.i[949,962] [2021-03-26 10:01:36,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:01:36,973 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:01:36,984 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/mix026_rmo.oepc.i[949,962] [2021-03-26 10:01:37,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:01:37,089 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:01:37,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:01:37 WrapperNode [2021-03-26 10:01:37,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:01:37,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:01:37,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:01:37,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:01:37,097 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:01:37" (1/1) ... [2021-03-26 10:01:37,128 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:01:37" (1/1) ... [2021-03-26 10:01:37,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:01:37,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:01:37,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:01:37,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:01:37,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:01:37" (1/1) ... [2021-03-26 10:01:37,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:01:37" (1/1) ... [2021-03-26 10:01:37,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:01:37" (1/1) ... [2021-03-26 10:01:37,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:01:37" (1/1) ... [2021-03-26 10:01:37,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:01:37" (1/1) ... [2021-03-26 10:01:37,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:01:37" (1/1) ... [2021-03-26 10:01:37,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:01:37" (1/1) ... [2021-03-26 10:01:37,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:01:37,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:01:37,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:01:37,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:01:37,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:01:37" (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:01:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:01:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:01:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:01:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:01:37,294 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:01:37,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:01:37,296 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:01:37,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:01:37,296 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:01:37,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:01:37,296 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:01:37,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:01:37,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:01:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:01:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:01:37,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:01:37,299 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:01:39,000 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:01:39,000 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:01:39,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:01:39 BoogieIcfgContainer [2021-03-26 10:01:39,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:01:39,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:01:39,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:01:39,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:01:39,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:01:36" (1/3) ... [2021-03-26 10:01:39,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173f8f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:01:39, skipping insertion in model container [2021-03-26 10:01:39,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:01:37" (2/3) ... [2021-03-26 10:01:39,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173f8f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:01:39, skipping insertion in model container [2021-03-26 10:01:39,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:01:39" (3/3) ... [2021-03-26 10:01:39,007 INFO L111 eAbstractionObserver]: Analyzing ICFG mix026_rmo.oepc.i [2021-03-26 10:01:39,012 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:01:39,015 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:01:39,016 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:01:39,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,045 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,046 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,046 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,046 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,046 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,046 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,047 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,047 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,050 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,050 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,051 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,051 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,053 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,053 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,054 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,054 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,056 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,057 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,057 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,057 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,057 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,061 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,061 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,061 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,062 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,062 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,062 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,063 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,063 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,063 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,063 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,063 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,063 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,063 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,063 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,063 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,063 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,063 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,063 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,064 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,065 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,065 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,065 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,065 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,065 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,065 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,065 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,065 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,065 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,065 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,067 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,067 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,067 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,067 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,067 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,067 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,067 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,068 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,068 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,068 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,068 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,068 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,068 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,068 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,069 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,069 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,069 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,069 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,071 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,071 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,072 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,073 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,073 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,075 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,075 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,082 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,083 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:01:39,087 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:01:39,102 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:01:39,115 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:01:39,115 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:01:39,115 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:01:39,115 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:01:39,115 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:01:39,116 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:01:39,116 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:01:39,116 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:01:39,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow [2021-03-26 10:01:39,157 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-26 10:01:39,157 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:01:39,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-26 10:01:39,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 118 transitions, 256 flow [2021-03-26 10:01:39,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 114 transitions, 240 flow [2021-03-26 10:01:39,165 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:39,175 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-26 10:01:39,177 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-26 10:01:39,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 240 flow [2021-03-26 10:01:39,197 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-26 10:01:39,197 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:01:39,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 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/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-26 10:01:39,200 INFO L142 LiptonReduction]: Number of co-enabled transitions 2774 [2021-03-26 10:01:40,641 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:01:41,039 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:01:41,141 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:01:42,504 INFO L154 LiptonReduction]: Checked pairs total: 4931 [2021-03-26 10:01:42,504 INFO L156 LiptonReduction]: Total number of compositions: 72 [2021-03-26 10:01:42,509 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3345 [2021-03-26 10:01:42,522 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-26 10:01:42,522 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:01:42,523 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:42,523 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:42,524 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:01:42,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:42,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1169704059, now seen corresponding path program 1 times [2021-03-26 10:01:42,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:42,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426447773] [2021-03-26 10:01:42,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:42,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:42,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:42,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:42,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:42,794 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:01:42,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426447773] [2021-03-26 10:01:42,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:42,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:01:42,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596371967] [2021-03-26 10:01:42,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:01:42,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:42,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:01:42,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:01:42,816 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 190 [2021-03-26 10:01:42,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 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:01:42,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:42,821 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 190 [2021-03-26 10:01:42,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:42,968 INFO L129 PetriNetUnfolder]: 133/370 cut-off events. [2021-03-26 10:01:42,968 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:01:42,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 370 events. 133/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2058 event pairs, 110 based on Foata normal form. 32/373 useless extension candidates. Maximal degree in co-relation 567. Up to 153 conditions per place. [2021-03-26 10:01:42,975 INFO L132 encePairwiseOnDemand]: 186/190 looper letters, 11 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2021-03-26 10:01:42,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 50 transitions, 138 flow [2021-03-26 10:01:42,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:01:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:01:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2021-03-26 10:01:42,995 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9175438596491228 [2021-03-26 10:01:42,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2021-03-26 10:01:42,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2021-03-26 10:01:42,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:43,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2021-03-26 10:01:43,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 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:01:43,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 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:01:43,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 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:01:43,016 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 3 states and 523 transitions. [2021-03-26 10:01:43,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 50 transitions, 138 flow [2021-03-26 10:01:43,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:01:43,020 INFO L241 Difference]: Finished difference. Result has 56 places, 45 transitions, 102 flow [2021-03-26 10:01:43,022 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2021-03-26 10:01:43,022 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-26 10:01:43,023 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:43,023 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 102 flow [2021-03-26 10:01:43,024 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 102 flow [2021-03-26 10:01:43,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 102 flow [2021-03-26 10:01:43,030 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2021-03-26 10:01:43,031 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:01:43,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 45 events. 0/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:01:43,033 INFO L142 LiptonReduction]: Number of co-enabled transitions 618 [2021-03-26 10:01:44,188 INFO L154 LiptonReduction]: Checked pairs total: 2547 [2021-03-26 10:01:44,188 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 10:01:44,189 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1167 [2021-03-26 10:01:44,190 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 78 flow [2021-03-26 10:01:44,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 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:01:44,190 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:44,190 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:01:44,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:01:44,190 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:01:44,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:44,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1873331778, now seen corresponding path program 1 times [2021-03-26 10:01:44,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:44,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763929652] [2021-03-26 10:01:44,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:44,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:44,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:44,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:44,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:44,276 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 10:01:44,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:01:44,289 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:01:44,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:01:44,294 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:01:44,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763929652] [2021-03-26 10:01:44,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:44,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:01:44,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163576691] [2021-03-26 10:01:44,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:01:44,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:44,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:01:44,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:01:44,298 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 203 [2021-03-26 10:01:44,299 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 0 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:01:44,299 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:44,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 203 [2021-03-26 10:01:44,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:44,409 INFO L129 PetriNetUnfolder]: 177/428 cut-off events. [2021-03-26 10:01:44,409 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:01:44,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 428 events. 177/428 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2431 event pairs, 25 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 719. Up to 97 conditions per place. [2021-03-26 10:01:44,411 INFO L132 encePairwiseOnDemand]: 195/203 looper letters, 9 selfloop transitions, 6 changer transitions 17/54 dead transitions. [2021-03-26 10:01:44,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 182 flow [2021-03-26 10:01:44,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:01:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:01:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1181 transitions. [2021-03-26 10:01:44,415 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8311048557353976 [2021-03-26 10:01:44,415 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1181 transitions. [2021-03-26 10:01:44,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1181 transitions. [2021-03-26 10:01:44,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:44,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1181 transitions. [2021-03-26 10:01:44,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.71428571428572) internal successors, (1181), 7 states have internal predecessors, (1181), 0 states have call successors, (0), 0 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:01:44,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:01:44,421 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:01:44,421 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 78 flow. Second operand 7 states and 1181 transitions. [2021-03-26 10:01:44,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 182 flow [2021-03-26 10:01:44,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:01:44,423 INFO L241 Difference]: Finished difference. Result has 53 places, 35 transitions, 122 flow [2021-03-26 10:01:44,423 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=122, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2021-03-26 10:01:44,423 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2021-03-26 10:01:44,423 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:44,424 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 35 transitions, 122 flow [2021-03-26 10:01:44,424 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 35 transitions, 122 flow [2021-03-26 10:01:44,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 35 transitions, 122 flow [2021-03-26 10:01:44,452 INFO L129 PetriNetUnfolder]: 62/206 cut-off events. [2021-03-26 10:01:44,453 INFO L130 PetriNetUnfolder]: For 70/96 co-relation queries the response was YES. [2021-03-26 10:01:44,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 206 events. 62/206 cut-off events. For 70/96 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1053 event pairs, 34 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 430. Up to 93 conditions per place. [2021-03-26 10:01:44,456 INFO L142 LiptonReduction]: Number of co-enabled transitions 506 [2021-03-26 10:01:45,180 WARN L205 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 10:01:45,367 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 10:01:45,735 WARN L205 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 10:01:45,884 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 10:01:45,893 INFO L154 LiptonReduction]: Checked pairs total: 1215 [2021-03-26 10:01:45,893 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:01:45,893 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1470 [2021-03-26 10:01:45,894 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 118 flow [2021-03-26 10:01:45,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 0 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:01:45,895 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:45,895 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:45,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:01:45,895 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:01:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1109141042, now seen corresponding path program 1 times [2021-03-26 10:01:45,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:45,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090707687] [2021-03-26 10:01:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:45,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:45,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:45,996 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:01:45,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:01:46,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:46,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:46,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090707687] [2021-03-26 10:01:46,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:46,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:01:46,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132258148] [2021-03-26 10:01:46,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:01:46,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:46,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:01:46,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:01:46,010 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 205 [2021-03-26 10:01:46,011 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 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:01:46,011 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:46,011 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 205 [2021-03-26 10:01:46,011 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:46,197 INFO L129 PetriNetUnfolder]: 643/1189 cut-off events. [2021-03-26 10:01:46,197 INFO L130 PetriNetUnfolder]: For 135/161 co-relation queries the response was YES. [2021-03-26 10:01:46,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2514 conditions, 1189 events. 643/1189 cut-off events. For 135/161 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 8201 event pairs, 314 based on Foata normal form. 72/1019 useless extension candidates. Maximal degree in co-relation 2500. Up to 793 conditions per place. [2021-03-26 10:01:46,210 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 12 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2021-03-26 10:01:46,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 190 flow [2021-03-26 10:01:46,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:01:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:01:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 884 transitions. [2021-03-26 10:01:46,213 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8624390243902439 [2021-03-26 10:01:46,213 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 884 transitions. [2021-03-26 10:01:46,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 884 transitions. [2021-03-26 10:01:46,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:46,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 884 transitions. [2021-03-26 10:01:46,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:46,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:01:46,219 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:01:46,219 INFO L185 Difference]: Start difference. First operand has 46 places, 33 transitions, 118 flow. Second operand 5 states and 884 transitions. [2021-03-26 10:01:46,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 190 flow [2021-03-26 10:01:46,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 180 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-26 10:01:46,223 INFO L241 Difference]: Finished difference. Result has 50 places, 42 transitions, 183 flow [2021-03-26 10:01:46,224 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2021-03-26 10:01:46,224 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -10 predicate places. [2021-03-26 10:01:46,224 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:46,224 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 183 flow [2021-03-26 10:01:46,225 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 183 flow [2021-03-26 10:01:46,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 183 flow [2021-03-26 10:01:46,341 INFO L129 PetriNetUnfolder]: 485/954 cut-off events. [2021-03-26 10:01:46,341 INFO L130 PetriNetUnfolder]: For 490/754 co-relation queries the response was YES. [2021-03-26 10:01:46,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 954 events. 485/954 cut-off events. For 490/754 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 6531 event pairs, 226 based on Foata normal form. 3/821 useless extension candidates. Maximal degree in co-relation 2589. Up to 634 conditions per place. [2021-03-26 10:01:46,353 INFO L142 LiptonReduction]: Number of co-enabled transitions 740 [2021-03-26 10:01:46,610 INFO L154 LiptonReduction]: Checked pairs total: 850 [2021-03-26 10:01:46,610 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:01:46,610 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 386 [2021-03-26 10:01:46,613 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 177 flow [2021-03-26 10:01:46,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 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:01:46,613 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:46,614 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:01:46,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:01:46,615 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:01:46,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash 756030734, now seen corresponding path program 1 times [2021-03-26 10:01:46,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:46,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694398324] [2021-03-26 10:01:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:46,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:46,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:46,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:46,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:46,707 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 10:01:46,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:01:46,717 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:01:46,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694398324] [2021-03-26 10:01:46,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:46,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:01:46,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775138320] [2021-03-26 10:01:46,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:01:46,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:46,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:01:46,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:01:46,720 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 205 [2021-03-26 10:01:46,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:46,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:46,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 205 [2021-03-26 10:01:46,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:46,871 INFO L129 PetriNetUnfolder]: 587/1157 cut-off events. [2021-03-26 10:01:46,872 INFO L130 PetriNetUnfolder]: For 957/1353 co-relation queries the response was YES. [2021-03-26 10:01:46,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 1157 events. 587/1157 cut-off events. For 957/1353 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 8152 event pairs, 294 based on Foata normal form. 48/1076 useless extension candidates. Maximal degree in co-relation 3315. Up to 711 conditions per place. [2021-03-26 10:01:46,885 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 13 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2021-03-26 10:01:46,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 228 flow [2021-03-26 10:01:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:01:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:01:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2021-03-26 10:01:46,888 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8463414634146341 [2021-03-26 10:01:46,888 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 694 transitions. [2021-03-26 10:01:46,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 694 transitions. [2021-03-26 10:01:46,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:46,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 694 transitions. [2021-03-26 10:01:46,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.5) internal successors, (694), 4 states have internal predecessors, (694), 0 states have call successors, (0), 0 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:01:46,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 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:01:46,892 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 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:01:46,892 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 177 flow. Second operand 4 states and 694 transitions. [2021-03-26 10:01:46,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 228 flow [2021-03-26 10:01:46,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 221 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:01:46,901 INFO L241 Difference]: Finished difference. Result has 51 places, 42 transitions, 195 flow [2021-03-26 10:01:46,902 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2021-03-26 10:01:46,902 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2021-03-26 10:01:46,902 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:46,902 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 195 flow [2021-03-26 10:01:46,902 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 42 transitions, 195 flow [2021-03-26 10:01:46,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 195 flow [2021-03-26 10:01:47,003 INFO L129 PetriNetUnfolder]: 562/1105 cut-off events. [2021-03-26 10:01:47,003 INFO L130 PetriNetUnfolder]: For 646/815 co-relation queries the response was YES. [2021-03-26 10:01:47,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 1105 events. 562/1105 cut-off events. For 646/815 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 7667 event pairs, 302 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 2944. Up to 738 conditions per place. [2021-03-26 10:01:47,022 INFO L142 LiptonReduction]: Number of co-enabled transitions 676 [2021-03-26 10:01:47,251 INFO L154 LiptonReduction]: Checked pairs total: 732 [2021-03-26 10:01:47,251 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:01:47,251 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 349 [2021-03-26 10:01:47,252 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 201 flow [2021-03-26 10:01:47,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:47,253 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:47,253 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:47,253 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:01:47,254 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:01:47,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:47,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1929780815, now seen corresponding path program 1 times [2021-03-26 10:01:47,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:47,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040386669] [2021-03-26 10:01:47,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:47,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:47,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:47,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:47,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:47,367 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:01:47,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:01:47,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:47,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:47,374 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:01:47,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040386669] [2021-03-26 10:01:47,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:47,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:01:47,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418060047] [2021-03-26 10:01:47,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:01:47,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:47,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:01:47,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:01:47,378 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 207 [2021-03-26 10:01:47,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 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:01:47,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:47,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 207 [2021-03-26 10:01:47,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:47,544 INFO L129 PetriNetUnfolder]: 624/1227 cut-off events. [2021-03-26 10:01:47,544 INFO L130 PetriNetUnfolder]: For 1000/1959 co-relation queries the response was YES. [2021-03-26 10:01:47,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4189 conditions, 1227 events. 624/1227 cut-off events. For 1000/1959 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 8537 event pairs, 83 based on Foata normal form. 181/1289 useless extension candidates. Maximal degree in co-relation 4171. Up to 848 conditions per place. [2021-03-26 10:01:47,602 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 13 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2021-03-26 10:01:47,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 335 flow [2021-03-26 10:01:47,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:01:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:01:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1073 transitions. [2021-03-26 10:01:47,606 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8639291465378421 [2021-03-26 10:01:47,606 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1073 transitions. [2021-03-26 10:01:47,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1073 transitions. [2021-03-26 10:01:47,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:47,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1073 transitions. [2021-03-26 10:01:47,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 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:01:47,612 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:01:47,613 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:01:47,613 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 201 flow. Second operand 6 states and 1073 transitions. [2021-03-26 10:01:47,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 335 flow [2021-03-26 10:01:47,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 329 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-26 10:01:47,617 INFO L241 Difference]: Finished difference. Result has 59 places, 51 transitions, 315 flow [2021-03-26 10:01:47,617 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2021-03-26 10:01:47,618 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2021-03-26 10:01:47,618 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:47,618 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 315 flow [2021-03-26 10:01:47,618 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 315 flow [2021-03-26 10:01:47,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 315 flow [2021-03-26 10:01:47,705 INFO L129 PetriNetUnfolder]: 421/922 cut-off events. [2021-03-26 10:01:47,706 INFO L130 PetriNetUnfolder]: For 1839/2327 co-relation queries the response was YES. [2021-03-26 10:01:47,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 922 events. 421/922 cut-off events. For 1839/2327 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 6521 event pairs, 82 based on Foata normal form. 22/881 useless extension candidates. Maximal degree in co-relation 3797. Up to 648 conditions per place. [2021-03-26 10:01:47,722 INFO L142 LiptonReduction]: Number of co-enabled transitions 932 [2021-03-26 10:01:48,063 INFO L154 LiptonReduction]: Checked pairs total: 1023 [2021-03-26 10:01:48,064 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:01:48,064 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 446 [2021-03-26 10:01:48,065 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 307 flow [2021-03-26 10:01:48,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 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:01:48,065 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:48,066 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:48,066 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:01:48,066 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:01:48,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1708921396, now seen corresponding path program 1 times [2021-03-26 10:01:48,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:48,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563614572] [2021-03-26 10:01:48,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:48,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:48,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:48,182 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-26 10:01:48,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:01:48,199 INFO L142 QuantifierPusher]: treesize reduction 24, result has 63.6 percent of original size [2021-03-26 10:01:48,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 10:01:48,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:48,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:01:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:48,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563614572] [2021-03-26 10:01:48,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:48,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:01:48,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693315084] [2021-03-26 10:01:48,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:01:48,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:48,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:01:48,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:01:48,224 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 207 [2021-03-26 10:01:48,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 0 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:01:48,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:48,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 207 [2021-03-26 10:01:48,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:48,492 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L826-->L842: Formula: (let ((.cse31 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse20 (= (mod v_~a$r_buff0_thd4~0_236 256) 0)) (.cse25 (= (mod v_~a$r_buff1_thd4~0_185 256) 0))) (let ((.cse2 (= (mod v_~weak$$choice2~0_86 256) 0)) (.cse26 (not .cse25)) (.cse7 (not .cse20)) (.cse18 (= (mod v_~a$w_buff0_used~0_483 256) 0)) (.cse4 (and .cse31 .cse20)) (.cse3 (= (mod v_~a$w_buff0_used~0_484 256) 0)) (.cse19 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (let ((.cse14 (not .cse19)) (.cse6 (not .cse3)) (.cse8 (or .cse3 .cse20)) (.cse13 (or (and .cse20 .cse25) .cse3 .cse4)) (.cse16 (or .cse18 .cse20)) (.cse15 (not .cse18)) (.cse9 (or (not .cse31) .cse7)) (.cse10 (or .cse26 .cse7)) (.cse5 (and .cse25 .cse20)) (.cse1 (not .cse2))) (and (let ((.cse0 (= |v_P3_#t~ite33_57| |v_P3Thread1of1ForFork3_#t~ite33_1|))) (or (and .cse0 (= |v_P3_#t~ite34_47| |v_P3Thread1of1ForFork3_#t~ite34_1|) .cse1 (= v_~a$w_buff0_used~0_484 v_~a$w_buff0_used~0_483)) (and .cse2 (= |v_P3_#t~ite34_47| v_~a$w_buff0_used~0_483) (or (and .cse0 (= |v_P3_#t~ite34_47| v_~a$w_buff0_used~0_484) (or .cse3 .cse4 .cse5)) (and (= |v_P3_#t~ite33_57| |v_P3_#t~ite34_47|) .cse6 (or (and .cse7 (= |v_P3_#t~ite33_57| 0) .cse6) (and (= |v_P3_#t~ite33_57| v_~a$w_buff0_used~0_484) .cse8)) .cse9 .cse10))))) (let ((.cse11 (= |v_P3Thread1of1ForFork3_#t~ite30_1| |v_P3_#t~ite30_43|))) (or (and .cse11 .cse1 (= |v_P3Thread1of1ForFork3_#t~ite31_1| |v_P3_#t~ite31_37|) (= v_~a$w_buff1~0_113 v_~a$w_buff1~0_112)) (and (= |v_P3_#t~ite31_37| v_~a$w_buff1~0_112) .cse2 (or (and (let ((.cse12 (= |v_P3_#t~ite30_43| v_~a$w_buff1~0_113))) (or (and .cse7 .cse12 .cse6) (and .cse12 .cse8))) .cse6 (= |v_P3_#t~ite30_43| |v_P3_#t~ite31_37|) .cse9 .cse10) (and .cse11 .cse13 (= |v_P3_#t~ite31_37| v_~a$w_buff1~0_113)))))) (let ((.cse17 (= |v_P3_#t~ite39_61| |v_P3Thread1of1ForFork3_#t~ite39_1|))) (or (and .cse2 (= |v_P3_#t~ite40_55| v_~a$r_buff0_thd4~0_235) (or (and (or .cse7 .cse14) .cse15 .cse10 (= |v_P3_#t~ite39_61| |v_P3_#t~ite40_55|) (or (and (= |v_P3_#t~ite39_61| v_~a$r_buff0_thd4~0_236) .cse16) (and (= |v_P3_#t~ite39_61| 0) .cse15 .cse7))) (and .cse17 (or .cse18 (and .cse19 .cse20) .cse5) (= |v_P3_#t~ite40_55| v_~a$r_buff0_thd4~0_236)))) (and (= v_~a$r_buff0_thd4~0_236 v_~a$r_buff0_thd4~0_235) .cse17 (= |v_P3_#t~ite40_55| |v_P3Thread1of1ForFork3_#t~ite40_1|) .cse1))) (let ((.cse21 (= |v_P3_#t~ite27_63| |v_P3Thread1of1ForFork3_#t~ite27_1|))) (or (and .cse21 .cse1 (= |v_P3_#t~ite28_53| |v_P3Thread1of1ForFork3_#t~ite28_1|) (= v_~a$w_buff0~0_104 v_~a$w_buff0~0_103)) (and .cse2 (= |v_P3_#t~ite28_53| v_~a$w_buff0~0_103) (or (and .cse21 (= |v_P3_#t~ite28_53| v_~a$w_buff0~0_104) .cse13) (and (let ((.cse22 (= |v_P3_#t~ite27_63| v_~a$w_buff0~0_104))) (or (and .cse22 .cse8) (and .cse22 .cse7 .cse6))) .cse6 .cse9 .cse10 (= |v_P3_#t~ite27_63| |v_P3_#t~ite28_53|)))))) (= v_~a~0_180 v_~a$mem_tmp~0_22) (let ((.cse23 (= |v_P3_#t~ite42_57| |v_P3Thread1of1ForFork3_#t~ite42_1|))) (or (and .cse23 (= v_~a$r_buff1_thd4~0_185 v_~a$r_buff1_thd4~0_184) .cse1 (= |v_P3_#t~ite43_47| |v_P3Thread1of1ForFork3_#t~ite43_1|)) (and (= |v_P3_#t~ite43_47| v_~a$r_buff1_thd4~0_184) .cse2 (let ((.cse24 (= (mod v_~a$r_buff0_thd4~0_235 256) 0))) (or (and .cse23 (= |v_P3_#t~ite43_47| v_~a$r_buff1_thd4~0_185) (or (and .cse24 .cse25) .cse18 (and .cse19 .cse24))) (let ((.cse27 (not .cse24))) (and (or .cse26 .cse27) .cse15 (let ((.cse28 (= |v_P3_#t~ite42_57| 0))) (or (and .cse15 .cse27 .cse28) (and (or .cse18 .cse24) .cse28))) (or .cse27 .cse14) (= |v_P3_#t~ite42_57| |v_P3_#t~ite43_47|)))))))) (or (and (= |v_P3_#t~ite25_45| v_~__unbuffered_p3_EBX~0_14) .cse6 (or (and (= |v_P3_#t~ite25_45| v_~a$w_buff0~0_104) .cse7 .cse6) (and (= |v_P3_#t~ite25_45| v_~a$w_buff1~0_113) .cse8)) .cse9 .cse10) (and (= |v_P3_#t~ite25_45| |v_P3Thread1of1ForFork3_#t~ite25_1|) (= v_~a~0_180 v_~__unbuffered_p3_EBX~0_14) .cse13)) (= |v_P3Thread1of1ForFork3_#t~nondet23_1| v_~weak$$choice0~0_13) (= |v_P3Thread1of1ForFork3_#t~nondet24_1| v_~weak$$choice2~0_86) (= v_~a$flush_delayed~0_38 0) (let ((.cse30 (= |v_P3_#t~ite36_49| |v_P3Thread1of1ForFork3_#t~ite36_1|))) (or (and .cse2 (= |v_P3_#t~ite37_43| v_~a$w_buff1_used~0_371) (or (and .cse15 (let ((.cse29 (= |v_P3_#t~ite36_49| 0))) (or (and .cse29 .cse16) (and .cse29 .cse15 .cse7))) (= |v_P3_#t~ite36_49| |v_P3_#t~ite37_43|) .cse9 .cse10) (and (= |v_P3_#t~ite37_43| v_~a$w_buff1_used~0_372) (or .cse18 .cse4 .cse5) .cse30))) (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse1 .cse30 (= |v_P3_#t~ite37_43| |v_P3Thread1of1ForFork3_#t~ite37_1|)))) (or (and .cse1 (= v_~a~0_178 v_~a$mem_tmp~0_22)) (and .cse2 (= v_~a~0_178 v_~__unbuffered_p3_EBX~0_14))))))) InVars {P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_1|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_1|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_1|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_185, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_484, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_236, ~a~0=v_~a~0_180, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_1|, ~a$w_buff1~0=v_~a$w_buff1~0_113, ~a$w_buff0~0=v_~a$w_buff0~0_104, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_1|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_1|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_1|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_184, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_235, ~a~0=v_~a~0_178, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_112, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_2|, P3Thread1of1ForFork3_#t~ite38=|v_P3Thread1of1ForFork3_#t~ite38_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_2|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_2|, P3Thread1of1ForFork3_#t~ite35=|v_P3Thread1of1ForFork3_#t~ite35_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_2|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_2|, P3Thread1of1ForFork3_#t~ite32=|v_P3Thread1of1ForFork3_#t~ite32_1|, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_2|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_2|, P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_2|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_2|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_2|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_2|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_1|, P3Thread1of1ForFork3_#t~ite45=|v_P3Thread1of1ForFork3_#t~ite45_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_483, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_13, P3Thread1of1ForFork3_#t~ite29=|v_P3Thread1of1ForFork3_#t~ite29_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_2|, ~a$flush_delayed~0=v_~a$flush_delayed~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_103, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_2|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_2|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, ~weak$$choice2~0=v_~weak$$choice2~0_86, P3Thread1of1ForFork3_#t~ite41=|v_P3Thread1of1ForFork3_#t~ite41_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_2|} AuxVars[|v_P3_#t~ite27_63|, |v_P3_#t~ite28_53|, |v_P3_#t~ite36_49|, |v_P3_#t~ite34_47|, |v_P3_#t~ite33_57|, |v_P3_#t~ite25_45|, |v_P3_#t~ite30_43|, |v_P3_#t~ite31_37|, |v_P3_#t~ite39_61|, |v_P3_#t~ite42_57|, |v_P3_#t~ite43_47|, |v_P3_#t~ite40_55|, |v_P3_#t~ite37_43|] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~a$w_buff1~0, P3Thread1of1ForFork3_#t~ite39, P3Thread1of1ForFork3_#t~ite38, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#t~ite36, P3Thread1of1ForFork3_#t~ite35, P3Thread1of1ForFork3_#t~ite34, P3Thread1of1ForFork3_#t~ite33, P3Thread1of1ForFork3_#t~ite32, P3Thread1of1ForFork3_#t~ite31, P3Thread1of1ForFork3_#t~ite30, P3Thread1of1ForFork3_#t~nondet23, P3Thread1of1ForFork3_#t~nondet24, P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, P3Thread1of1ForFork3_#t~ite45, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28, ~a$flush_delayed~0, ~a$w_buff0~0, P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~ite41, P3Thread1of1ForFork3_#t~ite40][36], [P2Thread1of1ForFork2InUse, Black: 157#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, 164#(= ~z~0 1), P3Thread1of1ForFork3InUse, Black: 165#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 137#true, 107#L813true, 171#(= ~__unbuffered_cnt~0 0), Black: 172#(<= ~__unbuffered_cnt~0 1), 49#L842true, Black: 173#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 175#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 139#(= ~__unbuffered_p3_EAX~0 0), 180#true, Black: 140#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 24#L766true, 56#L793true, 154#(= ~__unbuffered_cnt~0 0), 59#L873-1true, P0Thread1of1ForFork0InUse]) [2021-03-26 10:01:48,492 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 10:01:48,493 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 10:01:48,493 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 10:01:48,493 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 10:01:48,730 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L826-->L842: Formula: (let ((.cse31 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse20 (= (mod v_~a$r_buff0_thd4~0_236 256) 0)) (.cse25 (= (mod v_~a$r_buff1_thd4~0_185 256) 0))) (let ((.cse2 (= (mod v_~weak$$choice2~0_86 256) 0)) (.cse26 (not .cse25)) (.cse7 (not .cse20)) (.cse18 (= (mod v_~a$w_buff0_used~0_483 256) 0)) (.cse4 (and .cse31 .cse20)) (.cse3 (= (mod v_~a$w_buff0_used~0_484 256) 0)) (.cse19 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (let ((.cse14 (not .cse19)) (.cse6 (not .cse3)) (.cse8 (or .cse3 .cse20)) (.cse13 (or (and .cse20 .cse25) .cse3 .cse4)) (.cse16 (or .cse18 .cse20)) (.cse15 (not .cse18)) (.cse9 (or (not .cse31) .cse7)) (.cse10 (or .cse26 .cse7)) (.cse5 (and .cse25 .cse20)) (.cse1 (not .cse2))) (and (let ((.cse0 (= |v_P3_#t~ite33_57| |v_P3Thread1of1ForFork3_#t~ite33_1|))) (or (and .cse0 (= |v_P3_#t~ite34_47| |v_P3Thread1of1ForFork3_#t~ite34_1|) .cse1 (= v_~a$w_buff0_used~0_484 v_~a$w_buff0_used~0_483)) (and .cse2 (= |v_P3_#t~ite34_47| v_~a$w_buff0_used~0_483) (or (and .cse0 (= |v_P3_#t~ite34_47| v_~a$w_buff0_used~0_484) (or .cse3 .cse4 .cse5)) (and (= |v_P3_#t~ite33_57| |v_P3_#t~ite34_47|) .cse6 (or (and .cse7 (= |v_P3_#t~ite33_57| 0) .cse6) (and (= |v_P3_#t~ite33_57| v_~a$w_buff0_used~0_484) .cse8)) .cse9 .cse10))))) (let ((.cse11 (= |v_P3Thread1of1ForFork3_#t~ite30_1| |v_P3_#t~ite30_43|))) (or (and .cse11 .cse1 (= |v_P3Thread1of1ForFork3_#t~ite31_1| |v_P3_#t~ite31_37|) (= v_~a$w_buff1~0_113 v_~a$w_buff1~0_112)) (and (= |v_P3_#t~ite31_37| v_~a$w_buff1~0_112) .cse2 (or (and (let ((.cse12 (= |v_P3_#t~ite30_43| v_~a$w_buff1~0_113))) (or (and .cse7 .cse12 .cse6) (and .cse12 .cse8))) .cse6 (= |v_P3_#t~ite30_43| |v_P3_#t~ite31_37|) .cse9 .cse10) (and .cse11 .cse13 (= |v_P3_#t~ite31_37| v_~a$w_buff1~0_113)))))) (let ((.cse17 (= |v_P3_#t~ite39_61| |v_P3Thread1of1ForFork3_#t~ite39_1|))) (or (and .cse2 (= |v_P3_#t~ite40_55| v_~a$r_buff0_thd4~0_235) (or (and (or .cse7 .cse14) .cse15 .cse10 (= |v_P3_#t~ite39_61| |v_P3_#t~ite40_55|) (or (and (= |v_P3_#t~ite39_61| v_~a$r_buff0_thd4~0_236) .cse16) (and (= |v_P3_#t~ite39_61| 0) .cse15 .cse7))) (and .cse17 (or .cse18 (and .cse19 .cse20) .cse5) (= |v_P3_#t~ite40_55| v_~a$r_buff0_thd4~0_236)))) (and (= v_~a$r_buff0_thd4~0_236 v_~a$r_buff0_thd4~0_235) .cse17 (= |v_P3_#t~ite40_55| |v_P3Thread1of1ForFork3_#t~ite40_1|) .cse1))) (let ((.cse21 (= |v_P3_#t~ite27_63| |v_P3Thread1of1ForFork3_#t~ite27_1|))) (or (and .cse21 .cse1 (= |v_P3_#t~ite28_53| |v_P3Thread1of1ForFork3_#t~ite28_1|) (= v_~a$w_buff0~0_104 v_~a$w_buff0~0_103)) (and .cse2 (= |v_P3_#t~ite28_53| v_~a$w_buff0~0_103) (or (and .cse21 (= |v_P3_#t~ite28_53| v_~a$w_buff0~0_104) .cse13) (and (let ((.cse22 (= |v_P3_#t~ite27_63| v_~a$w_buff0~0_104))) (or (and .cse22 .cse8) (and .cse22 .cse7 .cse6))) .cse6 .cse9 .cse10 (= |v_P3_#t~ite27_63| |v_P3_#t~ite28_53|)))))) (= v_~a~0_180 v_~a$mem_tmp~0_22) (let ((.cse23 (= |v_P3_#t~ite42_57| |v_P3Thread1of1ForFork3_#t~ite42_1|))) (or (and .cse23 (= v_~a$r_buff1_thd4~0_185 v_~a$r_buff1_thd4~0_184) .cse1 (= |v_P3_#t~ite43_47| |v_P3Thread1of1ForFork3_#t~ite43_1|)) (and (= |v_P3_#t~ite43_47| v_~a$r_buff1_thd4~0_184) .cse2 (let ((.cse24 (= (mod v_~a$r_buff0_thd4~0_235 256) 0))) (or (and .cse23 (= |v_P3_#t~ite43_47| v_~a$r_buff1_thd4~0_185) (or (and .cse24 .cse25) .cse18 (and .cse19 .cse24))) (let ((.cse27 (not .cse24))) (and (or .cse26 .cse27) .cse15 (let ((.cse28 (= |v_P3_#t~ite42_57| 0))) (or (and .cse15 .cse27 .cse28) (and (or .cse18 .cse24) .cse28))) (or .cse27 .cse14) (= |v_P3_#t~ite42_57| |v_P3_#t~ite43_47|)))))))) (or (and (= |v_P3_#t~ite25_45| v_~__unbuffered_p3_EBX~0_14) .cse6 (or (and (= |v_P3_#t~ite25_45| v_~a$w_buff0~0_104) .cse7 .cse6) (and (= |v_P3_#t~ite25_45| v_~a$w_buff1~0_113) .cse8)) .cse9 .cse10) (and (= |v_P3_#t~ite25_45| |v_P3Thread1of1ForFork3_#t~ite25_1|) (= v_~a~0_180 v_~__unbuffered_p3_EBX~0_14) .cse13)) (= |v_P3Thread1of1ForFork3_#t~nondet23_1| v_~weak$$choice0~0_13) (= |v_P3Thread1of1ForFork3_#t~nondet24_1| v_~weak$$choice2~0_86) (= v_~a$flush_delayed~0_38 0) (let ((.cse30 (= |v_P3_#t~ite36_49| |v_P3Thread1of1ForFork3_#t~ite36_1|))) (or (and .cse2 (= |v_P3_#t~ite37_43| v_~a$w_buff1_used~0_371) (or (and .cse15 (let ((.cse29 (= |v_P3_#t~ite36_49| 0))) (or (and .cse29 .cse16) (and .cse29 .cse15 .cse7))) (= |v_P3_#t~ite36_49| |v_P3_#t~ite37_43|) .cse9 .cse10) (and (= |v_P3_#t~ite37_43| v_~a$w_buff1_used~0_372) (or .cse18 .cse4 .cse5) .cse30))) (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse1 .cse30 (= |v_P3_#t~ite37_43| |v_P3Thread1of1ForFork3_#t~ite37_1|)))) (or (and .cse1 (= v_~a~0_178 v_~a$mem_tmp~0_22)) (and .cse2 (= v_~a~0_178 v_~__unbuffered_p3_EBX~0_14))))))) InVars {P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_1|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_1|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_1|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_185, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_484, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_236, ~a~0=v_~a~0_180, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_1|, ~a$w_buff1~0=v_~a$w_buff1~0_113, ~a$w_buff0~0=v_~a$w_buff0~0_104, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_1|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_1|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_1|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_184, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_235, ~a~0=v_~a~0_178, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_112, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_2|, P3Thread1of1ForFork3_#t~ite38=|v_P3Thread1of1ForFork3_#t~ite38_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_2|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_2|, P3Thread1of1ForFork3_#t~ite35=|v_P3Thread1of1ForFork3_#t~ite35_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_2|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_2|, P3Thread1of1ForFork3_#t~ite32=|v_P3Thread1of1ForFork3_#t~ite32_1|, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_2|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_2|, P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_2|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_2|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_2|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_2|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_1|, P3Thread1of1ForFork3_#t~ite45=|v_P3Thread1of1ForFork3_#t~ite45_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_483, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_13, P3Thread1of1ForFork3_#t~ite29=|v_P3Thread1of1ForFork3_#t~ite29_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_2|, ~a$flush_delayed~0=v_~a$flush_delayed~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_103, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_2|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_2|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, ~weak$$choice2~0=v_~weak$$choice2~0_86, P3Thread1of1ForFork3_#t~ite41=|v_P3Thread1of1ForFork3_#t~ite41_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_2|} AuxVars[|v_P3_#t~ite27_63|, |v_P3_#t~ite28_53|, |v_P3_#t~ite36_49|, |v_P3_#t~ite34_47|, |v_P3_#t~ite33_57|, |v_P3_#t~ite25_45|, |v_P3_#t~ite30_43|, |v_P3_#t~ite31_37|, |v_P3_#t~ite39_61|, |v_P3_#t~ite42_57|, |v_P3_#t~ite43_47|, |v_P3_#t~ite40_55|, |v_P3_#t~ite37_43|] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~a$w_buff1~0, P3Thread1of1ForFork3_#t~ite39, P3Thread1of1ForFork3_#t~ite38, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#t~ite36, P3Thread1of1ForFork3_#t~ite35, P3Thread1of1ForFork3_#t~ite34, P3Thread1of1ForFork3_#t~ite33, P3Thread1of1ForFork3_#t~ite32, P3Thread1of1ForFork3_#t~ite31, P3Thread1of1ForFork3_#t~ite30, P3Thread1of1ForFork3_#t~nondet23, P3Thread1of1ForFork3_#t~nondet24, P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, P3Thread1of1ForFork3_#t~ite45, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28, ~a$flush_delayed~0, ~a$w_buff0~0, P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~ite41, P3Thread1of1ForFork3_#t~ite40][36], [P2Thread1of1ForFork2InUse, Black: 157#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, 164#(= ~z~0 1), Black: 165#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 169#true, 137#true, 49#L842true, Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 173#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 175#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 139#(= ~__unbuffered_p3_EAX~0 0), 180#true, Black: 140#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 54#P2EXITtrue, 57#L884true, 122#L786true, P0Thread1of1ForFork0InUse, 63#P0EXITtrue, Black: 154#(= ~__unbuffered_cnt~0 0)]) [2021-03-26 10:01:48,730 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 10:01:48,730 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:01:48,731 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 10:01:48,731 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:01:48,738 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L826-->L842: Formula: (let ((.cse31 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse20 (= (mod v_~a$r_buff0_thd4~0_236 256) 0)) (.cse25 (= (mod v_~a$r_buff1_thd4~0_185 256) 0))) (let ((.cse2 (= (mod v_~weak$$choice2~0_86 256) 0)) (.cse26 (not .cse25)) (.cse7 (not .cse20)) (.cse18 (= (mod v_~a$w_buff0_used~0_483 256) 0)) (.cse4 (and .cse31 .cse20)) (.cse3 (= (mod v_~a$w_buff0_used~0_484 256) 0)) (.cse19 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (let ((.cse14 (not .cse19)) (.cse6 (not .cse3)) (.cse8 (or .cse3 .cse20)) (.cse13 (or (and .cse20 .cse25) .cse3 .cse4)) (.cse16 (or .cse18 .cse20)) (.cse15 (not .cse18)) (.cse9 (or (not .cse31) .cse7)) (.cse10 (or .cse26 .cse7)) (.cse5 (and .cse25 .cse20)) (.cse1 (not .cse2))) (and (let ((.cse0 (= |v_P3_#t~ite33_57| |v_P3Thread1of1ForFork3_#t~ite33_1|))) (or (and .cse0 (= |v_P3_#t~ite34_47| |v_P3Thread1of1ForFork3_#t~ite34_1|) .cse1 (= v_~a$w_buff0_used~0_484 v_~a$w_buff0_used~0_483)) (and .cse2 (= |v_P3_#t~ite34_47| v_~a$w_buff0_used~0_483) (or (and .cse0 (= |v_P3_#t~ite34_47| v_~a$w_buff0_used~0_484) (or .cse3 .cse4 .cse5)) (and (= |v_P3_#t~ite33_57| |v_P3_#t~ite34_47|) .cse6 (or (and .cse7 (= |v_P3_#t~ite33_57| 0) .cse6) (and (= |v_P3_#t~ite33_57| v_~a$w_buff0_used~0_484) .cse8)) .cse9 .cse10))))) (let ((.cse11 (= |v_P3Thread1of1ForFork3_#t~ite30_1| |v_P3_#t~ite30_43|))) (or (and .cse11 .cse1 (= |v_P3Thread1of1ForFork3_#t~ite31_1| |v_P3_#t~ite31_37|) (= v_~a$w_buff1~0_113 v_~a$w_buff1~0_112)) (and (= |v_P3_#t~ite31_37| v_~a$w_buff1~0_112) .cse2 (or (and (let ((.cse12 (= |v_P3_#t~ite30_43| v_~a$w_buff1~0_113))) (or (and .cse7 .cse12 .cse6) (and .cse12 .cse8))) .cse6 (= |v_P3_#t~ite30_43| |v_P3_#t~ite31_37|) .cse9 .cse10) (and .cse11 .cse13 (= |v_P3_#t~ite31_37| v_~a$w_buff1~0_113)))))) (let ((.cse17 (= |v_P3_#t~ite39_61| |v_P3Thread1of1ForFork3_#t~ite39_1|))) (or (and .cse2 (= |v_P3_#t~ite40_55| v_~a$r_buff0_thd4~0_235) (or (and (or .cse7 .cse14) .cse15 .cse10 (= |v_P3_#t~ite39_61| |v_P3_#t~ite40_55|) (or (and (= |v_P3_#t~ite39_61| v_~a$r_buff0_thd4~0_236) .cse16) (and (= |v_P3_#t~ite39_61| 0) .cse15 .cse7))) (and .cse17 (or .cse18 (and .cse19 .cse20) .cse5) (= |v_P3_#t~ite40_55| v_~a$r_buff0_thd4~0_236)))) (and (= v_~a$r_buff0_thd4~0_236 v_~a$r_buff0_thd4~0_235) .cse17 (= |v_P3_#t~ite40_55| |v_P3Thread1of1ForFork3_#t~ite40_1|) .cse1))) (let ((.cse21 (= |v_P3_#t~ite27_63| |v_P3Thread1of1ForFork3_#t~ite27_1|))) (or (and .cse21 .cse1 (= |v_P3_#t~ite28_53| |v_P3Thread1of1ForFork3_#t~ite28_1|) (= v_~a$w_buff0~0_104 v_~a$w_buff0~0_103)) (and .cse2 (= |v_P3_#t~ite28_53| v_~a$w_buff0~0_103) (or (and .cse21 (= |v_P3_#t~ite28_53| v_~a$w_buff0~0_104) .cse13) (and (let ((.cse22 (= |v_P3_#t~ite27_63| v_~a$w_buff0~0_104))) (or (and .cse22 .cse8) (and .cse22 .cse7 .cse6))) .cse6 .cse9 .cse10 (= |v_P3_#t~ite27_63| |v_P3_#t~ite28_53|)))))) (= v_~a~0_180 v_~a$mem_tmp~0_22) (let ((.cse23 (= |v_P3_#t~ite42_57| |v_P3Thread1of1ForFork3_#t~ite42_1|))) (or (and .cse23 (= v_~a$r_buff1_thd4~0_185 v_~a$r_buff1_thd4~0_184) .cse1 (= |v_P3_#t~ite43_47| |v_P3Thread1of1ForFork3_#t~ite43_1|)) (and (= |v_P3_#t~ite43_47| v_~a$r_buff1_thd4~0_184) .cse2 (let ((.cse24 (= (mod v_~a$r_buff0_thd4~0_235 256) 0))) (or (and .cse23 (= |v_P3_#t~ite43_47| v_~a$r_buff1_thd4~0_185) (or (and .cse24 .cse25) .cse18 (and .cse19 .cse24))) (let ((.cse27 (not .cse24))) (and (or .cse26 .cse27) .cse15 (let ((.cse28 (= |v_P3_#t~ite42_57| 0))) (or (and .cse15 .cse27 .cse28) (and (or .cse18 .cse24) .cse28))) (or .cse27 .cse14) (= |v_P3_#t~ite42_57| |v_P3_#t~ite43_47|)))))))) (or (and (= |v_P3_#t~ite25_45| v_~__unbuffered_p3_EBX~0_14) .cse6 (or (and (= |v_P3_#t~ite25_45| v_~a$w_buff0~0_104) .cse7 .cse6) (and (= |v_P3_#t~ite25_45| v_~a$w_buff1~0_113) .cse8)) .cse9 .cse10) (and (= |v_P3_#t~ite25_45| |v_P3Thread1of1ForFork3_#t~ite25_1|) (= v_~a~0_180 v_~__unbuffered_p3_EBX~0_14) .cse13)) (= |v_P3Thread1of1ForFork3_#t~nondet23_1| v_~weak$$choice0~0_13) (= |v_P3Thread1of1ForFork3_#t~nondet24_1| v_~weak$$choice2~0_86) (= v_~a$flush_delayed~0_38 0) (let ((.cse30 (= |v_P3_#t~ite36_49| |v_P3Thread1of1ForFork3_#t~ite36_1|))) (or (and .cse2 (= |v_P3_#t~ite37_43| v_~a$w_buff1_used~0_371) (or (and .cse15 (let ((.cse29 (= |v_P3_#t~ite36_49| 0))) (or (and .cse29 .cse16) (and .cse29 .cse15 .cse7))) (= |v_P3_#t~ite36_49| |v_P3_#t~ite37_43|) .cse9 .cse10) (and (= |v_P3_#t~ite37_43| v_~a$w_buff1_used~0_372) (or .cse18 .cse4 .cse5) .cse30))) (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse1 .cse30 (= |v_P3_#t~ite37_43| |v_P3Thread1of1ForFork3_#t~ite37_1|)))) (or (and .cse1 (= v_~a~0_178 v_~a$mem_tmp~0_22)) (and .cse2 (= v_~a~0_178 v_~__unbuffered_p3_EBX~0_14))))))) InVars {P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_1|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_1|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_1|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_185, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_484, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_236, ~a~0=v_~a~0_180, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_1|, ~a$w_buff1~0=v_~a$w_buff1~0_113, ~a$w_buff0~0=v_~a$w_buff0~0_104, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_1|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_1|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_1|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_184, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_235, ~a~0=v_~a~0_178, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_112, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_2|, P3Thread1of1ForFork3_#t~ite38=|v_P3Thread1of1ForFork3_#t~ite38_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_2|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_2|, P3Thread1of1ForFork3_#t~ite35=|v_P3Thread1of1ForFork3_#t~ite35_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_2|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_2|, P3Thread1of1ForFork3_#t~ite32=|v_P3Thread1of1ForFork3_#t~ite32_1|, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_2|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_2|, P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_2|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_2|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_2|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_2|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_1|, P3Thread1of1ForFork3_#t~ite45=|v_P3Thread1of1ForFork3_#t~ite45_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_483, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_13, P3Thread1of1ForFork3_#t~ite29=|v_P3Thread1of1ForFork3_#t~ite29_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_2|, ~a$flush_delayed~0=v_~a$flush_delayed~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_103, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_2|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_2|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, ~weak$$choice2~0=v_~weak$$choice2~0_86, P3Thread1of1ForFork3_#t~ite41=|v_P3Thread1of1ForFork3_#t~ite41_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_2|} AuxVars[|v_P3_#t~ite27_63|, |v_P3_#t~ite28_53|, |v_P3_#t~ite36_49|, |v_P3_#t~ite34_47|, |v_P3_#t~ite33_57|, |v_P3_#t~ite25_45|, |v_P3_#t~ite30_43|, |v_P3_#t~ite31_37|, |v_P3_#t~ite39_61|, |v_P3_#t~ite42_57|, |v_P3_#t~ite43_47|, |v_P3_#t~ite40_55|, |v_P3_#t~ite37_43|] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~a$w_buff1~0, P3Thread1of1ForFork3_#t~ite39, P3Thread1of1ForFork3_#t~ite38, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#t~ite36, P3Thread1of1ForFork3_#t~ite35, P3Thread1of1ForFork3_#t~ite34, P3Thread1of1ForFork3_#t~ite33, P3Thread1of1ForFork3_#t~ite32, P3Thread1of1ForFork3_#t~ite31, P3Thread1of1ForFork3_#t~ite30, P3Thread1of1ForFork3_#t~nondet23, P3Thread1of1ForFork3_#t~nondet24, P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, P3Thread1of1ForFork3_#t~ite45, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28, ~a$flush_delayed~0, ~a$w_buff0~0, P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~ite41, P3Thread1of1ForFork3_#t~ite40][36], [P2Thread1of1ForFork2InUse, Black: 157#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, 164#(= ~z~0 1), P3Thread1of1ForFork3InUse, Black: 165#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 137#true, 169#true, 11#P1EXITtrue, 49#L842true, Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 173#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 175#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 180#true, Black: 139#(= ~__unbuffered_p3_EAX~0 0), Black: 140#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 54#P2EXITtrue, 24#L766true, 57#L884true, P0Thread1of1ForFork0InUse, Black: 154#(= ~__unbuffered_cnt~0 0)]) [2021-03-26 10:01:48,739 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 10:01:48,739 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 10:01:48,739 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 10:01:48,739 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:01:48,898 INFO L129 PetriNetUnfolder]: 1896/3643 cut-off events. [2021-03-26 10:01:48,899 INFO L130 PetriNetUnfolder]: For 7318/8399 co-relation queries the response was YES. [2021-03-26 10:01:48,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13501 conditions, 3643 events. 1896/3643 cut-off events. For 7318/8399 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 28489 event pairs, 462 based on Foata normal form. 133/3483 useless extension candidates. Maximal degree in co-relation 13478. Up to 1677 conditions per place. [2021-03-26 10:01:48,948 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 11 selfloop transitions, 17 changer transitions 5/69 dead transitions. [2021-03-26 10:01:48,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 427 flow [2021-03-26 10:01:48,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:01:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:01:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1022 transitions. [2021-03-26 10:01:48,950 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.822866344605475 [2021-03-26 10:01:48,951 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1022 transitions. [2021-03-26 10:01:48,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1022 transitions. [2021-03-26 10:01:48,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:48,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1022 transitions. [2021-03-26 10:01:48,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 170.33333333333334) internal successors, (1022), 6 states have internal predecessors, (1022), 0 states have call successors, (0), 0 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:01:48,956 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:01:48,956 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:01:48,956 INFO L185 Difference]: Start difference. First operand has 59 places, 50 transitions, 307 flow. Second operand 6 states and 1022 transitions. [2021-03-26 10:01:48,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 427 flow [2021-03-26 10:01:49,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 373 flow, removed 22 selfloop flow, removed 4 redundant places. [2021-03-26 10:01:49,021 INFO L241 Difference]: Finished difference. Result has 61 places, 62 transitions, 345 flow [2021-03-26 10:01:49,022 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2021-03-26 10:01:49,022 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2021-03-26 10:01:49,022 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:49,022 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 62 transitions, 345 flow [2021-03-26 10:01:49,022 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 62 transitions, 345 flow [2021-03-26 10:01:49,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 62 transitions, 345 flow [2021-03-26 10:01:49,427 INFO L129 PetriNetUnfolder]: 1551/3228 cut-off events. [2021-03-26 10:01:49,427 INFO L130 PetriNetUnfolder]: For 3818/4424 co-relation queries the response was YES. [2021-03-26 10:01:49,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9826 conditions, 3228 events. 1551/3228 cut-off events. For 3818/4424 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 26940 event pairs, 377 based on Foata normal form. 104/3111 useless extension candidates. Maximal degree in co-relation 9805. Up to 1416 conditions per place. [2021-03-26 10:01:49,483 INFO L142 LiptonReduction]: Number of co-enabled transitions 1192 [2021-03-26 10:01:51,322 INFO L154 LiptonReduction]: Checked pairs total: 277 [2021-03-26 10:01:51,322 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:01:51,323 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2301 [2021-03-26 10:01:51,323 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 348 flow [2021-03-26 10:01:51,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 0 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:01:51,324 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:51,324 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:51,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:01:51,324 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:01:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:51,325 INFO L82 PathProgramCache]: Analyzing trace with hash -742739514, now seen corresponding path program 2 times [2021-03-26 10:01:51,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:51,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721626399] [2021-03-26 10:01:51,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:51,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:51,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:51,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:51,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:51,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:51,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:51,447 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:01:51,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:01:51,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:51,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:51,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721626399] [2021-03-26 10:01:51,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:51,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:01:51,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62860153] [2021-03-26 10:01:51,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:01:51,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:51,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:01:51,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:01:51,460 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 208 [2021-03-26 10:01:51,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 348 flow. Second operand has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 0 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:01:51,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:51,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 208 [2021-03-26 10:01:51,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:51,909 INFO L129 PetriNetUnfolder]: 1876/3643 cut-off events. [2021-03-26 10:01:51,909 INFO L130 PetriNetUnfolder]: For 5100/11182 co-relation queries the response was YES. [2021-03-26 10:01:51,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12464 conditions, 3643 events. 1876/3643 cut-off events. For 5100/11182 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 29497 event pairs, 120 based on Foata normal form. 1033/4110 useless extension candidates. Maximal degree in co-relation 12441. Up to 1825 conditions per place. [2021-03-26 10:01:51,950 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 12 selfloop transitions, 18 changer transitions 4/78 dead transitions. [2021-03-26 10:01:51,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 524 flow [2021-03-26 10:01:51,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:01:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:01:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1259 transitions. [2021-03-26 10:01:51,953 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8646978021978022 [2021-03-26 10:01:51,953 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1259 transitions. [2021-03-26 10:01:51,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1259 transitions. [2021-03-26 10:01:51,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:51,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1259 transitions. [2021-03-26 10:01:51,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 0 states have call successors, (0), 0 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:01:51,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 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:01:51,960 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 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:01:51,960 INFO L185 Difference]: Start difference. First operand has 61 places, 62 transitions, 348 flow. Second operand 7 states and 1259 transitions. [2021-03-26 10:01:51,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 524 flow [2021-03-26 10:01:51,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 517 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:01:51,983 INFO L241 Difference]: Finished difference. Result has 69 places, 71 transitions, 487 flow [2021-03-26 10:01:51,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=487, PETRI_PLACES=69, PETRI_TRANSITIONS=71} [2021-03-26 10:01:51,984 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2021-03-26 10:01:51,984 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:51,984 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 71 transitions, 487 flow [2021-03-26 10:01:51,984 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 71 transitions, 487 flow [2021-03-26 10:01:51,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 71 transitions, 487 flow [2021-03-26 10:01:52,238 INFO L129 PetriNetUnfolder]: 1119/2464 cut-off events. [2021-03-26 10:01:52,239 INFO L130 PetriNetUnfolder]: For 5386/6426 co-relation queries the response was YES. [2021-03-26 10:01:52,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9635 conditions, 2464 events. 1119/2464 cut-off events. For 5386/6426 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 20258 event pairs, 122 based on Foata normal form. 32/2303 useless extension candidates. Maximal degree in co-relation 9610. Up to 1312 conditions per place. [2021-03-26 10:01:52,284 INFO L142 LiptonReduction]: Number of co-enabled transitions 1340 [2021-03-26 10:01:52,320 INFO L154 LiptonReduction]: Checked pairs total: 134 [2021-03-26 10:01:52,320 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:01:52,321 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 337 [2021-03-26 10:01:52,325 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 71 transitions, 487 flow [2021-03-26 10:01:52,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 0 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:01:52,325 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:52,326 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:01:52,326 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:01:52,326 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:01:52,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:52,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1794909071, now seen corresponding path program 1 times [2021-03-26 10:01:52,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:52,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647632328] [2021-03-26 10:01:52,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:52,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:52,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:52,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:52,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:52,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:52,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:52,445 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 10:01:52,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:01:52,458 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:01:52,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647632328] [2021-03-26 10:01:52,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:52,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:01:52,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093934577] [2021-03-26 10:01:52,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:01:52,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:01:52,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:01:52,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 208 [2021-03-26 10:01:52,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 71 transitions, 487 flow. Second operand has 5 states, 5 states have (on average 165.4) internal successors, (827), 5 states have internal predecessors, (827), 0 states have call successors, (0), 0 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:01:52,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:52,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 208 [2021-03-26 10:01:52,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:52,976 INFO L129 PetriNetUnfolder]: 1662/3953 cut-off events. [2021-03-26 10:01:52,977 INFO L130 PetriNetUnfolder]: For 8801/9800 co-relation queries the response was YES. [2021-03-26 10:01:52,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15608 conditions, 3953 events. 1662/3953 cut-off events. For 8801/9800 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 37133 event pairs, 134 based on Foata normal form. 65/3781 useless extension candidates. Maximal degree in co-relation 15581. Up to 1974 conditions per place. [2021-03-26 10:01:53,005 INFO L132 encePairwiseOnDemand]: 197/208 looper letters, 29 selfloop transitions, 26 changer transitions 5/109 dead transitions. [2021-03-26 10:01:53,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 109 transitions, 868 flow [2021-03-26 10:01:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:01:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:01:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1024 transitions. [2021-03-26 10:01:53,008 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2021-03-26 10:01:53,008 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1024 transitions. [2021-03-26 10:01:53,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1024 transitions. [2021-03-26 10:01:53,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:53,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1024 transitions. [2021-03-26 10:01:53,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 170.66666666666666) internal successors, (1024), 6 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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:01:53,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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:01:53,013 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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:01:53,014 INFO L185 Difference]: Start difference. First operand has 69 places, 71 transitions, 487 flow. Second operand 6 states and 1024 transitions. [2021-03-26 10:01:53,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 109 transitions, 868 flow [2021-03-26 10:01:53,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 109 transitions, 794 flow, removed 26 selfloop flow, removed 3 redundant places. [2021-03-26 10:01:53,224 INFO L241 Difference]: Finished difference. Result has 74 places, 89 transitions, 639 flow [2021-03-26 10:01:53,224 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=74, PETRI_TRANSITIONS=89} [2021-03-26 10:01:53,224 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2021-03-26 10:01:53,225 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:53,225 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 89 transitions, 639 flow [2021-03-26 10:01:53,225 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 89 transitions, 639 flow [2021-03-26 10:01:53,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 89 transitions, 639 flow [2021-03-26 10:01:53,549 INFO L129 PetriNetUnfolder]: 1743/4109 cut-off events. [2021-03-26 10:01:53,549 INFO L130 PetriNetUnfolder]: For 5583/5842 co-relation queries the response was YES. [2021-03-26 10:01:53,613 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12955 conditions, 4109 events. 1743/4109 cut-off events. For 5583/5842 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 39622 event pairs, 189 based on Foata normal form. 28/3924 useless extension candidates. Maximal degree in co-relation 12927. Up to 1057 conditions per place. [2021-03-26 10:01:53,644 INFO L142 LiptonReduction]: Number of co-enabled transitions 1822 [2021-03-26 10:01:53,734 INFO L154 LiptonReduction]: Checked pairs total: 225 [2021-03-26 10:01:53,734 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:01:53,734 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 509 [2021-03-26 10:01:53,735 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 89 transitions, 639 flow [2021-03-26 10:01:53,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.4) internal successors, (827), 5 states have internal predecessors, (827), 0 states have call successors, (0), 0 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:01:53,735 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:53,735 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:01:53,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:01:53,736 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:01:53,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:53,736 INFO L82 PathProgramCache]: Analyzing trace with hash -207729491, now seen corresponding path program 2 times [2021-03-26 10:01:53,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:53,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516556252] [2021-03-26 10:01:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:53,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:53,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:01:53,826 INFO L142 QuantifierPusher]: treesize reduction 5, result has 89.6 percent of original size [2021-03-26 10:01:53,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-26 10:01:53,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:53,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 10:01:53,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:53,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:01:53,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:53,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:01:53,879 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:01:53,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516556252] [2021-03-26 10:01:53,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:53,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:01:53,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647346032] [2021-03-26 10:01:53,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:01:53,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:53,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:01:53,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:01:53,881 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 208 [2021-03-26 10:01:53,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 89 transitions, 639 flow. Second operand has 7 states, 7 states have (on average 154.14285714285714) internal successors, (1079), 7 states have internal predecessors, (1079), 0 states have call successors, (0), 0 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:01:53,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:53,883 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 208 [2021-03-26 10:01:53,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:54,545 INFO L129 PetriNetUnfolder]: 2425/5624 cut-off events. [2021-03-26 10:01:54,545 INFO L130 PetriNetUnfolder]: For 9700/11098 co-relation queries the response was YES. [2021-03-26 10:01:54,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19368 conditions, 5624 events. 2425/5624 cut-off events. For 9700/11098 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 55528 event pairs, 153 based on Foata normal form. 331/5641 useless extension candidates. Maximal degree in co-relation 19338. Up to 1529 conditions per place. [2021-03-26 10:01:54,576 INFO L132 encePairwiseOnDemand]: 199/208 looper letters, 27 selfloop transitions, 26 changer transitions 3/116 dead transitions. [2021-03-26 10:01:54,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 116 transitions, 935 flow [2021-03-26 10:01:54,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:01:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:01:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1107 transitions. [2021-03-26 10:01:54,580 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7603021978021978 [2021-03-26 10:01:54,580 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1107 transitions. [2021-03-26 10:01:54,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1107 transitions. [2021-03-26 10:01:54,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:54,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1107 transitions. [2021-03-26 10:01:54,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 158.14285714285714) internal successors, (1107), 7 states have internal predecessors, (1107), 0 states have call successors, (0), 0 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:01:54,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 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:01:54,587 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 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:01:54,587 INFO L185 Difference]: Start difference. First operand has 74 places, 89 transitions, 639 flow. Second operand 7 states and 1107 transitions. [2021-03-26 10:01:54,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 116 transitions, 935 flow [2021-03-26 10:01:54,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 116 transitions, 931 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-26 10:01:54,790 INFO L241 Difference]: Finished difference. Result has 84 places, 101 transitions, 822 flow [2021-03-26 10:01:54,791 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=822, PETRI_PLACES=84, PETRI_TRANSITIONS=101} [2021-03-26 10:01:54,791 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 24 predicate places. [2021-03-26 10:01:54,791 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:54,791 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 101 transitions, 822 flow [2021-03-26 10:01:54,791 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 101 transitions, 822 flow [2021-03-26 10:01:54,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 101 transitions, 822 flow [2021-03-26 10:01:55,275 INFO L129 PetriNetUnfolder]: 2420/5595 cut-off events. [2021-03-26 10:01:55,275 INFO L130 PetriNetUnfolder]: For 11707/12511 co-relation queries the response was YES. [2021-03-26 10:01:55,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19770 conditions, 5595 events. 2420/5595 cut-off events. For 11707/12511 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 56314 event pairs, 210 based on Foata normal form. 103/5385 useless extension candidates. Maximal degree in co-relation 19736. Up to 1570 conditions per place. [2021-03-26 10:01:55,359 INFO L142 LiptonReduction]: Number of co-enabled transitions 2102 [2021-03-26 10:01:55,521 INFO L154 LiptonReduction]: Checked pairs total: 250 [2021-03-26 10:01:55,521 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:01:55,521 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 730 [2021-03-26 10:01:55,522 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 101 transitions, 822 flow [2021-03-26 10:01:55,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 154.14285714285714) internal successors, (1079), 7 states have internal predecessors, (1079), 0 states have call successors, (0), 0 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:01:55,523 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:55,524 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:01:55,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:01:55,524 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:01:55,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:55,524 INFO L82 PathProgramCache]: Analyzing trace with hash -376778168, now seen corresponding path program 1 times [2021-03-26 10:01:55,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:55,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903141565] [2021-03-26 10:01:55,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:55,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:55,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:01:55,619 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-26 10:01:55,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 10:01:55,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:55,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:01:55,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:55,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:01:55,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:55,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:55,672 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:01:55,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903141565] [2021-03-26 10:01:55,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:55,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:01:55,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128641178] [2021-03-26 10:01:55,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:01:55,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:55,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:01:55,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:01:55,675 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 208 [2021-03-26 10:01:55,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 101 transitions, 822 flow. Second operand has 7 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:01:55,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:55,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 208 [2021-03-26 10:01:55,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:56,445 INFO L129 PetriNetUnfolder]: 2915/6715 cut-off events. [2021-03-26 10:01:56,445 INFO L130 PetriNetUnfolder]: For 18327/20341 co-relation queries the response was YES. [2021-03-26 10:01:56,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25525 conditions, 6715 events. 2915/6715 cut-off events. For 18327/20341 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 68296 event pairs, 190 based on Foata normal form. 525/6883 useless extension candidates. Maximal degree in co-relation 25489. Up to 1935 conditions per place. [2021-03-26 10:01:56,491 INFO L132 encePairwiseOnDemand]: 200/208 looper letters, 41 selfloop transitions, 22 changer transitions 2/125 dead transitions. [2021-03-26 10:01:56,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 125 transitions, 1178 flow [2021-03-26 10:01:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:01:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:01:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1115 transitions. [2021-03-26 10:01:56,495 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7657967032967034 [2021-03-26 10:01:56,495 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1115 transitions. [2021-03-26 10:01:56,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1115 transitions. [2021-03-26 10:01:56,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:56,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1115 transitions. [2021-03-26 10:01:56,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.28571428571428) internal successors, (1115), 7 states have internal predecessors, (1115), 0 states have call successors, (0), 0 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:01:56,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 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:01:56,501 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 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:01:56,501 INFO L185 Difference]: Start difference. First operand has 84 places, 101 transitions, 822 flow. Second operand 7 states and 1115 transitions. [2021-03-26 10:01:56,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 125 transitions, 1178 flow [2021-03-26 10:01:56,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 125 transitions, 1172 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-26 10:01:56,849 INFO L241 Difference]: Finished difference. Result has 93 places, 112 transitions, 1014 flow [2021-03-26 10:01:56,850 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1014, PETRI_PLACES=93, PETRI_TRANSITIONS=112} [2021-03-26 10:01:56,850 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 33 predicate places. [2021-03-26 10:01:56,850 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:56,850 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 112 transitions, 1014 flow [2021-03-26 10:01:56,850 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 112 transitions, 1014 flow [2021-03-26 10:01:56,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 112 transitions, 1014 flow [2021-03-26 10:01:57,412 INFO L129 PetriNetUnfolder]: 3029/6861 cut-off events. [2021-03-26 10:01:57,412 INFO L130 PetriNetUnfolder]: For 18919/19961 co-relation queries the response was YES. [2021-03-26 10:01:57,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25512 conditions, 6861 events. 3029/6861 cut-off events. For 18919/19961 co-relation queries the response was YES. Maximal size of possible extension queue 841. Compared 70554 event pairs, 188 based on Foata normal form. 133/6631 useless extension candidates. Maximal degree in co-relation 25473. Up to 2007 conditions per place. [2021-03-26 10:01:57,504 INFO L142 LiptonReduction]: Number of co-enabled transitions 2304 [2021-03-26 10:01:57,788 INFO L154 LiptonReduction]: Checked pairs total: 275 [2021-03-26 10:01:57,788 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:01:57,788 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 938 [2021-03-26 10:01:57,789 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 112 transitions, 1014 flow [2021-03-26 10:01:57,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 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:01:57,789 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:57,789 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:01:57,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:01:57,789 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:01:57,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:57,790 INFO L82 PathProgramCache]: Analyzing trace with hash -199570247, now seen corresponding path program 3 times [2021-03-26 10:01:57,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:57,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115935595] [2021-03-26 10:01:57,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:57,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:57,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:57,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:57,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:57,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:57,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:57,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:57,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:57,869 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:01:57,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:01:57,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:57,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:57,877 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:01:57,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115935595] [2021-03-26 10:01:57,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:57,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:01:57,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501996043] [2021-03-26 10:01:57,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:01:57,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:57,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:01:57,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:01:57,879 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 208 [2021-03-26 10:01:57,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 112 transitions, 1014 flow. Second operand has 7 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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:01:57,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:57,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 208 [2021-03-26 10:01:57,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:58,974 INFO L129 PetriNetUnfolder]: 5442/10621 cut-off events. [2021-03-26 10:01:58,974 INFO L130 PetriNetUnfolder]: For 26337/38117 co-relation queries the response was YES. [2021-03-26 10:01:59,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41326 conditions, 10621 events. 5442/10621 cut-off events. For 26337/38117 co-relation queries the response was YES. Maximal size of possible extension queue 1572. Compared 103113 event pairs, 154 based on Foata normal form. 2207/11361 useless extension candidates. Maximal degree in co-relation 41285. Up to 3341 conditions per place. [2021-03-26 10:01:59,067 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 7 selfloop transitions, 23 changer transitions 9/118 dead transitions. [2021-03-26 10:01:59,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 118 transitions, 1103 flow [2021-03-26 10:01:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:01:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:01:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1611 transitions. [2021-03-26 10:01:59,071 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8605769230769231 [2021-03-26 10:01:59,071 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1611 transitions. [2021-03-26 10:01:59,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1611 transitions. [2021-03-26 10:01:59,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:59,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1611 transitions. [2021-03-26 10:01:59,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 0 states have call successors, (0), 0 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:01:59,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 208.0) internal successors, (2080), 10 states have internal predecessors, (2080), 0 states have call successors, (0), 0 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:01:59,078 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 208.0) internal successors, (2080), 10 states have internal predecessors, (2080), 0 states have call successors, (0), 0 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:01:59,078 INFO L185 Difference]: Start difference. First operand has 93 places, 112 transitions, 1014 flow. Second operand 9 states and 1611 transitions. [2021-03-26 10:01:59,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 118 transitions, 1103 flow [2021-03-26 10:01:59,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 118 transitions, 1072 flow, removed 11 selfloop flow, removed 2 redundant places. [2021-03-26 10:01:59,913 INFO L241 Difference]: Finished difference. Result has 102 places, 106 transitions, 958 flow [2021-03-26 10:01:59,913 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=958, PETRI_PLACES=102, PETRI_TRANSITIONS=106} [2021-03-26 10:01:59,913 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 42 predicate places. [2021-03-26 10:01:59,913 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:59,914 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 106 transitions, 958 flow [2021-03-26 10:01:59,914 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 106 transitions, 958 flow [2021-03-26 10:01:59,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 106 transitions, 958 flow [2021-03-26 10:02:00,490 INFO L129 PetriNetUnfolder]: 2651/6338 cut-off events. [2021-03-26 10:02:00,491 INFO L130 PetriNetUnfolder]: For 17077/18583 co-relation queries the response was YES. [2021-03-26 10:02:00,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26801 conditions, 6338 events. 2651/6338 cut-off events. For 17077/18583 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 67550 event pairs, 120 based on Foata normal form. 92/6101 useless extension candidates. Maximal degree in co-relation 26759. Up to 1793 conditions per place. [2021-03-26 10:02:00,558 INFO L142 LiptonReduction]: Number of co-enabled transitions 2200 [2021-03-26 10:02:00,850 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:02:00,975 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:02:01,247 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:02:01,384 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:02:01,436 INFO L154 LiptonReduction]: Checked pairs total: 490 [2021-03-26 10:02:01,437 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:02:01,437 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1524 [2021-03-26 10:02:01,437 INFO L480 AbstractCegarLoop]: Abstraction has has 100 places, 105 transitions, 966 flow [2021-03-26 10:02:01,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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:02:01,438 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:01,438 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:02:01,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:02:01,438 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:02:01,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash -895518492, now seen corresponding path program 1 times [2021-03-26 10:02:01,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:01,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929584303] [2021-03-26 10:02:01,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:01,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:01,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:02:01,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:01,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:01,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:01,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:01,490 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:02:01,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929584303] [2021-03-26 10:02:01,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:01,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:02:01,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981244306] [2021-03-26 10:02:01,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:02:01,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:01,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:02:01,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:02:01,492 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 210 [2021-03-26 10:02:01,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 105 transitions, 966 flow. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:02:01,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:01,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 210 [2021-03-26 10:02:01,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:02,588 INFO L129 PetriNetUnfolder]: 4344/10415 cut-off events. [2021-03-26 10:02:02,588 INFO L130 PetriNetUnfolder]: For 27714/30040 co-relation queries the response was YES. [2021-03-26 10:02:02,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44049 conditions, 10415 events. 4344/10415 cut-off events. For 27714/30040 co-relation queries the response was YES. Maximal size of possible extension queue 1526. Compared 117887 event pairs, 245 based on Foata normal form. 113/9915 useless extension candidates. Maximal degree in co-relation 44005. Up to 3029 conditions per place. [2021-03-26 10:02:02,797 INFO L132 encePairwiseOnDemand]: 206/210 looper letters, 3 selfloop transitions, 1 changer transitions 34/106 dead transitions. [2021-03-26 10:02:02,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 106 transitions, 973 flow [2021-03-26 10:02:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:02:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:02:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 735 transitions. [2021-03-26 10:02:02,799 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.875 [2021-03-26 10:02:02,799 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 735 transitions. [2021-03-26 10:02:02,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 735 transitions. [2021-03-26 10:02:02,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:02,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 735 transitions. [2021-03-26 10:02:02,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 0 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:02:02,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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:02:02,803 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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:02:02,803 INFO L185 Difference]: Start difference. First operand has 100 places, 105 transitions, 966 flow. Second operand 4 states and 735 transitions. [2021-03-26 10:02:02,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 106 transitions, 973 flow [2021-03-26 10:02:03,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 106 transitions, 892 flow, removed 19 selfloop flow, removed 10 redundant places. [2021-03-26 10:02:03,725 INFO L241 Difference]: Finished difference. Result has 95 places, 72 transitions, 569 flow [2021-03-26 10:02:03,725 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=569, PETRI_PLACES=95, PETRI_TRANSITIONS=72} [2021-03-26 10:02:03,726 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 35 predicate places. [2021-03-26 10:02:03,726 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:03,726 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 72 transitions, 569 flow [2021-03-26 10:02:03,726 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 72 transitions, 569 flow [2021-03-26 10:02:03,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 72 transitions, 569 flow [2021-03-26 10:02:03,883 INFO L129 PetriNetUnfolder]: 562/1404 cut-off events. [2021-03-26 10:02:03,883 INFO L130 PetriNetUnfolder]: For 2504/2685 co-relation queries the response was YES. [2021-03-26 10:02:03,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4885 conditions, 1404 events. 562/1404 cut-off events. For 2504/2685 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 11547 event pairs, 61 based on Foata normal form. 25/1364 useless extension candidates. Maximal degree in co-relation 4847. Up to 320 conditions per place. [2021-03-26 10:02:03,897 INFO L142 LiptonReduction]: Number of co-enabled transitions 984 [2021-03-26 10:02:04,934 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 10:02:05,341 WARN L205 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-26 10:02:07,461 WARN L205 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-26 10:02:08,433 WARN L205 SmtUtils]: Spent 969.00 ms on a formula simplification that was a NOOP. DAG size: 305 [2021-03-26 10:02:09,527 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 270 DAG size of output: 212 [2021-03-26 10:02:09,969 WARN L205 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2021-03-26 10:02:12,616 WARN L205 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 377 DAG size of output: 320 [2021-03-26 10:02:13,697 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 309 [2021-03-26 10:02:14,860 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 10:02:15,769 WARN L205 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 203 [2021-03-26 10:02:18,446 WARN L205 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 377 DAG size of output: 320 [2021-03-26 10:02:19,617 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 309 [2021-03-26 10:02:19,778 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 10:02:19,882 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 10:02:20,078 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:02:20,278 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:02:20,297 INFO L154 LiptonReduction]: Checked pairs total: 175 [2021-03-26 10:02:20,297 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 10:02:20,297 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16571 [2021-03-26 10:02:20,298 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 68 transitions, 556 flow [2021-03-26 10:02:20,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:02:20,298 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:20,298 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:02:20,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:02:20,299 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:02:20,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:20,299 INFO L82 PathProgramCache]: Analyzing trace with hash 503008401, now seen corresponding path program 1 times [2021-03-26 10:02:20,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:20,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145880980] [2021-03-26 10:02:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:20,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:20,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:02:20,374 INFO L142 QuantifierPusher]: treesize reduction 4, result has 91.1 percent of original size [2021-03-26 10:02:20,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 10:02:20,414 INFO L142 QuantifierPusher]: treesize reduction 10, result has 75.6 percent of original size [2021-03-26 10:02:20,415 INFO L147 QuantifierPusher]: treesize reduction 4, result has 87.1 percent of original size 27 [2021-03-26 10:02:20,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:20,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:02:20,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:20,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:02:20,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:20,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:02:20,489 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:02:20,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145880980] [2021-03-26 10:02:20,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:20,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:02:20,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906110962] [2021-03-26 10:02:20,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:02:20,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:20,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:02:20,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:02:20,491 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 216 [2021-03-26 10:02:20,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 68 transitions, 556 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:02:20,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:20,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 216 [2021-03-26 10:02:20,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:20,851 INFO L129 PetriNetUnfolder]: 475/1076 cut-off events. [2021-03-26 10:02:20,852 INFO L130 PetriNetUnfolder]: For 3718/4429 co-relation queries the response was YES. [2021-03-26 10:02:20,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4096 conditions, 1076 events. 475/1076 cut-off events. For 3718/4429 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 7929 event pairs, 14 based on Foata normal form. 149/1170 useless extension candidates. Maximal degree in co-relation 4056. Up to 296 conditions per place. [2021-03-26 10:02:20,857 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 12 selfloop transitions, 5 changer transitions 27/72 dead transitions. [2021-03-26 10:02:20,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 72 transitions, 686 flow [2021-03-26 10:02:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:02:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:02:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 954 transitions. [2021-03-26 10:02:20,861 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2021-03-26 10:02:20,862 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 954 transitions. [2021-03-26 10:02:20,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 954 transitions. [2021-03-26 10:02:20,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:20,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 954 transitions. [2021-03-26 10:02:20,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 0 states have call successors, (0), 0 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:02:20,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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:02:20,866 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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:02:20,866 INFO L185 Difference]: Start difference. First operand has 89 places, 68 transitions, 556 flow. Second operand 6 states and 954 transitions. [2021-03-26 10:02:20,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 72 transitions, 686 flow [2021-03-26 10:02:20,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 72 transitions, 657 flow, removed 6 selfloop flow, removed 10 redundant places. [2021-03-26 10:02:20,888 INFO L241 Difference]: Finished difference. Result has 82 places, 43 transitions, 303 flow [2021-03-26 10:02:20,889 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=82, PETRI_TRANSITIONS=43} [2021-03-26 10:02:20,889 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 22 predicate places. [2021-03-26 10:02:20,889 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:20,889 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 43 transitions, 303 flow [2021-03-26 10:02:20,889 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 43 transitions, 303 flow [2021-03-26 10:02:20,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 43 transitions, 303 flow [2021-03-26 10:02:20,909 INFO L129 PetriNetUnfolder]: 79/191 cut-off events. [2021-03-26 10:02:20,909 INFO L130 PetriNetUnfolder]: For 523/559 co-relation queries the response was YES. [2021-03-26 10:02:20,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 191 events. 79/191 cut-off events. For 523/559 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 817 event pairs, 4 based on Foata normal form. 6/191 useless extension candidates. Maximal degree in co-relation 637. Up to 56 conditions per place. [2021-03-26 10:02:20,911 INFO L142 LiptonReduction]: Number of co-enabled transitions 310 [2021-03-26 10:02:21,712 WARN L205 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 180 [2021-03-26 10:02:22,033 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:02:23,555 WARN L205 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 304 DAG size of output: 259 [2021-03-26 10:02:24,266 WARN L205 SmtUtils]: Spent 709.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 10:02:24,519 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2021-03-26 10:02:25,004 WARN L205 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 90 [2021-03-26 10:02:25,212 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-26 10:02:25,216 INFO L154 LiptonReduction]: Checked pairs total: 29 [2021-03-26 10:02:25,216 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:02:25,216 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4327 [2021-03-26 10:02:25,217 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 42 transitions, 316 flow [2021-03-26 10:02:25,217 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:02:25,217 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:25,218 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:02:25,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:02:25,218 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:02:25,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:25,218 INFO L82 PathProgramCache]: Analyzing trace with hash -182880408, now seen corresponding path program 1 times [2021-03-26 10:02:25,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:25,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313045428] [2021-03-26 10:02:25,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:02:25,259 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:02:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:02:25,312 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:02:25,358 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:02:25,358 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:02:25,358 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:02:25,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:02:25 BasicIcfg [2021-03-26 10:02:25,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:02:25,488 INFO L168 Benchmark]: Toolchain (without parser) took 49028.27 ms. Allocated memory was 327.2 MB in the beginning and 3.9 GB in the end (delta: 3.6 GB). Free memory was 290.4 MB in the beginning and 2.7 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.0 GB. [2021-03-26 10:02:25,488 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 327.2 MB. Free memory was 308.7 MB in the beginning and 308.6 MB in the end (delta: 70.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:02:25,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.12 ms. Allocated memory is still 327.2 MB. Free memory was 290.2 MB in the beginning and 285.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:25,492 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.29 ms. Allocated memory is still 327.2 MB. Free memory was 285.4 MB in the beginning and 282.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:25,492 INFO L168 Benchmark]: Boogie Preprocessor took 36.27 ms. Allocated memory is still 327.2 MB. Free memory was 282.3 MB in the beginning and 280.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:25,492 INFO L168 Benchmark]: RCFGBuilder took 1809.16 ms. Allocated memory is still 327.2 MB. Free memory was 280.2 MB in the beginning and 194.2 MB in the end (delta: 86.0 MB). Peak memory consumption was 139.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:25,492 INFO L168 Benchmark]: TraceAbstraction took 46481.92 ms. Allocated memory was 327.2 MB in the beginning and 3.9 GB in the end (delta: 3.6 GB). Free memory was 193.2 MB in the beginning and 2.7 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.0 GB. [2021-03-26 10:02:25,494 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.49 ms. Allocated memory is still 327.2 MB. Free memory was 308.7 MB in the beginning and 308.6 MB in the end (delta: 70.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 630.12 ms. Allocated memory is still 327.2 MB. Free memory was 290.2 MB in the beginning and 285.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 64.29 ms. Allocated memory is still 327.2 MB. Free memory was 285.4 MB in the beginning and 282.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 36.27 ms. Allocated memory is still 327.2 MB. Free memory was 282.3 MB in the beginning and 280.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1809.16 ms. Allocated memory is still 327.2 MB. Free memory was 280.2 MB in the beginning and 194.2 MB in the end (delta: 86.0 MB). Peak memory consumption was 139.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 46481.92 ms. Allocated memory was 327.2 MB in the beginning and 3.9 GB in the end (delta: 3.6 GB). Free memory was 193.2 MB in the beginning and 2.7 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3327.5ms, 125 PlacesBefore, 60 PlacesAfterwards, 114 TransitionsBefore, 48 TransitionsAfterwards, 2774 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 4931 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2389, positive: 2284, positive conditional: 2284, positive unconditional: 0, negative: 105, negative conditional: 105, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2389, positive: 2284, positive conditional: 0, positive unconditional: 2284, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2389, positive: 2284, positive conditional: 0, positive unconditional: 2284, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1787, positive: 1734, positive conditional: 0, positive unconditional: 1734, 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: 1787, positive: 1731, positive conditional: 0, positive unconditional: 1731, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 633, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 623, negative conditional: 0, negative unconditional: 623, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2389, positive: 550, positive conditional: 0, positive unconditional: 550, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 1787, unknown conditional: 0, unknown unconditional: 1787] , Statistics on independence cache: Total cache size (in pairs): 1787, Positive cache size: 1734, Positive conditional cache size: 0, Positive unconditional cache size: 1734, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1164.5ms, 56 PlacesBefore, 44 PlacesAfterwards, 45 TransitionsBefore, 33 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 2547 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 695, positive: 578, positive conditional: 578, positive unconditional: 0, negative: 117, negative conditional: 117, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 695, positive: 578, positive conditional: 34, positive unconditional: 544, negative: 117, negative conditional: 6, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 695, positive: 578, positive conditional: 34, positive unconditional: 544, negative: 117, negative conditional: 6, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 167, positive: 151, positive conditional: 7, positive unconditional: 144, negative: 16, negative conditional: 3, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 146, positive conditional: 0, positive unconditional: 146, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 16, negative conditional: 3, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 309, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 287, negative conditional: 62, negative unconditional: 225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 695, positive: 427, positive conditional: 27, positive unconditional: 400, negative: 101, negative conditional: 3, negative unconditional: 98, unknown: 167, unknown conditional: 10, unknown unconditional: 157] , Statistics on independence cache: Total cache size (in pairs): 1954, Positive cache size: 1885, Positive conditional cache size: 7, Positive unconditional cache size: 1878, Negative cache size: 69, Negative conditional cache size: 3, Negative unconditional cache size: 66, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1469.3ms, 53 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1215 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 299, positive: 242, positive conditional: 242, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 299, positive: 242, positive conditional: 0, positive unconditional: 242, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 299, positive: 242, positive conditional: 0, positive unconditional: 242, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, positive: 23, positive conditional: 0, positive unconditional: 23, 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: 23, positive: 23, positive conditional: 0, positive unconditional: 23, 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: 299, positive: 219, positive conditional: 0, positive unconditional: 219, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 1977, Positive cache size: 1908, Positive conditional cache size: 7, Positive unconditional cache size: 1901, Negative cache size: 69, Negative conditional cache size: 3, Negative unconditional cache size: 66, Eliminated conditions: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 385.4ms, 50 PlacesBefore, 50 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 850 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, positive: 173, positive conditional: 173, 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: 203, positive: 173, positive conditional: 60, positive unconditional: 113, 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: 203, positive: 173, positive conditional: 60, positive unconditional: 113, 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: 26, positive: 20, positive conditional: 12, positive unconditional: 8, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 144, negative conditional: 0, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, positive: 153, positive conditional: 48, positive unconditional: 105, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 26, unknown conditional: 12, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 2003, Positive cache size: 1928, Positive conditional cache size: 19, Positive unconditional cache size: 1909, Negative cache size: 75, Negative conditional cache size: 3, Negative unconditional cache size: 72, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 348.7ms, 51 PlacesBefore, 51 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 676 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 732 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, positive: 136, positive conditional: 136, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 162, positive: 136, positive conditional: 24, positive unconditional: 112, 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: 162, positive: 136, positive conditional: 24, positive unconditional: 112, 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: 12, positive: 11, positive conditional: 5, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, positive: 125, positive conditional: 19, positive unconditional: 106, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 12, unknown conditional: 5, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 2015, Positive cache size: 1939, Positive conditional cache size: 24, Positive unconditional cache size: 1915, Negative cache size: 76, Negative conditional cache size: 3, Negative unconditional cache size: 73, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 445.5ms, 59 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 932 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1023 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 211, positive: 181, positive conditional: 181, 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: 211, positive: 181, positive conditional: 52, positive unconditional: 129, 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: 211, positive: 181, positive conditional: 52, positive unconditional: 129, 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: 26, positive: 21, positive conditional: 15, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 170, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 170, negative conditional: 0, negative unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 211, positive: 160, positive conditional: 37, positive unconditional: 123, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 26, unknown conditional: 15, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 2041, Positive cache size: 1960, Positive conditional cache size: 39, Positive unconditional cache size: 1921, Negative cache size: 81, Negative conditional cache size: 3, Negative unconditional cache size: 78, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2299.9ms, 61 PlacesBefore, 61 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 277 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, positive: 52, positive conditional: 52, 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: 58, positive: 52, positive conditional: 12, positive unconditional: 40, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 52, positive conditional: 12, positive unconditional: 40, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 4, positive unconditional: 13, 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: 58, positive: 35, positive conditional: 8, positive unconditional: 27, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 17, unknown conditional: 4, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 2058, Positive cache size: 1977, Positive conditional cache size: 43, Positive unconditional cache size: 1934, Negative cache size: 81, Negative conditional cache size: 3, Negative unconditional cache size: 78, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 336.1ms, 69 PlacesBefore, 69 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 134 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, positive: 13, positive conditional: 8, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 8, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 16, positive: 10, positive conditional: 5, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2061, Positive cache size: 1980, Positive conditional cache size: 46, Positive unconditional cache size: 1934, Negative cache size: 81, Negative conditional cache size: 3, Negative unconditional cache size: 78, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 509.1ms, 74 PlacesBefore, 74 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1822 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 225 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, positive: 140, positive conditional: 140, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 145, positive: 140, positive conditional: 85, positive unconditional: 55, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 145, positive: 140, positive conditional: 85, positive unconditional: 55, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, positive: 139, positive conditional: 85, positive unconditional: 54, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2062, Positive cache size: 1981, Positive conditional cache size: 46, Positive unconditional cache size: 1935, Negative cache size: 81, Negative conditional cache size: 3, Negative unconditional cache size: 78, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 730.0ms, 84 PlacesBefore, 84 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 2102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 250 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 215, positive: 210, positive conditional: 210, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 215, positive: 210, positive conditional: 130, positive unconditional: 80, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 215, positive: 210, positive conditional: 130, positive unconditional: 80, negative: 5, negative conditional: 0, negative unconditional: 5, 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: 215, positive: 208, positive conditional: 130, positive unconditional: 78, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2064, Positive cache size: 1983, Positive conditional cache size: 46, Positive unconditional cache size: 1937, Negative cache size: 81, Negative conditional cache size: 3, Negative unconditional cache size: 78, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 937.7ms, 93 PlacesBefore, 93 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 2304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 275 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 240, positive: 235, positive conditional: 235, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 240, positive: 235, positive conditional: 155, positive unconditional: 80, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 240, positive: 235, positive conditional: 155, positive unconditional: 80, negative: 5, negative conditional: 0, negative unconditional: 5, 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: 240, positive: 235, positive conditional: 155, positive unconditional: 80, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2064, Positive cache size: 1983, Positive conditional cache size: 46, Positive unconditional cache size: 1937, Negative cache size: 81, Negative conditional cache size: 3, Negative unconditional cache size: 78, Eliminated conditions: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1522.9ms, 102 PlacesBefore, 100 PlacesAfterwards, 106 TransitionsBefore, 105 TransitionsAfterwards, 2200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 490 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 430, positive: 420, positive conditional: 420, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 430, positive: 420, positive conditional: 270, positive unconditional: 150, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 430, positive: 420, positive conditional: 270, positive unconditional: 150, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 430, positive: 420, positive conditional: 270, positive unconditional: 150, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2064, Positive cache size: 1983, Positive conditional cache size: 46, Positive unconditional cache size: 1937, Negative cache size: 81, Negative conditional cache size: 3, Negative unconditional cache size: 78, Eliminated conditions: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16571.1ms, 95 PlacesBefore, 89 PlacesAfterwards, 72 TransitionsBefore, 68 TransitionsAfterwards, 984 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 175 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 175, positive: 175, positive conditional: 175, 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: 175, positive: 175, positive conditional: 127, positive unconditional: 48, 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: 175, positive: 175, positive conditional: 127, positive unconditional: 48, 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: 26, positive: 26, positive conditional: 24, 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: 26, positive: 26, positive conditional: 0, positive unconditional: 26, 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: 175, positive: 149, positive conditional: 103, positive unconditional: 46, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 26, unknown conditional: 24, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2090, Positive cache size: 2009, Positive conditional cache size: 70, Positive unconditional cache size: 1939, Negative cache size: 81, Negative conditional cache size: 3, Negative unconditional cache size: 78, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4326.9ms, 82 PlacesBefore, 71 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 29 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 29, 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: 29, positive: 29, positive conditional: 7, positive unconditional: 22, 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: 29, positive: 29, positive conditional: 7, positive unconditional: 22, 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: 14, positive: 14, positive conditional: 5, 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: 14, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 29, positive: 15, positive conditional: 2, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14, unknown conditional: 5, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 2104, Positive cache size: 2023, Positive conditional cache size: 75, Positive unconditional cache size: 1948, Negative cache size: 81, Negative conditional cache size: 3, Negative unconditional cache size: 78, Eliminated conditions: 17 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t697; [L867] FCALL, FORK 0 pthread_create(&t697, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L868] 0 pthread_t t698; [L869] FCALL, FORK 0 pthread_create(&t698, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y=0, z=0] [L788] 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) [L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L788] 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) [L788] 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) [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L790] 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 [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 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 [L870] 0 pthread_t t699; [L871] FCALL, FORK 0 pthread_create(&t699, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y=0, z=0] [L872] 0 pthread_t t700; [L873] FCALL, FORK 0 pthread_create(&t700, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, z=0] [L802] 3 y = 1 [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, z=1] [L822] 4 z = 2 [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, z=2] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 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) [L832] 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) [L833] 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)) [L833] 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)) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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)) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 4 __unbuffered_p3_EBX = a [L840] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 [L844] 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) [L844] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L844] 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) [L844] 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) [L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L846] 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 [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L848] 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 [L808] 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) [L808] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L808] 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) [L808] 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) [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 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 [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L812] 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 [L768] 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) [L768] 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) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 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 [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 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 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L879] 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) [L879] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L879] 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) [L879] 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) [L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L881] 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 [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L883] 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 [L886] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_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_p1_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=51, weak$$choice2=255, x=1, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 46246.9ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 9822.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3400.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 95 SDtfs, 91 SDslu, 94 SDs, 0 SdLazy, 605 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 691.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 517.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1014occurred in iteration=10, InterpolantAutomatonStates: 77, 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: 54.2ms SsaConstructionTime, 547.3ms SatisfiabilityAnalysisTime, 1041.3ms InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...