/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:38:28,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:38:28,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:38:28,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:38:28,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:38:28,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:38:28,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:38:28,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:38:28,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:38:28,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:38:28,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:38:28,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:38:28,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:38:28,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:38:28,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:38:28,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:38:28,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:38:28,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:38:28,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:38:28,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:38:28,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:38:28,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:38:28,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:38:28,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:38:28,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:38:28,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:38:28,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:38:28,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:38:28,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:38:28,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:38:28,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:38:28,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:38:28,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:38:28,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:38:28,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:38:28,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:38:28,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:38:28,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:38:28,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:38:28,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:38:28,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:38:28,488 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-RepeatedSemanticLbe.epf [2021-03-25 14:38:28,528 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:38:28,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:38:28,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:38:28,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:38:28,531 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:38:28,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:38:28,531 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:38:28,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:38:28,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:38:28,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:38:28,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:38:28,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:38:28,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:38:28,533 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:38:28,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:38:28,533 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:38:28,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:38:28,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:38:28,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:38:28,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:38:28,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:38:28,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:38:28,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:38:28,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:38:28,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:38:28,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:38:28,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:38:28,535 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:38:28,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:38:28,535 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-25 14:38:28,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:38:28,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:38:28,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:38:28,885 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:38:28,886 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:38:28,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2021-03-25 14:38:28,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9b78600/34a3d921c64b4ebbb0198be2bd360464/FLAG1b7187d91 [2021-03-25 14:38:29,367 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:38:29,367 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2021-03-25 14:38:29,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9b78600/34a3d921c64b4ebbb0198be2bd360464/FLAG1b7187d91 [2021-03-25 14:38:29,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9b78600/34a3d921c64b4ebbb0198be2bd360464 [2021-03-25 14:38:29,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:38:29,694 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:38:29,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:38:29,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:38:29,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:38:29,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:38:29" (1/1) ... [2021-03-25 14:38:29,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7670e551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:29, skipping insertion in model container [2021-03-25 14:38:29,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:38:29" (1/1) ... [2021-03-25 14:38:29,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:38:29,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:38:29,882 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/mix055_tso.oepc.i[949,962] [2021-03-25 14:38:30,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:38:30,077 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:38:30,094 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/mix055_tso.oepc.i[949,962] [2021-03-25 14:38:30,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:38:30,194 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:38:30,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:30 WrapperNode [2021-03-25 14:38:30,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:38:30,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:38:30,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:38:30,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:38:30,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:30" (1/1) ... [2021-03-25 14:38:30,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:30" (1/1) ... [2021-03-25 14:38:30,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:38:30,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:38:30,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:38:30,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:38:30,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:30" (1/1) ... [2021-03-25 14:38:30,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:30" (1/1) ... [2021-03-25 14:38:30,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:30" (1/1) ... [2021-03-25 14:38:30,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:30" (1/1) ... [2021-03-25 14:38:30,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:30" (1/1) ... [2021-03-25 14:38:30,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:30" (1/1) ... [2021-03-25 14:38:30,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:30" (1/1) ... [2021-03-25 14:38:30,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:38:30,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:38:30,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:38:30,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:38:30,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:38:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:38:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:38:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:38:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:38:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:38:30,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:38:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:38:30,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:38:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:38:30,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:38:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:38:30,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:38:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:38:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:38:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:38:30,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:38:30,342 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:38:32,265 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:38:32,266 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:38:32,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:38:32 BoogieIcfgContainer [2021-03-25 14:38:32,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:38:32,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:38:32,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:38:32,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:38:32,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:38:29" (1/3) ... [2021-03-25 14:38:32,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a9911f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:38:32, skipping insertion in model container [2021-03-25 14:38:32,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:38:30" (2/3) ... [2021-03-25 14:38:32,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a9911f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:38:32, skipping insertion in model container [2021-03-25 14:38:32,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:38:32" (3/3) ... [2021-03-25 14:38:32,275 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2021-03-25 14:38:32,281 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:38:32,286 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:38:32,286 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:38:32,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,326 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,326 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,327 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,327 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,331 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,332 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,332 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,332 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,333 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,333 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,334 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,334 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,339 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,339 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,340 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,340 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,344 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,344 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,345 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,345 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,358 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,358 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,362 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,362 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,363 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,365 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,365 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:38:32,367 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:38:32,384 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:38:32,400 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:38:32,401 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:38:32,401 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:38:32,401 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:38:32,401 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:38:32,401 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:38:32,401 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:38:32,401 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:38:32,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2021-03-25 14:38:32,456 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-25 14:38:32,457 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:38:32,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 14:38:32,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 115 transitions, 250 flow [2021-03-25 14:38:32,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 111 transitions, 234 flow [2021-03-25 14:38:32,481 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:32,492 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-25 14:38:32,497 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-25 14:38:32,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 234 flow [2021-03-25 14:38:32,535 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-25 14:38:32,535 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:38:32,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 14:38:32,540 INFO L142 LiptonReduction]: Number of co-enabled transitions 2664 [2021-03-25 14:38:34,221 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:38:34,636 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:38:34,769 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:38:35,498 WARN L205 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-25 14:38:35,786 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 14:38:37,206 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 14:38:37,818 WARN L205 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:38:39,378 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:38:39,686 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:38:40,276 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:38:40,892 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:38:41,513 INFO L154 LiptonReduction]: Checked pairs total: 5269 [2021-03-25 14:38:41,513 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-25 14:38:41,515 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9035 [2021-03-25 14:38:41,528 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 14:38:41,528 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:38:41,529 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:41,529 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:38:41,529 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:41,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:41,534 INFO L82 PathProgramCache]: Analyzing trace with hash 636854298, now seen corresponding path program 1 times [2021-03-25 14:38:41,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:41,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666607187] [2021-03-25 14:38:41,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:41,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:41,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:38:41,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:41,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:41,791 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-25 14:38:41,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666607187] [2021-03-25 14:38:41,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:41,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:38:41,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260140092] [2021-03-25 14:38:41,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:38:41,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:41,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:38:41,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:38:41,813 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2021-03-25 14:38:41,817 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:41,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:41,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2021-03-25 14:38:41,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:42,025 INFO L129 PetriNetUnfolder]: 185/431 cut-off events. [2021-03-25 14:38:42,026 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:38:42,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 431 events. 185/431 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2461 event pairs, 123 based on Foata normal form. 20/412 useless extension candidates. Maximal degree in co-relation 708. Up to 209 conditions per place. [2021-03-25 14:38:42,036 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 11 selfloop transitions, 2 changer transitions 5/46 dead transitions. [2021-03-25 14:38:42,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 134 flow [2021-03-25 14:38:42,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:38:42,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:38:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2021-03-25 14:38:42,059 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.90625 [2021-03-25 14:38:42,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2021-03-25 14:38:42,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2021-03-25 14:38:42,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:42,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2021-03-25 14:38:42,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:42,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:42,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:42,089 INFO L185 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 3 states and 522 transitions. [2021-03-25 14:38:42,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 134 flow [2021-03-25 14:38:42,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:38:42,094 INFO L241 Difference]: Finished difference. Result has 51 places, 36 transitions, 84 flow [2021-03-25 14:38:42,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2021-03-25 14:38:42,096 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2021-03-25 14:38:42,096 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:42,096 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 36 transitions, 84 flow [2021-03-25 14:38:42,098 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 36 transitions, 84 flow [2021-03-25 14:38:42,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 84 flow [2021-03-25 14:38:42,104 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-25 14:38:42,104 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:38:42,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:38:42,105 INFO L142 LiptonReduction]: Number of co-enabled transitions 448 [2021-03-25 14:38:42,488 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:38:42,801 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:38:43,461 WARN L205 SmtUtils]: Spent 658.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:38:44,092 WARN L205 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:38:44,969 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 14:38:45,160 INFO L154 LiptonReduction]: Checked pairs total: 2104 [2021-03-25 14:38:45,160 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 14:38:45,160 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3064 [2021-03-25 14:38:45,161 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-25 14:38:45,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:45,162 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:45,162 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-25 14:38:45,162 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:38:45,162 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:45,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:45,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1405212220, now seen corresponding path program 1 times [2021-03-25 14:38:45,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:45,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336622399] [2021-03-25 14:38:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:45,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:45,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:38:45,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:45,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:45,265 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:38:45,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:38:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:38:45,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336622399] [2021-03-25 14:38:45,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:45,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:38:45,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958289299] [2021-03-25 14:38:45,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:38:45,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:45,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:38:45,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:38:45,273 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 199 [2021-03-25 14:38:45,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:45,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:45,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 199 [2021-03-25 14:38:45,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:45,292 INFO L129 PetriNetUnfolder]: 3/41 cut-off events. [2021-03-25 14:38:45,292 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:38:45,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 41 events. 3/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 1 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 54. Up to 10 conditions per place. [2021-03-25 14:38:45,293 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 3 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-03-25 14:38:45,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 86 flow [2021-03-25 14:38:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:38:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:38:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2021-03-25 14:38:45,295 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.88107202680067 [2021-03-25 14:38:45,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2021-03-25 14:38:45,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2021-03-25 14:38:45,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:45,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2021-03-25 14:38:45,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:45,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:45,299 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:45,299 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 526 transitions. [2021-03-25 14:38:45,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 86 flow [2021-03-25 14:38:45,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:38:45,300 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 85 flow [2021-03-25 14:38:45,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-25 14:38:45,301 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -14 predicate places. [2021-03-25 14:38:45,301 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:45,301 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 85 flow [2021-03-25 14:38:45,301 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 85 flow [2021-03-25 14:38:45,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 85 flow [2021-03-25 14:38:45,307 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-03-25 14:38:45,307 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:38:45,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 39 events. 3/39 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 82 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-03-25 14:38:45,308 INFO L142 LiptonReduction]: Number of co-enabled transitions 454 [2021-03-25 14:38:45,651 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 14:38:45,795 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:38:46,116 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 14:38:46,261 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:38:46,266 INFO L154 LiptonReduction]: Checked pairs total: 960 [2021-03-25 14:38:46,266 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:38:46,266 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 965 [2021-03-25 14:38:46,267 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 83 flow [2021-03-25 14:38:46,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:46,267 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:46,268 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:38:46,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:38:46,268 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:46,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:46,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1185735838, now seen corresponding path program 1 times [2021-03-25 14:38:46,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:46,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499862417] [2021-03-25 14:38:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:46,452 INFO L142 QuantifierPusher]: treesize reduction 18, result has 67.3 percent of original size [2021-03-25 14:38:46,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 14:38:46,483 INFO L142 QuantifierPusher]: treesize reduction 18, result has 69.0 percent of original size [2021-03-25 14:38:46,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 14:38:46,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:46,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 14:38:46,520 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-25 14:38:46,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499862417] [2021-03-25 14:38:46,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:46,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:38:46,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915884715] [2021-03-25 14:38:46,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:38:46,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:46,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:38:46,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:38:46,524 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 200 [2021-03-25 14:38:46,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:46,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:46,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 200 [2021-03-25 14:38:46,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:46,732 INFO L129 PetriNetUnfolder]: 284/524 cut-off events. [2021-03-25 14:38:46,733 INFO L130 PetriNetUnfolder]: For 21/47 co-relation queries the response was YES. [2021-03-25 14:38:46,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 524 events. 284/524 cut-off events. For 21/47 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2735 event pairs, 108 based on Foata normal form. 7/472 useless extension candidates. Maximal degree in co-relation 1026. Up to 393 conditions per place. [2021-03-25 14:38:46,737 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 12 selfloop transitions, 9 changer transitions 0/42 dead transitions. [2021-03-25 14:38:46,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 149 flow [2021-03-25 14:38:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:38:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:38:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 659 transitions. [2021-03-25 14:38:46,741 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.82375 [2021-03-25 14:38:46,741 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 659 transitions. [2021-03-25 14:38:46,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 659 transitions. [2021-03-25 14:38:46,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:46,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 659 transitions. [2021-03-25 14:38:46,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:46,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:46,746 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:46,746 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 83 flow. Second operand 4 states and 659 transitions. [2021-03-25 14:38:46,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 149 flow [2021-03-25 14:38:46,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:38:46,748 INFO L241 Difference]: Finished difference. Result has 44 places, 38 transitions, 138 flow [2021-03-25 14:38:46,748 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2021-03-25 14:38:46,748 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2021-03-25 14:38:46,748 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:46,749 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 138 flow [2021-03-25 14:38:46,749 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 138 flow [2021-03-25 14:38:46,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 138 flow [2021-03-25 14:38:46,784 INFO L129 PetriNetUnfolder]: 43/160 cut-off events. [2021-03-25 14:38:46,784 INFO L130 PetriNetUnfolder]: For 74/94 co-relation queries the response was YES. [2021-03-25 14:38:46,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 160 events. 43/160 cut-off events. For 74/94 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 907 event pairs, 15 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 322. Up to 50 conditions per place. [2021-03-25 14:38:46,787 INFO L142 LiptonReduction]: Number of co-enabled transitions 626 [2021-03-25 14:38:46,800 INFO L154 LiptonReduction]: Checked pairs total: 331 [2021-03-25 14:38:46,800 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:38:46,800 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-03-25 14:38:46,803 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 138 flow [2021-03-25 14:38:46,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:46,804 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:46,804 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:38:46,804 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:38:46,804 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:46,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:46,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1683128888, now seen corresponding path program 1 times [2021-03-25 14:38:46,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:46,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695601338] [2021-03-25 14:38:46,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:46,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:46,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:38:46,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:46,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:46,951 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-25 14:38:46,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695601338] [2021-03-25 14:38:46,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:46,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:38:46,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080472056] [2021-03-25 14:38:46,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:38:46,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:46,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:38:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:38:46,954 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 200 [2021-03-25 14:38:46,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:46,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:46,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 200 [2021-03-25 14:38:46,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:46,996 INFO L129 PetriNetUnfolder]: 45/193 cut-off events. [2021-03-25 14:38:46,996 INFO L130 PetriNetUnfolder]: For 158/202 co-relation queries the response was YES. [2021-03-25 14:38:46,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 193 events. 45/193 cut-off events. For 158/202 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1175 event pairs, 19 based on Foata normal form. 8/180 useless extension candidates. Maximal degree in co-relation 379. Up to 78 conditions per place. [2021-03-25 14:38:46,998 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 3 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2021-03-25 14:38:46,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 150 flow [2021-03-25 14:38:46,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:38:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:38:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2021-03-25 14:38:47,001 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.895 [2021-03-25 14:38:47,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 537 transitions. [2021-03-25 14:38:47,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 537 transitions. [2021-03-25 14:38:47,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:47,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 537 transitions. [2021-03-25 14:38:47,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,004 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,005 INFO L185 Difference]: Start difference. First operand has 44 places, 38 transitions, 138 flow. Second operand 3 states and 537 transitions. [2021-03-25 14:38:47,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 150 flow [2021-03-25 14:38:47,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:38:47,008 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 149 flow [2021-03-25 14:38:47,008 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-25 14:38:47,009 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -8 predicate places. [2021-03-25 14:38:47,009 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:47,009 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 149 flow [2021-03-25 14:38:47,009 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 149 flow [2021-03-25 14:38:47,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 149 flow [2021-03-25 14:38:47,037 INFO L129 PetriNetUnfolder]: 43/188 cut-off events. [2021-03-25 14:38:47,037 INFO L130 PetriNetUnfolder]: For 86/105 co-relation queries the response was YES. [2021-03-25 14:38:47,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 188 events. 43/188 cut-off events. For 86/105 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1161 event pairs, 16 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 376. Up to 74 conditions per place. [2021-03-25 14:38:47,040 INFO L142 LiptonReduction]: Number of co-enabled transitions 626 [2021-03-25 14:38:47,046 INFO L154 LiptonReduction]: Checked pairs total: 380 [2021-03-25 14:38:47,046 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:38:47,046 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-25 14:38:47,050 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 149 flow [2021-03-25 14:38:47,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,051 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:47,051 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:38:47,051 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:38:47,051 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:47,052 INFO L82 PathProgramCache]: Analyzing trace with hash 178220995, now seen corresponding path program 1 times [2021-03-25 14:38:47,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:47,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449667739] [2021-03-25 14:38:47,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:47,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:47,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:38:47,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:47,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:38:47,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:47,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:38:47,200 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-25 14:38:47,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449667739] [2021-03-25 14:38:47,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:47,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:38:47,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156520348] [2021-03-25 14:38:47,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:38:47,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:47,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:38:47,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:38:47,203 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 200 [2021-03-25 14:38:47,204 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,204 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:47,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 200 [2021-03-25 14:38:47,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:47,361 INFO L129 PetriNetUnfolder]: 348/680 cut-off events. [2021-03-25 14:38:47,361 INFO L130 PetriNetUnfolder]: For 627/1142 co-relation queries the response was YES. [2021-03-25 14:38:47,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 680 events. 348/680 cut-off events. For 627/1142 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3938 event pairs, 153 based on Foata normal form. 13/638 useless extension candidates. Maximal degree in co-relation 1826. Up to 506 conditions per place. [2021-03-25 14:38:47,368 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 21 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2021-03-25 14:38:47,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 231 flow [2021-03-25 14:38:47,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:38:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:38:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2021-03-25 14:38:47,370 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.805 [2021-03-25 14:38:47,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2021-03-25 14:38:47,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2021-03-25 14:38:47,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:47,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2021-03-25 14:38:47,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,374 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 149 flow. Second operand 3 states and 483 transitions. [2021-03-25 14:38:47,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 231 flow [2021-03-25 14:38:47,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 226 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 14:38:47,378 INFO L241 Difference]: Finished difference. Result has 49 places, 41 transitions, 176 flow [2021-03-25 14:38:47,378 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2021-03-25 14:38:47,379 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -6 predicate places. [2021-03-25 14:38:47,379 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:47,379 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 41 transitions, 176 flow [2021-03-25 14:38:47,379 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 176 flow [2021-03-25 14:38:47,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 176 flow [2021-03-25 14:38:47,414 INFO L129 PetriNetUnfolder]: 59/214 cut-off events. [2021-03-25 14:38:47,415 INFO L130 PetriNetUnfolder]: For 271/332 co-relation queries the response was YES. [2021-03-25 14:38:47,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 214 events. 59/214 cut-off events. For 271/332 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1327 event pairs, 24 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 507. Up to 74 conditions per place. [2021-03-25 14:38:47,418 INFO L142 LiptonReduction]: Number of co-enabled transitions 706 [2021-03-25 14:38:47,425 INFO L154 LiptonReduction]: Checked pairs total: 399 [2021-03-25 14:38:47,425 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:38:47,426 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47 [2021-03-25 14:38:47,428 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 176 flow [2021-03-25 14:38:47,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,429 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:47,429 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:38:47,429 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:38:47,429 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:47,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2096143978, now seen corresponding path program 1 times [2021-03-25 14:38:47,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:47,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161692323] [2021-03-25 14:38:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:47,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:47,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:38:47,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:47,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:38:47,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:47,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:38:47,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:47,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:38:47,590 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-25 14:38:47,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161692323] [2021-03-25 14:38:47,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:47,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:38:47,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264423529] [2021-03-25 14:38:47,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:38:47,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:47,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:38:47,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:38:47,593 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 200 [2021-03-25 14:38:47,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:47,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 200 [2021-03-25 14:38:47,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:47,774 INFO L129 PetriNetUnfolder]: 465/961 cut-off events. [2021-03-25 14:38:47,775 INFO L130 PetriNetUnfolder]: For 1468/2280 co-relation queries the response was YES. [2021-03-25 14:38:47,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 961 events. 465/961 cut-off events. For 1468/2280 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6277 event pairs, 105 based on Foata normal form. 32/933 useless extension candidates. Maximal degree in co-relation 2674. Up to 562 conditions per place. [2021-03-25 14:38:47,784 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 20 selfloop transitions, 11 changer transitions 0/52 dead transitions. [2021-03-25 14:38:47,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 287 flow [2021-03-25 14:38:47,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:38:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:38:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 656 transitions. [2021-03-25 14:38:47,786 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.82 [2021-03-25 14:38:47,786 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 656 transitions. [2021-03-25 14:38:47,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 656 transitions. [2021-03-25 14:38:47,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:47,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 656 transitions. [2021-03-25 14:38:47,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,790 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,790 INFO L185 Difference]: Start difference. First operand has 49 places, 41 transitions, 176 flow. Second operand 4 states and 656 transitions. [2021-03-25 14:38:47,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 287 flow [2021-03-25 14:38:47,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:38:47,795 INFO L241 Difference]: Finished difference. Result has 52 places, 49 transitions, 259 flow [2021-03-25 14:38:47,795 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2021-03-25 14:38:47,795 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2021-03-25 14:38:47,795 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:47,795 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 49 transitions, 259 flow [2021-03-25 14:38:47,796 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 49 transitions, 259 flow [2021-03-25 14:38:47,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 49 transitions, 259 flow [2021-03-25 14:38:47,886 INFO L129 PetriNetUnfolder]: 178/498 cut-off events. [2021-03-25 14:38:47,886 INFO L130 PetriNetUnfolder]: For 783/1078 co-relation queries the response was YES. [2021-03-25 14:38:47,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 498 events. 178/498 cut-off events. For 783/1078 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3455 event pairs, 31 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1428. Up to 243 conditions per place. [2021-03-25 14:38:47,893 INFO L142 LiptonReduction]: Number of co-enabled transitions 826 [2021-03-25 14:38:47,958 INFO L154 LiptonReduction]: Checked pairs total: 469 [2021-03-25 14:38:47,958 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:38:47,958 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 163 [2021-03-25 14:38:47,963 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 259 flow [2021-03-25 14:38:47,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:47,964 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:47,964 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:38:47,964 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:38:47,964 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:47,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:47,965 INFO L82 PathProgramCache]: Analyzing trace with hash 464356835, now seen corresponding path program 1 times [2021-03-25 14:38:47,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:47,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907049572] [2021-03-25 14:38:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:48,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:48,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:48,048 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:38:48,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:38:48,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:48,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:38:48,058 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-25 14:38:48,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907049572] [2021-03-25 14:38:48,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:48,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:38:48,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235489606] [2021-03-25 14:38:48,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:38:48,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:48,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:38:48,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:38:48,060 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 200 [2021-03-25 14:38:48,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 259 flow. Second operand has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:48,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:48,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 200 [2021-03-25 14:38:48,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:48,410 INFO L129 PetriNetUnfolder]: 1501/2836 cut-off events. [2021-03-25 14:38:48,411 INFO L130 PetriNetUnfolder]: For 2351/2756 co-relation queries the response was YES. [2021-03-25 14:38:48,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6792 conditions, 2836 events. 1501/2836 cut-off events. For 2351/2756 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 23241 event pairs, 648 based on Foata normal form. 189/2426 useless extension candidates. Maximal degree in co-relation 6773. Up to 1883 conditions per place. [2021-03-25 14:38:48,441 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 12 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2021-03-25 14:38:48,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 331 flow [2021-03-25 14:38:48,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:38:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:38:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 844 transitions. [2021-03-25 14:38:48,444 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.844 [2021-03-25 14:38:48,444 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 844 transitions. [2021-03-25 14:38:48,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 844 transitions. [2021-03-25 14:38:48,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:48,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 844 transitions. [2021-03-25 14:38:48,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:48,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:48,449 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:48,449 INFO L185 Difference]: Start difference. First operand has 52 places, 49 transitions, 259 flow. Second operand 5 states and 844 transitions. [2021-03-25 14:38:48,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 331 flow [2021-03-25 14:38:48,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:38:48,455 INFO L241 Difference]: Finished difference. Result has 57 places, 58 transitions, 322 flow [2021-03-25 14:38:48,455 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=57, PETRI_TRANSITIONS=58} [2021-03-25 14:38:48,456 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2021-03-25 14:38:48,456 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:48,456 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 58 transitions, 322 flow [2021-03-25 14:38:48,456 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 58 transitions, 322 flow [2021-03-25 14:38:48,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 58 transitions, 322 flow [2021-03-25 14:38:48,688 INFO L129 PetriNetUnfolder]: 1266/2466 cut-off events. [2021-03-25 14:38:48,689 INFO L130 PetriNetUnfolder]: For 3197/4803 co-relation queries the response was YES. [2021-03-25 14:38:48,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7532 conditions, 2466 events. 1266/2466 cut-off events. For 3197/4803 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 20194 event pairs, 504 based on Foata normal form. 17/2133 useless extension candidates. Maximal degree in co-relation 7512. Up to 1611 conditions per place. [2021-03-25 14:38:48,728 INFO L142 LiptonReduction]: Number of co-enabled transitions 1048 [2021-03-25 14:38:48,857 INFO L154 LiptonReduction]: Checked pairs total: 980 [2021-03-25 14:38:48,857 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:38:48,857 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 401 [2021-03-25 14:38:48,858 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 316 flow [2021-03-25 14:38:48,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:48,858 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:48,858 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:38:48,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:38:48,859 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:48,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1297164128, now seen corresponding path program 1 times [2021-03-25 14:38:48,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:48,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427948266] [2021-03-25 14:38:48,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:48,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:48,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:48,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:48,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:48,948 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:38:48,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:38:48,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:48,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:38:48,956 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-25 14:38:48,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427948266] [2021-03-25 14:38:48,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:48,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:38:48,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332755428] [2021-03-25 14:38:48,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:38:48,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:48,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:38:48,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:38:48,958 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 200 [2021-03-25 14:38:48,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:48,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:48,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 200 [2021-03-25 14:38:48,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:49,213 INFO L129 PetriNetUnfolder]: 1012/2015 cut-off events. [2021-03-25 14:38:49,213 INFO L130 PetriNetUnfolder]: For 2807/6465 co-relation queries the response was YES. [2021-03-25 14:38:49,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 2015 events. 1012/2015 cut-off events. For 2807/6465 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 15412 event pairs, 128 based on Foata normal form. 347/2114 useless extension candidates. Maximal degree in co-relation 7305. Up to 1362 conditions per place. [2021-03-25 14:38:49,236 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 13 selfloop transitions, 14 changer transitions 0/68 dead transitions. [2021-03-25 14:38:49,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 426 flow [2021-03-25 14:38:49,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:38:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:38:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1013 transitions. [2021-03-25 14:38:49,239 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8441666666666666 [2021-03-25 14:38:49,239 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1013 transitions. [2021-03-25 14:38:49,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1013 transitions. [2021-03-25 14:38:49,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:49,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1013 transitions. [2021-03-25 14:38:49,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:49,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:49,244 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:49,244 INFO L185 Difference]: Start difference. First operand has 57 places, 57 transitions, 316 flow. Second operand 6 states and 1013 transitions. [2021-03-25 14:38:49,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 426 flow [2021-03-25 14:38:49,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 419 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:38:49,267 INFO L241 Difference]: Finished difference. Result has 61 places, 62 transitions, 405 flow [2021-03-25 14:38:49,267 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=405, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2021-03-25 14:38:49,267 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2021-03-25 14:38:49,267 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:49,267 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 62 transitions, 405 flow [2021-03-25 14:38:49,267 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 62 transitions, 405 flow [2021-03-25 14:38:49,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 62 transitions, 405 flow [2021-03-25 14:38:49,419 INFO L129 PetriNetUnfolder]: 740/1610 cut-off events. [2021-03-25 14:38:49,419 INFO L130 PetriNetUnfolder]: For 4201/6368 co-relation queries the response was YES. [2021-03-25 14:38:49,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6909 conditions, 1610 events. 740/1610 cut-off events. For 4201/6368 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 12529 event pairs, 118 based on Foata normal form. 42/1538 useless extension candidates. Maximal degree in co-relation 6886. Up to 1133 conditions per place. [2021-03-25 14:38:49,450 INFO L142 LiptonReduction]: Number of co-enabled transitions 1130 [2021-03-25 14:38:49,748 INFO L154 LiptonReduction]: Checked pairs total: 1044 [2021-03-25 14:38:49,748 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:38:49,748 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 481 [2021-03-25 14:38:49,748 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 397 flow [2021-03-25 14:38:49,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:49,749 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:49,749 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-25 14:38:49,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:38:49,749 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:49,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:49,750 INFO L82 PathProgramCache]: Analyzing trace with hash -994436397, now seen corresponding path program 1 times [2021-03-25 14:38:49,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:49,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304543099] [2021-03-25 14:38:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:49,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:49,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:38:49,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:49,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:38:49,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:49,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:38:49,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:49,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:38:49,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:49,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:38:49,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:49,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:38:49,851 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-25 14:38:49,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304543099] [2021-03-25 14:38:49,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:49,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:38:49,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402141932] [2021-03-25 14:38:49,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:38:49,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:49,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:38:49,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:38:49,854 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 200 [2021-03-25 14:38:49,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 397 flow. Second operand has 8 states, 8 states have (on average 151.0) internal successors, (1208), 8 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:49,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:49,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 200 [2021-03-25 14:38:49,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:50,620 INFO L129 PetriNetUnfolder]: 1869/3569 cut-off events. [2021-03-25 14:38:50,621 INFO L130 PetriNetUnfolder]: For 9831/11549 co-relation queries the response was YES. [2021-03-25 14:38:50,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15053 conditions, 3569 events. 1869/3569 cut-off events. For 9831/11549 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 27479 event pairs, 406 based on Foata normal form. 197/3534 useless extension candidates. Maximal degree in co-relation 15028. Up to 1635 conditions per place. [2021-03-25 14:38:50,657 INFO L132 encePairwiseOnDemand]: 189/200 looper letters, 45 selfloop transitions, 37 changer transitions 27/136 dead transitions. [2021-03-25 14:38:50,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 136 transitions, 1059 flow [2021-03-25 14:38:50,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 14:38:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 14:38:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1560 transitions. [2021-03-25 14:38:50,661 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.78 [2021-03-25 14:38:50,662 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1560 transitions. [2021-03-25 14:38:50,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1560 transitions. [2021-03-25 14:38:50,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:50,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1560 transitions. [2021-03-25 14:38:50,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 156.0) internal successors, (1560), 10 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:50,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 200.0) internal successors, (2200), 11 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:50,669 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 200.0) internal successors, (2200), 11 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:50,670 INFO L185 Difference]: Start difference. First operand has 61 places, 61 transitions, 397 flow. Second operand 10 states and 1560 transitions. [2021-03-25 14:38:50,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 136 transitions, 1059 flow [2021-03-25 14:38:50,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 136 transitions, 989 flow, removed 30 selfloop flow, removed 4 redundant places. [2021-03-25 14:38:50,757 INFO L241 Difference]: Finished difference. Result has 71 places, 89 transitions, 661 flow [2021-03-25 14:38:50,757 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=661, PETRI_PLACES=71, PETRI_TRANSITIONS=89} [2021-03-25 14:38:50,757 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2021-03-25 14:38:50,757 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:50,758 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 89 transitions, 661 flow [2021-03-25 14:38:50,758 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 89 transitions, 661 flow [2021-03-25 14:38:50,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 89 transitions, 661 flow [2021-03-25 14:38:51,077 INFO L129 PetriNetUnfolder]: 1224/2624 cut-off events. [2021-03-25 14:38:51,077 INFO L130 PetriNetUnfolder]: For 8179/9106 co-relation queries the response was YES. [2021-03-25 14:38:51,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9910 conditions, 2624 events. 1224/2624 cut-off events. For 8179/9106 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 21357 event pairs, 224 based on Foata normal form. 124/2569 useless extension candidates. Maximal degree in co-relation 9882. Up to 1244 conditions per place. [2021-03-25 14:38:51,125 INFO L142 LiptonReduction]: Number of co-enabled transitions 1522 [2021-03-25 14:38:51,598 INFO L154 LiptonReduction]: Checked pairs total: 439 [2021-03-25 14:38:51,598 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:38:51,598 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 841 [2021-03-25 14:38:51,599 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 89 transitions, 661 flow [2021-03-25 14:38:51,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 151.0) internal successors, (1208), 8 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:51,599 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:51,600 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-25 14:38:51,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:38:51,600 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:51,600 INFO L82 PathProgramCache]: Analyzing trace with hash -876969497, now seen corresponding path program 2 times [2021-03-25 14:38:51,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:51,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32108100] [2021-03-25 14:38:51,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:51,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:51,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:38:51,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:51,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:38:51,716 INFO L142 QuantifierPusher]: treesize reduction 22, result has 81.7 percent of original size [2021-03-25 14:38:51,721 INFO L147 QuantifierPusher]: treesize reduction 9, result has 90.8 percent of original size 89 [2021-03-25 14:38:51,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:51,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:38:51,792 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-25 14:38:51,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 14:38:51,823 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-25 14:38:51,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32108100] [2021-03-25 14:38:51,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:51,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:38:51,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511987346] [2021-03-25 14:38:51,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:38:51,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:51,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:38:51,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:38:51,826 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 200 [2021-03-25 14:38:51,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 89 transitions, 661 flow. Second operand has 7 states, 7 states have (on average 151.85714285714286) internal successors, (1063), 7 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:51,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:51,828 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 200 [2021-03-25 14:38:51,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:52,244 INFO L129 PetriNetUnfolder]: 1346/2757 cut-off events. [2021-03-25 14:38:52,244 INFO L130 PetriNetUnfolder]: For 11150/12935 co-relation queries the response was YES. [2021-03-25 14:38:52,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11767 conditions, 2757 events. 1346/2757 cut-off events. For 11150/12935 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 21485 event pairs, 258 based on Foata normal form. 233/2822 useless extension candidates. Maximal degree in co-relation 11737. Up to 1185 conditions per place. [2021-03-25 14:38:52,300 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 50 selfloop transitions, 12 changer transitions 0/96 dead transitions. [2021-03-25 14:38:52,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 96 transitions, 841 flow [2021-03-25 14:38:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:38:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:38:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2021-03-25 14:38:52,304 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.77875 [2021-03-25 14:38:52,305 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 623 transitions. [2021-03-25 14:38:52,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 623 transitions. [2021-03-25 14:38:52,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:52,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 623 transitions. [2021-03-25 14:38:52,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:52,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:52,307 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:52,311 INFO L185 Difference]: Start difference. First operand has 71 places, 89 transitions, 661 flow. Second operand 4 states and 623 transitions. [2021-03-25 14:38:52,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 96 transitions, 841 flow [2021-03-25 14:38:52,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 835 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-25 14:38:52,336 INFO L241 Difference]: Finished difference. Result has 75 places, 89 transitions, 688 flow [2021-03-25 14:38:52,337 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=688, PETRI_PLACES=75, PETRI_TRANSITIONS=89} [2021-03-25 14:38:52,337 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 20 predicate places. [2021-03-25 14:38:52,337 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:52,338 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 89 transitions, 688 flow [2021-03-25 14:38:52,338 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 89 transitions, 688 flow [2021-03-25 14:38:52,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 89 transitions, 688 flow [2021-03-25 14:38:52,650 INFO L129 PetriNetUnfolder]: 1209/2580 cut-off events. [2021-03-25 14:38:52,650 INFO L130 PetriNetUnfolder]: For 8660/9511 co-relation queries the response was YES. [2021-03-25 14:38:52,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9939 conditions, 2580 events. 1209/2580 cut-off events. For 8660/9511 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 20859 event pairs, 200 based on Foata normal form. 125/2541 useless extension candidates. Maximal degree in co-relation 9908. Up to 1243 conditions per place. [2021-03-25 14:38:52,690 INFO L142 LiptonReduction]: Number of co-enabled transitions 1522 [2021-03-25 14:38:53,077 INFO L154 LiptonReduction]: Checked pairs total: 394 [2021-03-25 14:38:53,077 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:38:53,078 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 741 [2021-03-25 14:38:53,078 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 89 transitions, 688 flow [2021-03-25 14:38:53,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 151.85714285714286) internal successors, (1063), 7 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:53,079 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:53,079 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-25 14:38:53,079 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:38:53,079 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:53,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:53,079 INFO L82 PathProgramCache]: Analyzing trace with hash -629922662, now seen corresponding path program 1 times [2021-03-25 14:38:53,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:53,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36492615] [2021-03-25 14:38:53,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:53,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:53,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:53,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:53,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:53,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:53,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:53,137 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:38:53,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:38:53,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:53,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:38:53,146 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-25 14:38:53,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36492615] [2021-03-25 14:38:53,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:53,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:38:53,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307075616] [2021-03-25 14:38:53,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:38:53,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:53,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:38:53,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:38:53,148 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 200 [2021-03-25 14:38:53,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 89 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:53,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:53,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 200 [2021-03-25 14:38:53,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:53,477 INFO L129 PetriNetUnfolder]: 1505/3011 cut-off events. [2021-03-25 14:38:53,478 INFO L130 PetriNetUnfolder]: For 8593/11214 co-relation queries the response was YES. [2021-03-25 14:38:53,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11419 conditions, 3011 events. 1505/3011 cut-off events. For 8593/11214 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 24763 event pairs, 26 based on Foata normal form. 826/3462 useless extension candidates. Maximal degree in co-relation 11386. Up to 1550 conditions per place. [2021-03-25 14:38:53,498 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 12 selfloop transitions, 18 changer transitions 4/103 dead transitions. [2021-03-25 14:38:53,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 103 transitions, 848 flow [2021-03-25 14:38:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:38:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:38:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1182 transitions. [2021-03-25 14:38:53,501 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8442857142857143 [2021-03-25 14:38:53,501 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1182 transitions. [2021-03-25 14:38:53,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1182 transitions. [2021-03-25 14:38:53,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:53,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1182 transitions. [2021-03-25 14:38:53,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.85714285714286) internal successors, (1182), 7 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:53,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:53,507 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:53,507 INFO L185 Difference]: Start difference. First operand has 75 places, 89 transitions, 688 flow. Second operand 7 states and 1182 transitions. [2021-03-25 14:38:53,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 103 transitions, 848 flow [2021-03-25 14:38:53,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 103 transitions, 827 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:38:53,517 INFO L241 Difference]: Finished difference. Result has 82 places, 96 transitions, 797 flow [2021-03-25 14:38:53,517 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=797, PETRI_PLACES=82, PETRI_TRANSITIONS=96} [2021-03-25 14:38:53,517 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 27 predicate places. [2021-03-25 14:38:53,517 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:53,517 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 96 transitions, 797 flow [2021-03-25 14:38:53,518 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 96 transitions, 797 flow [2021-03-25 14:38:53,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 96 transitions, 797 flow [2021-03-25 14:38:53,585 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1083] L822-->L829: Formula: (let ((.cse12 (= (mod v_~x$w_buff1_used~0_384 256) 0)) (.cse9 (= (mod v_~x$r_buff1_thd4~0_50 256) 0)) (.cse10 (= (mod v_~x$w_buff0_used~0_477 256) 0)) (.cse13 (= (mod v_~x$r_buff0_thd4~0_66 256) 0)) (.cse14 (= (mod v_~x$w_buff0_used~0_478 256) 0))) (let ((.cse1 (not .cse14)) (.cse5 (or .cse14 .cse13)) (.cse11 (or .cse10 .cse13)) (.cse4 (or .cse12 .cse9)) (.cse8 (not .cse10)) (.cse0 (not .cse13)) (.cse2 (not .cse9)) (.cse3 (not .cse12))) (and (or (and .cse0 (= v_~x$w_buff0~0_113 v_~x~0_195) .cse1 (= |v_P3_#t~ite23_49| |v_P3Thread1of1ForFork0_#t~ite23_1|)) (and (or (and (= |v_P3_#t~ite23_49| v_~x$w_buff1~0_134) .cse2 .cse3) (and .cse4 (= |v_P3_#t~ite23_49| v_~x~0_196))) (= |v_P3_#t~ite23_49| v_~x~0_195) .cse5)) (or (and (= v_~x$w_buff0_used~0_477 0) .cse0 .cse1) (and (= v_~x$w_buff0_used~0_477 v_~x$w_buff0_used~0_478) .cse5)) (let ((.cse6 (= (mod v_~x$w_buff1_used~0_383 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd4~0_65 256) 0))) (or (and (= v_~x$r_buff1_thd4~0_49 0) (or (and (not .cse6) .cse2) (and (not .cse7) .cse8))) (and (= v_~x$r_buff1_thd4~0_49 v_~x$r_buff1_thd4~0_50) (or .cse6 .cse9) (or .cse10 .cse7)))) (or (and .cse8 .cse0 (= v_~x$r_buff0_thd4~0_65 0)) (and .cse11 (= v_~x$r_buff0_thd4~0_66 v_~x$r_buff0_thd4~0_65))) (or (and .cse11 (= v_~x$w_buff1_used~0_384 v_~x$w_buff1_used~0_383) .cse4) (and (= v_~x$w_buff1_used~0_383 0) (or (and .cse8 .cse0) (and .cse2 .cse3))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_113, ~x$w_buff1~0=v_~x$w_buff1~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_384, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_66, P3Thread1of1ForFork0_#t~ite23=|v_P3Thread1of1ForFork0_#t~ite23_1|, ~x~0=v_~x~0_196, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_478} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_113, ~x$w_buff1~0=v_~x$w_buff1~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_383, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_65, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_477, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_1|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_1|, P3Thread1of1ForFork0_#t~ite26=|v_P3Thread1of1ForFork0_#t~ite26_1|, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_1|, P3Thread1of1ForFork0_#t~ite24=|v_P3Thread1of1ForFork0_#t~ite24_1|, P3Thread1of1ForFork0_#t~ite23=|v_P3Thread1of1ForFork0_#t~ite23_2|, ~x~0=v_~x~0_195} AuxVars[|v_P3_#t~ite23_49|] AssignedVars[P3Thread1of1ForFork0_#t~ite28, P3Thread1of1ForFork0_#t~ite27, ~x$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite26, P3Thread1of1ForFork0_#t~ite25, ~x$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite24, P3Thread1of1ForFork0_#t~ite23, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][30], [P1Thread1of1ForFork2InUse, 71#L759true, Black: 136#(= ~z~0 0), 140#true, Black: 193#(and (not (= ~a~0 0)) (not (= ~x~0 ~x$w_buff0~0))), Black: 195#(not (= ~__unbuffered_p3_EAX~0 0)), Black: 197#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= ~a~0 1) (= ~x~0 ~a~0) (= 0 ~x$w_buff0~0)), Black: 199#(and (not (= ~a~0 0)) (not (= ~x~0 ~x$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 81#L829true, Black: 201#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= ~a~0 1) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~x~0 ~a~0) (= 0 ~x$w_buff0~0)), Black: 142#(and (= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd0~0 (* 256 (div ~x$r_buff1_thd0~0 256))) (< 0 (+ (div ~x$r_buff1_thd0~0 256) 1)) (not (= 2 ~x~0))), Black: 203#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= ~a~0 1) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 ~x$w_buff0~0)), Black: 190#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff0~0)), 83#L853-1true, Black: 143#(and (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (<= ~x$r_buff1_thd0~0 (* 256 (div ~x$r_buff1_thd0~0 256))) (< 0 (+ (div ~x$r_buff1_thd0~0 256) 1)) (not (= 2 ~x~0))), 150#(= ~z~0 1), 22#L789true, Black: 215#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0)), Black: 155#(and (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff1~0)), 223#(= ~__unbuffered_cnt~0 0), Black: 225#(<= ~__unbuffered_cnt~0 2), Black: 163#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= ~x$r_buff1_thd0~0 0)), Black: 226#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 228#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 169#(= ~__unbuffered_cnt~0 0), Black: 172#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 54#L809true, Black: 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork1InUse, 188#true, P2Thread1of1ForFork3InUse, P3Thread1of1ForFork0InUse]) [2021-03-25 14:38:53,585 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 14:38:53,585 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:38:53,585 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:38:53,586 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:38:53,601 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1083] L822-->L829: Formula: (let ((.cse12 (= (mod v_~x$w_buff1_used~0_384 256) 0)) (.cse9 (= (mod v_~x$r_buff1_thd4~0_50 256) 0)) (.cse10 (= (mod v_~x$w_buff0_used~0_477 256) 0)) (.cse13 (= (mod v_~x$r_buff0_thd4~0_66 256) 0)) (.cse14 (= (mod v_~x$w_buff0_used~0_478 256) 0))) (let ((.cse1 (not .cse14)) (.cse5 (or .cse14 .cse13)) (.cse11 (or .cse10 .cse13)) (.cse4 (or .cse12 .cse9)) (.cse8 (not .cse10)) (.cse0 (not .cse13)) (.cse2 (not .cse9)) (.cse3 (not .cse12))) (and (or (and .cse0 (= v_~x$w_buff0~0_113 v_~x~0_195) .cse1 (= |v_P3_#t~ite23_49| |v_P3Thread1of1ForFork0_#t~ite23_1|)) (and (or (and (= |v_P3_#t~ite23_49| v_~x$w_buff1~0_134) .cse2 .cse3) (and .cse4 (= |v_P3_#t~ite23_49| v_~x~0_196))) (= |v_P3_#t~ite23_49| v_~x~0_195) .cse5)) (or (and (= v_~x$w_buff0_used~0_477 0) .cse0 .cse1) (and (= v_~x$w_buff0_used~0_477 v_~x$w_buff0_used~0_478) .cse5)) (let ((.cse6 (= (mod v_~x$w_buff1_used~0_383 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd4~0_65 256) 0))) (or (and (= v_~x$r_buff1_thd4~0_49 0) (or (and (not .cse6) .cse2) (and (not .cse7) .cse8))) (and (= v_~x$r_buff1_thd4~0_49 v_~x$r_buff1_thd4~0_50) (or .cse6 .cse9) (or .cse10 .cse7)))) (or (and .cse8 .cse0 (= v_~x$r_buff0_thd4~0_65 0)) (and .cse11 (= v_~x$r_buff0_thd4~0_66 v_~x$r_buff0_thd4~0_65))) (or (and .cse11 (= v_~x$w_buff1_used~0_384 v_~x$w_buff1_used~0_383) .cse4) (and (= v_~x$w_buff1_used~0_383 0) (or (and .cse8 .cse0) (and .cse2 .cse3))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_113, ~x$w_buff1~0=v_~x$w_buff1~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_384, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_66, P3Thread1of1ForFork0_#t~ite23=|v_P3Thread1of1ForFork0_#t~ite23_1|, ~x~0=v_~x~0_196, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_478} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_113, ~x$w_buff1~0=v_~x$w_buff1~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_383, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_65, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_477, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_1|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_1|, P3Thread1of1ForFork0_#t~ite26=|v_P3Thread1of1ForFork0_#t~ite26_1|, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_1|, P3Thread1of1ForFork0_#t~ite24=|v_P3Thread1of1ForFork0_#t~ite24_1|, P3Thread1of1ForFork0_#t~ite23=|v_P3Thread1of1ForFork0_#t~ite23_2|, ~x~0=v_~x~0_195} AuxVars[|v_P3_#t~ite23_49|] AssignedVars[P3Thread1of1ForFork0_#t~ite28, P3Thread1of1ForFork0_#t~ite27, ~x$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite26, P3Thread1of1ForFork0_#t~ite25, ~x$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite24, P3Thread1of1ForFork0_#t~ite23, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][30], [P1Thread1of1ForFork2InUse, 71#L759true, Black: 136#(= ~z~0 0), 140#true, Black: 193#(and (not (= ~a~0 0)) (not (= ~x~0 ~x$w_buff0~0))), Black: 195#(not (= ~__unbuffered_p3_EAX~0 0)), Black: 197#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= ~a~0 1) (= ~x~0 ~a~0) (= 0 ~x$w_buff0~0)), Black: 199#(and (not (= ~a~0 0)) (not (= ~x~0 ~x$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 201#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= ~a~0 1) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~x~0 ~a~0) (= 0 ~x$w_buff0~0)), 81#L829true, Black: 203#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= ~a~0 1) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 ~x$w_buff0~0)), Black: 142#(and (= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd0~0 (* 256 (div ~x$r_buff1_thd0~0 256))) (< 0 (+ (div ~x$r_buff1_thd0~0 256) 1)) (not (= 2 ~x~0))), 83#L853-1true, Black: 190#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff0~0)), Black: 143#(and (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (<= ~x$r_buff1_thd0~0 (* 256 (div ~x$r_buff1_thd0~0 256))) (< 0 (+ (div ~x$r_buff1_thd0~0 256) 1)) (not (= 2 ~x~0))), 22#L789true, Black: 150#(= ~z~0 1), Black: 215#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0)), 223#(= ~__unbuffered_cnt~0 0), Black: 155#(and (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff1~0)), Black: 225#(<= ~__unbuffered_cnt~0 2), Black: 163#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= ~x$r_buff1_thd0~0 0)), Black: 226#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 228#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 169#(= ~__unbuffered_cnt~0 0), Black: 172#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 54#L809true, Black: 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork1InUse, 188#true, P2Thread1of1ForFork3InUse, P3Thread1of1ForFork0InUse]) [2021-03-25 14:38:53,601 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 14:38:53,601 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 14:38:53,601 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 14:38:53,601 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 14:38:53,644 INFO L129 PetriNetUnfolder]: 827/1918 cut-off events. [2021-03-25 14:38:53,644 INFO L130 PetriNetUnfolder]: For 6828/8176 co-relation queries the response was YES. [2021-03-25 14:38:53,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8532 conditions, 1918 events. 827/1918 cut-off events. For 6828/8176 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 15885 event pairs, 38 based on Foata normal form. 14/1812 useless extension candidates. Maximal degree in co-relation 8498. Up to 1044 conditions per place. [2021-03-25 14:38:53,663 INFO L142 LiptonReduction]: Number of co-enabled transitions 1664 [2021-03-25 14:38:53,811 INFO L154 LiptonReduction]: Checked pairs total: 636 [2021-03-25 14:38:53,811 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:38:53,812 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 295 [2021-03-25 14:38:53,812 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 96 transitions, 797 flow [2021-03-25 14:38:53,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:53,812 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:53,813 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-25 14:38:53,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:38:53,813 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:53,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1220933847, now seen corresponding path program 1 times [2021-03-25 14:38:53,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:53,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557924766] [2021-03-25 14:38:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:53,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:53,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:53,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:53,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:53,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:53,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:53,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:53,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:53,888 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:38:53,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:38:53,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:53,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:38:53,897 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-25 14:38:53,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557924766] [2021-03-25 14:38:53,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:53,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:38:53,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307903823] [2021-03-25 14:38:53,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:38:53,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:53,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:38:53,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:38:53,899 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 200 [2021-03-25 14:38:53,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 96 transitions, 797 flow. Second operand has 7 states, 7 states have (on average 164.85714285714286) internal successors, (1154), 7 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:53,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:53,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 200 [2021-03-25 14:38:53,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:54,284 INFO L129 PetriNetUnfolder]: 1442/2874 cut-off events. [2021-03-25 14:38:54,285 INFO L130 PetriNetUnfolder]: For 9981/14219 co-relation queries the response was YES. [2021-03-25 14:38:54,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13015 conditions, 2874 events. 1442/2874 cut-off events. For 9981/14219 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 23009 event pairs, 10 based on Foata normal form. 464/2966 useless extension candidates. Maximal degree in co-relation 12979. Up to 1499 conditions per place. [2021-03-25 14:38:54,307 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 6 selfloop transitions, 23 changer transitions 5/103 dead transitions. [2021-03-25 14:38:54,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 103 transitions, 899 flow [2021-03-25 14:38:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:38:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:38:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1512 transitions. [2021-03-25 14:38:54,319 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.84 [2021-03-25 14:38:54,319 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1512 transitions. [2021-03-25 14:38:54,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1512 transitions. [2021-03-25 14:38:54,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:54,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1512 transitions. [2021-03-25 14:38:54,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 168.0) internal successors, (1512), 9 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-25 14:38:54,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:54,326 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:54,326 INFO L185 Difference]: Start difference. First operand has 82 places, 96 transitions, 797 flow. Second operand 9 states and 1512 transitions. [2021-03-25 14:38:54,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 103 transitions, 899 flow [2021-03-25 14:38:54,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 103 transitions, 808 flow, removed 32 selfloop flow, removed 4 redundant places. [2021-03-25 14:38:54,470 INFO L241 Difference]: Finished difference. Result has 89 places, 95 transitions, 758 flow [2021-03-25 14:38:54,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=758, PETRI_PLACES=89, PETRI_TRANSITIONS=95} [2021-03-25 14:38:54,470 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 34 predicate places. [2021-03-25 14:38:54,470 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:54,471 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 95 transitions, 758 flow [2021-03-25 14:38:54,471 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 95 transitions, 758 flow [2021-03-25 14:38:54,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 95 transitions, 758 flow [2021-03-25 14:38:54,595 INFO L129 PetriNetUnfolder]: 749/1746 cut-off events. [2021-03-25 14:38:54,595 INFO L130 PetriNetUnfolder]: For 4180/4792 co-relation queries the response was YES. [2021-03-25 14:38:54,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7018 conditions, 1746 events. 749/1746 cut-off events. For 4180/4792 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 14387 event pairs, 20 based on Foata normal form. 9/1650 useless extension candidates. Maximal degree in co-relation 6982. Up to 431 conditions per place. [2021-03-25 14:38:54,623 INFO L142 LiptonReduction]: Number of co-enabled transitions 1614 [2021-03-25 14:38:55,026 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:38:55,146 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:38:55,934 WARN L205 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-25 14:38:56,155 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 14:38:57,525 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 349 DAG size of output: 270 [2021-03-25 14:38:58,054 WARN L205 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 14:38:58,146 INFO L154 LiptonReduction]: Checked pairs total: 1495 [2021-03-25 14:38:58,147 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:38:58,147 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3677 [2021-03-25 14:38:58,147 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 734 flow [2021-03-25 14:38:58,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 164.85714285714286) internal successors, (1154), 7 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:58,148 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:58,148 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:38:58,148 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:38:58,148 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:58,148 INFO L82 PathProgramCache]: Analyzing trace with hash 558098875, now seen corresponding path program 1 times [2021-03-25 14:38:58,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:58,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193390003] [2021-03-25 14:38:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:58,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:58,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:38:58,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:58,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:58,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:58,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:58,224 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-25 14:38:58,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193390003] [2021-03-25 14:38:58,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:58,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:38:58,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234831472] [2021-03-25 14:38:58,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:38:58,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:58,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:38:58,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:38:58,226 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 202 [2021-03-25 14:38:58,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 734 flow. Second operand has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:58,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:58,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 202 [2021-03-25 14:38:58,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:58,524 INFO L129 PetriNetUnfolder]: 965/2116 cut-off events. [2021-03-25 14:38:58,524 INFO L130 PetriNetUnfolder]: For 11233/11977 co-relation queries the response was YES. [2021-03-25 14:38:58,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8295 conditions, 2116 events. 965/2116 cut-off events. For 11233/11977 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 17377 event pairs, 22 based on Foata normal form. 118/2092 useless extension candidates. Maximal degree in co-relation 8257. Up to 624 conditions per place. [2021-03-25 14:38:58,544 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 3 selfloop transitions, 2 changer transitions 20/88 dead transitions. [2021-03-25 14:38:58,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 710 flow [2021-03-25 14:38:58,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:38:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:38:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2021-03-25 14:38:58,546 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8589108910891089 [2021-03-25 14:38:58,547 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 694 transitions. [2021-03-25 14:38:58,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 694 transitions. [2021-03-25 14:38:58,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:58,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 694 transitions. [2021-03-25 14:38:58,549 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-25 14:38:58,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:58,550 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:58,550 INFO L185 Difference]: Start difference. First operand has 86 places, 91 transitions, 734 flow. Second operand 4 states and 694 transitions. [2021-03-25 14:38:58,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 710 flow [2021-03-25 14:38:58,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 88 transitions, 618 flow, removed 23 selfloop flow, removed 12 redundant places. [2021-03-25 14:38:58,625 INFO L241 Difference]: Finished difference. Result has 75 places, 68 transitions, 456 flow [2021-03-25 14:38:58,625 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=456, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2021-03-25 14:38:58,625 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 20 predicate places. [2021-03-25 14:38:58,625 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:58,625 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 68 transitions, 456 flow [2021-03-25 14:38:58,626 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 68 transitions, 456 flow [2021-03-25 14:38:58,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 68 transitions, 456 flow [2021-03-25 14:38:58,735 INFO L129 PetriNetUnfolder]: 671/1439 cut-off events. [2021-03-25 14:38:58,735 INFO L130 PetriNetUnfolder]: For 2203/2898 co-relation queries the response was YES. [2021-03-25 14:38:58,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 1439 events. 671/1439 cut-off events. For 2203/2898 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 10933 event pairs, 32 based on Foata normal form. 45/1323 useless extension candidates. Maximal degree in co-relation 4633. Up to 390 conditions per place. [2021-03-25 14:38:58,753 INFO L142 LiptonReduction]: Number of co-enabled transitions 1102 [2021-03-25 14:38:58,793 INFO L154 LiptonReduction]: Checked pairs total: 48 [2021-03-25 14:38:58,793 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:38:58,793 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 168 [2021-03-25 14:38:58,793 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 457 flow [2021-03-25 14:38:58,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:58,794 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:58,794 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-25 14:38:58,794 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:38:58,794 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:58,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:58,794 INFO L82 PathProgramCache]: Analyzing trace with hash 512741378, now seen corresponding path program 1 times [2021-03-25 14:38:58,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:58,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330785216] [2021-03-25 14:38:58,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:38:58,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:58,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:38:58,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:58,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:58,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:38:58,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:38:58,851 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-25 14:38:58,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330785216] [2021-03-25 14:38:58,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:38:58,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:38:58,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34346463] [2021-03-25 14:38:58,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:38:58,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:38:58,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:38:58,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:38:58,853 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 203 [2021-03-25 14:38:58,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 457 flow. Second operand has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:58,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:38:58,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 203 [2021-03-25 14:38:58,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:38:59,076 INFO L129 PetriNetUnfolder]: 1019/2197 cut-off events. [2021-03-25 14:38:59,077 INFO L130 PetriNetUnfolder]: For 4023/4816 co-relation queries the response was YES. [2021-03-25 14:38:59,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7122 conditions, 2197 events. 1019/2197 cut-off events. For 4023/4816 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 17825 event pairs, 32 based on Foata normal form. 108/2127 useless extension candidates. Maximal degree in co-relation 7091. Up to 614 conditions per place. [2021-03-25 14:38:59,093 INFO L132 encePairwiseOnDemand]: 199/203 looper letters, 3 selfloop transitions, 1 changer transitions 21/69 dead transitions. [2021-03-25 14:38:59,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 477 flow [2021-03-25 14:38:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:38:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:38:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 715 transitions. [2021-03-25 14:38:59,096 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8805418719211823 [2021-03-25 14:38:59,096 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 715 transitions. [2021-03-25 14:38:59,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 715 transitions. [2021-03-25 14:38:59,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:38:59,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 715 transitions. [2021-03-25 14:38:59,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:59,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:59,112 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:59,112 INFO L185 Difference]: Start difference. First operand has 71 places, 68 transitions, 457 flow. Second operand 4 states and 715 transitions. [2021-03-25 14:38:59,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 477 flow [2021-03-25 14:38:59,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 453 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-03-25 14:38:59,181 INFO L241 Difference]: Finished difference. Result has 71 places, 48 transitions, 295 flow [2021-03-25 14:38:59,182 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2021-03-25 14:38:59,182 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2021-03-25 14:38:59,182 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:38:59,182 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 48 transitions, 295 flow [2021-03-25 14:38:59,182 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 48 transitions, 295 flow [2021-03-25 14:38:59,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 48 transitions, 295 flow [2021-03-25 14:38:59,214 INFO L129 PetriNetUnfolder]: 167/396 cut-off events. [2021-03-25 14:38:59,215 INFO L130 PetriNetUnfolder]: For 628/763 co-relation queries the response was YES. [2021-03-25 14:38:59,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 396 events. 167/396 cut-off events. For 628/763 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2192 event pairs, 7 based on Foata normal form. 28/399 useless extension candidates. Maximal degree in co-relation 1222. Up to 118 conditions per place. [2021-03-25 14:38:59,219 INFO L142 LiptonReduction]: Number of co-enabled transitions 522 [2021-03-25 14:38:59,394 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:38:59,768 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 14:38:59,885 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 14:38:59,953 INFO L154 LiptonReduction]: Checked pairs total: 124 [2021-03-25 14:38:59,953 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:38:59,953 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 771 [2021-03-25 14:38:59,954 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 295 flow [2021-03-25 14:38:59,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:38:59,954 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:38:59,954 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-25 14:38:59,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:38:59,954 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:38:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:38:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1706568100, now seen corresponding path program 2 times [2021-03-25 14:38:59,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:38:59,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590480288] [2021-03-25 14:38:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:38:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:39:00,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:39:00,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:39:00,051 INFO L142 QuantifierPusher]: treesize reduction 9, result has 76.9 percent of original size [2021-03-25 14:39:00,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 14:39:00,074 INFO L142 QuantifierPusher]: treesize reduction 17, result has 76.4 percent of original size [2021-03-25 14:39:00,075 INFO L147 QuantifierPusher]: treesize reduction 9, result has 83.6 percent of original size 46 [2021-03-25 14:39:00,118 INFO L142 QuantifierPusher]: treesize reduction 17, result has 77.3 percent of original size [2021-03-25 14:39:00,120 INFO L147 QuantifierPusher]: treesize reduction 9, result has 84.5 percent of original size 49 [2021-03-25 14:39:00,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:39:00,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:39:00,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:39:00,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:39:00,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:39:00,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:39:00,250 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-25 14:39:00,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590480288] [2021-03-25 14:39:00,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:39:00,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 14:39:00,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740134479] [2021-03-25 14:39:00,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 14:39:00,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:39:00,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 14:39:00,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 14:39:00,254 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 206 [2021-03-25 14:39:00,255 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 295 flow. Second operand has 9 states, 9 states have (on average 146.88888888888889) internal successors, (1322), 9 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:39:00,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:39:00,255 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 206 [2021-03-25 14:39:00,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:39:00,549 INFO L129 PetriNetUnfolder]: 231/541 cut-off events. [2021-03-25 14:39:00,549 INFO L130 PetriNetUnfolder]: For 1123/1331 co-relation queries the response was YES. [2021-03-25 14:39:00,551 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 541 events. 231/541 cut-off events. For 1123/1331 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3322 event pairs, 11 based on Foata normal form. 71/576 useless extension candidates. Maximal degree in co-relation 1825. Up to 177 conditions per place. [2021-03-25 14:39:00,556 INFO L132 encePairwiseOnDemand]: 198/206 looper letters, 17 selfloop transitions, 13 changer transitions 8/66 dead transitions. [2021-03-25 14:39:00,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 515 flow [2021-03-25 14:39:00,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:39:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:39:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1196 transitions. [2021-03-25 14:39:00,560 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7257281553398058 [2021-03-25 14:39:00,560 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1196 transitions. [2021-03-25 14:39:00,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1196 transitions. [2021-03-25 14:39:00,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:39:00,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1196 transitions. [2021-03-25 14:39:00,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 149.5) internal successors, (1196), 8 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:39:00,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:39:00,566 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:39:00,566 INFO L185 Difference]: Start difference. First operand has 64 places, 46 transitions, 295 flow. Second operand 8 states and 1196 transitions. [2021-03-25 14:39:00,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 515 flow [2021-03-25 14:39:00,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 66 transitions, 464 flow, removed 19 selfloop flow, removed 9 redundant places. [2021-03-25 14:39:00,574 INFO L241 Difference]: Finished difference. Result has 65 places, 52 transitions, 347 flow [2021-03-25 14:39:00,574 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=347, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2021-03-25 14:39:00,574 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 10 predicate places. [2021-03-25 14:39:00,574 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:39:00,574 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 52 transitions, 347 flow [2021-03-25 14:39:00,575 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 52 transitions, 347 flow [2021-03-25 14:39:00,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 52 transitions, 347 flow [2021-03-25 14:39:00,605 INFO L129 PetriNetUnfolder]: 147/367 cut-off events. [2021-03-25 14:39:00,606 INFO L130 PetriNetUnfolder]: For 744/801 co-relation queries the response was YES. [2021-03-25 14:39:00,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 367 events. 147/367 cut-off events. For 744/801 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2092 event pairs, 2 based on Foata normal form. 27/380 useless extension candidates. Maximal degree in co-relation 1227. Up to 117 conditions per place. [2021-03-25 14:39:00,610 INFO L142 LiptonReduction]: Number of co-enabled transitions 468 [2021-03-25 14:39:00,921 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-25 14:39:01,053 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-25 14:39:01,071 INFO L154 LiptonReduction]: Checked pairs total: 42 [2021-03-25 14:39:01,071 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:39:01,071 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 497 [2021-03-25 14:39:01,072 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 349 flow [2021-03-25 14:39:01,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 146.88888888888889) internal successors, (1322), 9 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:39:01,073 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:39:01,073 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-25 14:39:01,073 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:39:01,073 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:39:01,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:39:01,073 INFO L82 PathProgramCache]: Analyzing trace with hash 630094829, now seen corresponding path program 1 times [2021-03-25 14:39:01,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:39:01,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992829817] [2021-03-25 14:39:01,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:39:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:39:01,103 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:39:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:39:01,136 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:39:01,185 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:39:01,185 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:39:01,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:39:01,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:39:01 BasicIcfg [2021-03-25 14:39:01,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:39:01,285 INFO L168 Benchmark]: Toolchain (without parser) took 31591.49 ms. Allocated memory was 343.9 MB in the beginning and 994.1 MB in the end (delta: 650.1 MB). Free memory was 306.8 MB in the beginning and 725.9 MB in the end (delta: -419.1 MB). Peak memory consumption was 233.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:39:01,289 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 343.9 MB. Free memory is still 324.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:39:01,289 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.89 ms. Allocated memory is still 343.9 MB. Free memory was 306.5 MB in the beginning and 303.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:39:01,289 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.46 ms. Allocated memory is still 343.9 MB. Free memory was 303.2 MB in the beginning and 300.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:39:01,289 INFO L168 Benchmark]: Boogie Preprocessor took 30.73 ms. Allocated memory is still 343.9 MB. Free memory was 300.0 MB in the beginning and 297.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:39:01,289 INFO L168 Benchmark]: RCFGBuilder took 1994.01 ms. Allocated memory is still 343.9 MB. Free memory was 297.9 MB in the beginning and 214.0 MB in the end (delta: 84.0 MB). Peak memory consumption was 147.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:39:01,290 INFO L168 Benchmark]: TraceAbstraction took 29015.15 ms. Allocated memory was 343.9 MB in the beginning and 994.1 MB in the end (delta: 650.1 MB). Free memory was 212.9 MB in the beginning and 725.9 MB in the end (delta: -512.9 MB). Peak memory consumption was 137.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:39:01,291 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.12 ms. Allocated memory is still 343.9 MB. Free memory is still 324.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 498.89 ms. Allocated memory is still 343.9 MB. Free memory was 306.5 MB in the beginning and 303.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.46 ms. Allocated memory is still 343.9 MB. Free memory was 303.2 MB in the beginning and 300.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.73 ms. Allocated memory is still 343.9 MB. Free memory was 300.0 MB in the beginning and 297.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1994.01 ms. Allocated memory is still 343.9 MB. Free memory was 297.9 MB in the beginning and 214.0 MB in the end (delta: 84.0 MB). Peak memory consumption was 147.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 29015.15 ms. Allocated memory was 343.9 MB in the beginning and 994.1 MB in the end (delta: 650.1 MB). Free memory was 212.9 MB in the beginning and 725.9 MB in the end (delta: -512.9 MB). Peak memory consumption was 137.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9016.3ms, 122 PlacesBefore, 55 PlacesAfterwards, 111 TransitionsBefore, 43 TransitionsAfterwards, 2664 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5269 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2268, positive: 2145, positive conditional: 0, positive unconditional: 2145, negative: 123, negative conditional: 0, negative unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1620, positive: 1572, positive conditional: 0, positive unconditional: 1572, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1620, positive: 1572, positive conditional: 0, positive unconditional: 1572, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1620, positive: 1560, positive conditional: 0, positive unconditional: 1560, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 879, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 841, negative conditional: 0, negative unconditional: 841, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2268, positive: 573, positive conditional: 0, positive unconditional: 573, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 1620, unknown conditional: 0, unknown unconditional: 1620] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3062.5ms, 51 PlacesBefore, 40 PlacesAfterwards, 36 TransitionsBefore, 29 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 4 FixpointIterations, 6 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 2104 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 667, positive: 556, positive conditional: 0, positive unconditional: 556, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 70, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 332, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 317, negative conditional: 0, negative unconditional: 317, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 667, positive: 507, positive conditional: 0, positive unconditional: 507, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 70, unknown conditional: 0, unknown unconditional: 70] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 175, Positive conditional cache size: 0, Positive unconditional cache size: 175, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 964.3ms, 41 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 960 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 277, positive: 229, positive conditional: 0, positive unconditional: 229, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 277, positive: 229, positive conditional: 0, positive unconditional: 229, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 175, Positive conditional cache size: 0, Positive unconditional cache size: 175, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.8ms, 44 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 626 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 331 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 175, Positive conditional cache size: 0, Positive unconditional cache size: 175, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.7ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 626 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 380 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 125, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 125, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 182, Positive conditional cache size: 0, Positive unconditional cache size: 182, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.2ms, 49 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 399 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 110, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 110, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 182, Positive conditional cache size: 0, Positive unconditional cache size: 182, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 162.4ms, 52 PlacesBefore, 52 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 469 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 123, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 24, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 123, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 182, Positive conditional cache size: 0, Positive unconditional cache size: 182, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 401.2ms, 57 PlacesBefore, 57 PlacesAfterwards, 58 TransitionsBefore, 57 TransitionsAfterwards, 1048 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 980 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 294, positive: 268, positive conditional: 0, positive unconditional: 268, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 294, positive: 255, positive conditional: 0, positive unconditional: 255, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 480.4ms, 61 PlacesBefore, 61 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 1130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1044 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 355, positive: 329, positive conditional: 0, positive unconditional: 329, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 20, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 355, positive: 309, positive conditional: 0, positive unconditional: 309, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 188, Positive conditional cache size: 0, Positive unconditional cache size: 188, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 840.4ms, 71 PlacesBefore, 71 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1522 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 439 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 113, positive: 104, positive conditional: 0, positive unconditional: 104, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 113, positive: 104, positive conditional: 0, positive unconditional: 104, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 188, Positive conditional cache size: 0, Positive unconditional cache size: 188, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 739.7ms, 75 PlacesBefore, 75 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1522 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 394 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 32, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 188, Positive conditional cache size: 0, Positive unconditional cache size: 188, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 293.9ms, 82 PlacesBefore, 82 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 1664 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 636 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 254, positive: 240, positive conditional: 0, positive unconditional: 240, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 254, positive: 240, positive conditional: 0, positive unconditional: 240, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 188, Positive conditional cache size: 0, Positive unconditional cache size: 188, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3675.7ms, 89 PlacesBefore, 86 PlacesAfterwards, 95 TransitionsBefore, 91 TransitionsAfterwards, 1614 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 1495 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1087, positive: 1057, positive conditional: 0, positive unconditional: 1057, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 12, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 1087, positive: 1045, positive conditional: 0, positive unconditional: 1045, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 167.4ms, 75 PlacesBefore, 71 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 1102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 48 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 42, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 771.0ms, 71 PlacesBefore, 64 PlacesAfterwards, 48 TransitionsBefore, 46 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 105, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 105, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 496.8ms, 65 PlacesBefore, 62 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 42, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1483; [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t1484; [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L798] 3 y = 1 [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 4 z = 2 [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L751] 1 x = 1 [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L784] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L786] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L788] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L808] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L824] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L824] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L824] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L870] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L871] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L871] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L872] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L873] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L873] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L875] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L875] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 28789.4ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 5099.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9123.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 71 SDtfs, 62 SDslu, 33 SDs, 0 SdLazy, 615 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 679.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 725.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=11, 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: 56.0ms SsaConstructionTime, 654.1ms SatisfiabilityAnalysisTime, 1333.5ms InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 2080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...