/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/thin000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 15:05:04,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 15:05:04,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 15:05:04,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 15:05:04,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 15:05:04,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 15:05:04,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 15:05:04,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 15:05:04,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 15:05:04,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 15:05:04,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 15:05:04,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 15:05:04,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 15:05:04,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 15:05:04,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 15:05:04,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 15:05:04,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 15:05:04,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 15:05:04,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 15:05:04,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 15:05:04,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 15:05:04,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 15:05:04,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 15:05:04,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 15:05:04,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 15:05:04,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 15:05:04,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 15:05:04,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 15:05:04,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 15:05:04,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 15:05:04,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 15:05:04,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 15:05:04,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 15:05:04,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 15:05:04,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 15:05:04,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 15:05:04,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 15:05:04,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 15:05:04,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 15:05:04,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 15:05:04,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 15:05:04,613 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 15:05:04,644 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 15:05:04,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 15:05:04,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 15:05:04,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 15:05:04,648 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 15:05:04,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 15:05:04,649 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 15:05:04,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 15:05:04,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 15:05:04,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 15:05:04,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 15:05:04,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 15:05:04,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 15:05:04,650 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 15:05:04,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 15:05:04,651 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 15:05:04,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 15:05:04,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 15:05:04,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 15:05:04,651 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 15:05:04,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 15:05:04,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 15:05:04,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 15:05:04,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 15:05:04,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 15:05:04,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 15:05:04,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 15:05:04,652 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 15:05:04,653 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 15:05:04,653 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 15:05:04,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 15:05:04,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 15:05:04,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 15:05:04,987 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 15:05:04,989 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 15:05:04,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin000_rmo.oepc.i [2021-03-25 15:05:05,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a92ffed7/b96a2fdfc916448a9c976f7334002cc8/FLAG31883c699 [2021-03-25 15:05:05,609 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 15:05:05,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin000_rmo.oepc.i [2021-03-25 15:05:05,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a92ffed7/b96a2fdfc916448a9c976f7334002cc8/FLAG31883c699 [2021-03-25 15:05:05,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a92ffed7/b96a2fdfc916448a9c976f7334002cc8 [2021-03-25 15:05:05,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 15:05:05,913 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 15:05:05,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 15:05:05,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 15:05:05,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 15:05:05,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:05:05" (1/1) ... [2021-03-25 15:05:05,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a12e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:05, skipping insertion in model container [2021-03-25 15:05:05,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:05:05" (1/1) ... [2021-03-25 15:05:05,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 15:05:05,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 15:05:06,114 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/thin000_rmo.oepc.i[993,1006] [2021-03-25 15:05:06,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 15:05:06,342 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 15:05:06,353 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/thin000_rmo.oepc.i[993,1006] [2021-03-25 15:05:06,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 15:05:06,455 INFO L208 MainTranslator]: Completed translation [2021-03-25 15:05:06,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:06 WrapperNode [2021-03-25 15:05:06,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 15:05:06,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 15:05:06,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 15:05:06,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 15:05:06,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:06" (1/1) ... [2021-03-25 15:05:06,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:06" (1/1) ... [2021-03-25 15:05:06,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 15:05:06,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 15:05:06,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 15:05:06,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 15:05:06,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:06" (1/1) ... [2021-03-25 15:05:06,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:06" (1/1) ... [2021-03-25 15:05:06,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:06" (1/1) ... [2021-03-25 15:05:06,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:06" (1/1) ... [2021-03-25 15:05:06,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:06" (1/1) ... [2021-03-25 15:05:06,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:06" (1/1) ... [2021-03-25 15:05:06,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:06" (1/1) ... [2021-03-25 15:05:06,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 15:05:06,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 15:05:06,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 15:05:06,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 15:05:06,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:06" (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 15:05:06,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 15:05:06,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 15:05:06,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 15:05:06,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 15:05:06,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 15:05:06,600 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 15:05:06,600 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 15:05:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 15:05:06,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 15:05:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 15:05:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 15:05:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 15:05:06,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 15:05:06,603 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 15:05:08,303 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 15:05:08,303 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-25 15:05:08,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:05:08 BoogieIcfgContainer [2021-03-25 15:05:08,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 15:05:08,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 15:05:08,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 15:05:08,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 15:05:08,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 03:05:05" (1/3) ... [2021-03-25 15:05:08,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638fcc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:05:08, skipping insertion in model container [2021-03-25 15:05:08,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:05:06" (2/3) ... [2021-03-25 15:05:08,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638fcc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:05:08, skipping insertion in model container [2021-03-25 15:05:08,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:05:08" (3/3) ... [2021-03-25 15:05:08,313 INFO L111 eAbstractionObserver]: Analyzing ICFG thin000_rmo.oepc.i [2021-03-25 15:05:08,319 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 15:05:08,323 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 15:05:08,323 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 15:05:08,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,359 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,359 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,374 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,374 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,381 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,382 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,385 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,385 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:05:08,387 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 15:05:08,404 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-03-25 15:05:08,421 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 15:05:08,422 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 15:05:08,422 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 15:05:08,422 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 15:05:08,422 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 15:05:08,422 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 15:05:08,422 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 15:05:08,422 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 15:05:08,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 200 flow [2021-03-25 15:05:08,464 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-25 15:05:08,464 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:05:08,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2021-03-25 15:05:08,467 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 95 transitions, 200 flow [2021-03-25 15:05:08,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 83 transitions, 172 flow [2021-03-25 15:05:08,473 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:05:08,484 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 83 transitions, 172 flow [2021-03-25 15:05:08,487 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 83 transitions, 172 flow [2021-03-25 15:05:08,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 83 transitions, 172 flow [2021-03-25 15:05:08,503 INFO L129 PetriNetUnfolder]: 1/83 cut-off events. [2021-03-25 15:05:08,504 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:05:08,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 1/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2021-03-25 15:05:08,506 INFO L142 LiptonReduction]: Number of co-enabled transitions 522 [2021-03-25 15:05:09,130 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-25 15:05:09,646 WARN L205 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 99 [2021-03-25 15:05:09,805 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-03-25 15:05:11,570 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2021-03-25 15:05:11,895 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-03-25 15:05:13,205 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2021-03-25 15:05:13,811 WARN L205 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-03-25 15:05:15,982 INFO L154 LiptonReduction]: Checked pairs total: 934 [2021-03-25 15:05:15,982 INFO L156 LiptonReduction]: Total number of compositions: 62 [2021-03-25 15:05:15,984 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7512 [2021-03-25 15:05:15,995 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 15:05:15,995 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:05:15,995 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:05:15,996 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:05:15,997 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:05:16,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:05:16,002 INFO L82 PathProgramCache]: Analyzing trace with hash 926955671, now seen corresponding path program 1 times [2021-03-25 15:05:16,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:05:16,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218513532] [2021-03-25 15:05:16,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:05:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:05:16,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:05:16,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:05:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:05:16,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218513532] [2021-03-25 15:05:16,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:05:16,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 15:05:16,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240662097] [2021-03-25 15:05:16,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-03-25 15:05:16,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:05:16,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-03-25 15:05:16,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-03-25 15:05:16,280 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 157 [2021-03-25 15:05:16,286 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 60 flow. Second operand has 2 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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 15:05:16,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:05:16,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 157 [2021-03-25 15:05:16,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:05:16,305 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-25 15:05:16,306 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:05:16,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 17 event pairs, 0 based on Foata normal form. 1/26 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-03-25 15:05:16,307 INFO L132 encePairwiseOnDemand]: 156/157 looper letters, 0 selfloop transitions, 0 changer transitions 1/26 dead transitions. [2021-03-25 15:05:16,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 58 flow [2021-03-25 15:05:16,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-03-25 15:05:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-03-25 15:05:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 303 transitions. [2021-03-25 15:05:16,323 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.964968152866242 [2021-03-25 15:05:16,324 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 303 transitions. [2021-03-25 15:05:16,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 303 transitions. [2021-03-25 15:05:16,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:05:16,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 303 transitions. [2021-03-25 15:05:16,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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 15:05:16,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 15:05:16,341 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 15:05:16,343 INFO L185 Difference]: Start difference. First operand has 33 places, 27 transitions, 60 flow. Second operand 2 states and 303 transitions. [2021-03-25 15:05:16,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 58 flow [2021-03-25 15:05:16,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 15:05:16,351 INFO L241 Difference]: Finished difference. Result has 32 places, 25 transitions, 54 flow [2021-03-25 15:05:16,353 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2021-03-25 15:05:16,353 INFO L343 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2021-03-25 15:05:16,353 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:05:16,354 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 54 flow [2021-03-25 15:05:16,355 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 54 flow [2021-03-25 15:05:16,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 54 flow [2021-03-25 15:05:16,364 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-25 15:05:16,364 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:05:16,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-03-25 15:05:16,366 INFO L142 LiptonReduction]: Number of co-enabled transitions 92 [2021-03-25 15:05:18,309 INFO L154 LiptonReduction]: Checked pairs total: 410 [2021-03-25 15:05:18,309 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-25 15:05:18,309 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1956 [2021-03-25 15:05:18,311 INFO L480 AbstractCegarLoop]: Abstraction has has 21 places, 16 transitions, 36 flow [2021-03-25 15:05:18,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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 15:05:18,311 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:05:18,311 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:05:18,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 15:05:18,312 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:05:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:05:18,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1745045817, now seen corresponding path program 1 times [2021-03-25 15:05:18,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:05:18,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388196944] [2021-03-25 15:05:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:05:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:05:18,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:05:18,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:05:18,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:05:18,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:05:18,509 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 15:05:18,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388196944] [2021-03-25 15:05:18,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:05:18,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:05:18,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869287560] [2021-03-25 15:05:18,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 15:05:18,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:05:18,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 15:05:18,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 15:05:18,513 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 166 [2021-03-25 15:05:18,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 16 transitions, 36 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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 15:05:18,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:05:18,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 166 [2021-03-25 15:05:18,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:05:18,536 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-25 15:05:18,537 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:05:18,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 1/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:05:18,537 INFO L132 encePairwiseOnDemand]: 163/166 looper letters, 1 selfloop transitions, 2 changer transitions 0/16 dead transitions. [2021-03-25 15:05:18,537 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 16 transitions, 42 flow [2021-03-25 15:05:18,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:05:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:05:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2021-03-25 15:05:18,540 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9116465863453815 [2021-03-25 15:05:18,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2021-03-25 15:05:18,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2021-03-25 15:05:18,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:05:18,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2021-03-25 15:05:18,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states 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 15:05:18,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 15:05:18,545 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 15:05:18,545 INFO L185 Difference]: Start difference. First operand has 21 places, 16 transitions, 36 flow. Second operand 3 states and 454 transitions. [2021-03-25 15:05:18,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 16 transitions, 42 flow [2021-03-25 15:05:18,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 16 transitions, 42 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 15:05:18,546 INFO L241 Difference]: Finished difference. Result has 24 places, 16 transitions, 44 flow [2021-03-25 15:05:18,546 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2021-03-25 15:05:18,547 INFO L343 CegarLoopForPetriNet]: 33 programPoint places, -9 predicate places. [2021-03-25 15:05:18,548 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:05:18,548 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 16 transitions, 44 flow [2021-03-25 15:05:18,548 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 44 flow [2021-03-25 15:05:18,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 44 flow [2021-03-25 15:05:18,553 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-25 15:05:18,554 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 15:05:18,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 0/16 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:05:18,554 INFO L142 LiptonReduction]: Number of co-enabled transitions 76 [2021-03-25 15:05:18,748 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 15:05:18,893 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 15:05:19,034 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 15:05:19,151 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 15:05:19,608 WARN L205 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 149 [2021-03-25 15:05:19,835 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2021-03-25 15:05:20,291 WARN L205 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 149 [2021-03-25 15:05:20,505 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2021-03-25 15:05:20,512 INFO L154 LiptonReduction]: Checked pairs total: 261 [2021-03-25 15:05:20,512 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 15:05:20,512 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1964 [2021-03-25 15:05:20,513 INFO L480 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 40 flow [2021-03-25 15:05:20,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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 15:05:20,514 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:05:20,514 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:05:20,514 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 15:05:20,514 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:05:20,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:05:20,515 INFO L82 PathProgramCache]: Analyzing trace with hash 850329246, now seen corresponding path program 1 times [2021-03-25 15:05:20,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:05:20,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827086032] [2021-03-25 15:05:20,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:05:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:05:20,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:05:20,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:05:20,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:05:20,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:05:20,583 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 15:05:20,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827086032] [2021-03-25 15:05:20,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:05:20,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:05:20,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60978152] [2021-03-25 15:05:20,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:05:20,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:05:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:05:20,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:05:20,594 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 168 [2021-03-25 15:05:20,595 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states 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 15:05:20,595 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:05:20,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 168 [2021-03-25 15:05:20,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:05:20,612 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-25 15:05:20,612 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 15:05:20,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 14 events. 0/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 1/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:05:20,613 INFO L132 encePairwiseOnDemand]: 165/168 looper letters, 1 selfloop transitions, 2 changer transitions 0/14 dead transitions. [2021-03-25 15:05:20,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 14 transitions, 46 flow [2021-03-25 15:05:20,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:05:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:05:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2021-03-25 15:05:20,614 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8650793650793651 [2021-03-25 15:05:20,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2021-03-25 15:05:20,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2021-03-25 15:05:20,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:05:20,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2021-03-25 15:05:20,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states 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 15:05:20,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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 15:05:20,617 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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 15:05:20,617 INFO L185 Difference]: Start difference. First operand has 22 places, 14 transitions, 40 flow. Second operand 3 states and 436 transitions. [2021-03-25 15:05:20,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 14 transitions, 46 flow [2021-03-25 15:05:20,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 14 transitions, 42 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 15:05:20,618 INFO L241 Difference]: Finished difference. Result has 23 places, 14 transitions, 44 flow [2021-03-25 15:05:20,618 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=23, PETRI_TRANSITIONS=14} [2021-03-25 15:05:20,618 INFO L343 CegarLoopForPetriNet]: 33 programPoint places, -10 predicate places. [2021-03-25 15:05:20,619 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:05:20,619 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 14 transitions, 44 flow [2021-03-25 15:05:20,620 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 14 transitions, 44 flow [2021-03-25 15:05:20,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 23 places, 14 transitions, 44 flow [2021-03-25 15:05:20,624 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-25 15:05:20,624 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 15:05:20,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 14 events. 0/14 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:05:20,624 INFO L142 LiptonReduction]: Number of co-enabled transitions 74 [2021-03-25 15:05:20,800 INFO L154 LiptonReduction]: Checked pairs total: 78 [2021-03-25 15:05:20,800 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:05:20,800 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 181 [2021-03-25 15:05:20,801 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 14 transitions, 44 flow [2021-03-25 15:05:20,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states 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 15:05:20,801 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:05:20,802 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:05:20,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 15:05:20,802 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:05:20,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:05:20,802 INFO L82 PathProgramCache]: Analyzing trace with hash -952103477, now seen corresponding path program 1 times [2021-03-25 15:05:20,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:05:20,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748553297] [2021-03-25 15:05:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:05:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:05:20,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:05:20,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:05:20,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:05:20,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:05:20,887 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 15:05:20,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748553297] [2021-03-25 15:05:20,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:05:20,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:05:20,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189985613] [2021-03-25 15:05:20,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:05:20,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:05:20,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:05:20,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:05:20,889 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 168 [2021-03-25 15:05:20,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 14 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states 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 15:05:20,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:05:20,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 168 [2021-03-25 15:05:20,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:05:20,910 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-25 15:05:20,910 INFO L130 PetriNetUnfolder]: For 7/9 co-relation queries the response was YES. [2021-03-25 15:05:20,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 20 events. 0/20 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 3/23 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 15:05:20,911 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 1 selfloop transitions, 3 changer transitions 1/15 dead transitions. [2021-03-25 15:05:20,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 15 transitions, 57 flow [2021-03-25 15:05:20,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:05:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:05:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2021-03-25 15:05:20,913 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8675595238095238 [2021-03-25 15:05:20,913 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2021-03-25 15:05:20,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2021-03-25 15:05:20,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:05:20,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2021-03-25 15:05:20,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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 15:05:20,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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 15:05:20,917 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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 15:05:20,917 INFO L185 Difference]: Start difference. First operand has 23 places, 14 transitions, 44 flow. Second operand 4 states and 583 transitions. [2021-03-25 15:05:20,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 15 transitions, 57 flow [2021-03-25 15:05:20,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 15 transitions, 53 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 15:05:20,918 INFO L241 Difference]: Finished difference. Result has 26 places, 14 transitions, 54 flow [2021-03-25 15:05:20,918 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=26, PETRI_TRANSITIONS=14} [2021-03-25 15:05:20,918 INFO L343 CegarLoopForPetriNet]: 33 programPoint places, -7 predicate places. [2021-03-25 15:05:20,918 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:05:20,919 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 14 transitions, 54 flow [2021-03-25 15:05:20,919 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 14 transitions, 54 flow [2021-03-25 15:05:20,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 14 transitions, 54 flow [2021-03-25 15:05:20,922 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-25 15:05:20,922 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 15:05:20,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 14 events. 0/14 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:05:20,923 INFO L142 LiptonReduction]: Number of co-enabled transitions 56 [2021-03-25 15:05:21,232 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-03-25 15:05:21,552 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-03-25 15:05:22,227 WARN L205 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2021-03-25 15:05:22,842 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2021-03-25 15:05:22,845 INFO L154 LiptonReduction]: Checked pairs total: 96 [2021-03-25 15:05:22,845 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:05:22,845 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1927 [2021-03-25 15:05:22,846 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 13 transitions, 52 flow [2021-03-25 15:05:22,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states 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 15:05:22,847 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:05:22,847 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:05:22,847 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 15:05:22,847 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:05:22,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:05:22,847 INFO L82 PathProgramCache]: Analyzing trace with hash 703375559, now seen corresponding path program 1 times [2021-03-25 15:05:22,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:05:22,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115976752] [2021-03-25 15:05:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:05:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:05:22,962 INFO L142 QuantifierPusher]: treesize reduction 8, result has 81.4 percent of original size [2021-03-25 15:05:22,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 15:05:22,991 INFO L142 QuantifierPusher]: treesize reduction 8, result has 78.9 percent of original size [2021-03-25 15:05:22,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 15:05:23,017 INFO L142 QuantifierPusher]: treesize reduction 14, result has 67.4 percent of original size [2021-03-25 15:05:23,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 15:05:23,037 INFO L142 QuantifierPusher]: treesize reduction 6, result has 71.4 percent of original size [2021-03-25 15:05:23,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 15:05:23,046 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 15:05:23,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115976752] [2021-03-25 15:05:23,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:05:23,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:05:23,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133064711] [2021-03-25 15:05:23,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:05:23,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:05:23,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:05:23,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:05:23,050 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 169 [2021-03-25 15:05:23,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 13 transitions, 52 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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 15:05:23,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:05:23,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 169 [2021-03-25 15:05:23,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:05:23,150 INFO L129 PetriNetUnfolder]: 5/27 cut-off events. [2021-03-25 15:05:23,150 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-03-25 15:05:23,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 27 events. 5/27 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 1 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 66. Up to 10 conditions per place. [2021-03-25 15:05:23,150 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 7 selfloop transitions, 3 changer transitions 0/16 dead transitions. [2021-03-25 15:05:23,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 16 transitions, 78 flow [2021-03-25 15:05:23,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:05:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:05:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 395 transitions. [2021-03-25 15:05:23,156 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.584319526627219 [2021-03-25 15:05:23,156 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 395 transitions. [2021-03-25 15:05:23,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 395 transitions. [2021-03-25 15:05:23,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:05:23,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 395 transitions. [2021-03-25 15:05:23,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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 15:05:23,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states 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 15:05:23,159 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states 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 15:05:23,159 INFO L185 Difference]: Start difference. First operand has 25 places, 13 transitions, 52 flow. Second operand 4 states and 395 transitions. [2021-03-25 15:05:23,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 16 transitions, 78 flow [2021-03-25 15:05:23,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 16 transitions, 62 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-25 15:05:23,161 INFO L241 Difference]: Finished difference. Result has 24 places, 13 transitions, 46 flow [2021-03-25 15:05:23,161 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=46, PETRI_PLACES=24, PETRI_TRANSITIONS=13} [2021-03-25 15:05:23,161 INFO L343 CegarLoopForPetriNet]: 33 programPoint places, -9 predicate places. [2021-03-25 15:05:23,161 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:05:23,161 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 13 transitions, 46 flow [2021-03-25 15:05:23,162 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 13 transitions, 46 flow [2021-03-25 15:05:23,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 13 transitions, 46 flow [2021-03-25 15:05:23,165 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-25 15:05:23,165 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 15:05:23,165 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 13 events. 0/13 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:05:23,166 INFO L142 LiptonReduction]: Number of co-enabled transitions 46 [2021-03-25 15:05:25,910 INFO L154 LiptonReduction]: Checked pairs total: 73 [2021-03-25 15:05:25,910 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:05:25,910 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2749 [2021-03-25 15:05:25,910 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 12 transitions, 44 flow [2021-03-25 15:05:25,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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 15:05:25,911 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:05:25,911 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:05:25,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 15:05:25,912 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:05:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:05:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1672585754, now seen corresponding path program 1 times [2021-03-25 15:05:25,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:05:25,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688565718] [2021-03-25 15:05:25,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:05:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:05:25,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:05:25,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:05:25,982 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 15:05:25,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 15:05:25,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:05:25,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:05:25,990 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 15:05:25,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688565718] [2021-03-25 15:05:25,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:05:25,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:05:25,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018085380] [2021-03-25 15:05:25,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:05:25,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:05:25,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:05:25,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:05:25,992 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 170 [2021-03-25 15:05:25,993 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 12 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states 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 15:05:25,993 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:05:25,993 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 170 [2021-03-25 15:05:25,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:05:26,031 INFO L129 PetriNetUnfolder]: 6/29 cut-off events. [2021-03-25 15:05:26,031 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-25 15:05:26,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 29 events. 6/29 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 58 event pairs, 2 based on Foata normal form. 4/32 useless extension candidates. Maximal degree in co-relation 59. Up to 15 conditions per place. [2021-03-25 15:05:26,032 INFO L132 encePairwiseOnDemand]: 165/170 looper letters, 4 selfloop transitions, 3 changer transitions 5/19 dead transitions. [2021-03-25 15:05:26,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 82 flow [2021-03-25 15:05:26,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:05:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:05:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 724 transitions. [2021-03-25 15:05:26,034 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.851764705882353 [2021-03-25 15:05:26,034 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 724 transitions. [2021-03-25 15:05:26,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 724 transitions. [2021-03-25 15:05:26,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:05:26,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 724 transitions. [2021-03-25 15:05:26,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:05:26,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 15:05:26,041 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 15:05:26,042 INFO L185 Difference]: Start difference. First operand has 23 places, 12 transitions, 44 flow. Second operand 5 states and 724 transitions. [2021-03-25 15:05:26,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 82 flow [2021-03-25 15:05:26,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 19 transitions, 72 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-25 15:05:26,044 INFO L241 Difference]: Finished difference. Result has 26 places, 14 transitions, 61 flow [2021-03-25 15:05:26,044 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=61, PETRI_PLACES=26, PETRI_TRANSITIONS=14} [2021-03-25 15:05:26,044 INFO L343 CegarLoopForPetriNet]: 33 programPoint places, -7 predicate places. [2021-03-25 15:05:26,044 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:05:26,044 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 14 transitions, 61 flow [2021-03-25 15:05:26,045 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 14 transitions, 61 flow [2021-03-25 15:05:26,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 14 transitions, 61 flow [2021-03-25 15:05:26,050 INFO L129 PetriNetUnfolder]: 5/24 cut-off events. [2021-03-25 15:05:26,050 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-25 15:05:26,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 24 events. 5/24 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 2 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 54. Up to 12 conditions per place. [2021-03-25 15:05:26,051 INFO L142 LiptonReduction]: Number of co-enabled transitions 26 [2021-03-25 15:05:26,417 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2021-03-25 15:05:26,743 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2021-03-25 15:05:27,438 WARN L205 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-25 15:05:28,095 WARN L205 SmtUtils]: Spent 654.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-25 15:05:28,098 INFO L154 LiptonReduction]: Checked pairs total: 25 [2021-03-25 15:05:28,098 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:05:28,098 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2054 [2021-03-25 15:05:28,099 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 14 transitions, 62 flow [2021-03-25 15:05:28,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states 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 15:05:28,099 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:05:28,099 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:05:28,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 15:05:28,100 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:05:28,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:05:28,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1902939965, now seen corresponding path program 1 times [2021-03-25 15:05:28,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:05:28,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974303589] [2021-03-25 15:05:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:05:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:05:28,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:05:28,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:05:28,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:05:28,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:05:28,152 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 15:05:28,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 15:05:28,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:05:28,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:05:28,160 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 15:05:28,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974303589] [2021-03-25 15:05:28,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:05:28,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:05:28,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743847138] [2021-03-25 15:05:28,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:05:28,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:05:28,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:05:28,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:05:28,162 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 171 [2021-03-25 15:05:28,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 14 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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 15:05:28,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:05:28,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 171 [2021-03-25 15:05:28,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:05:28,208 INFO L129 PetriNetUnfolder]: 2/20 cut-off events. [2021-03-25 15:05:28,209 INFO L130 PetriNetUnfolder]: For 15/18 co-relation queries the response was YES. [2021-03-25 15:05:28,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 20 events. 2/20 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 4/23 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-25 15:05:28,209 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 2 selfloop transitions, 5 changer transitions 3/17 dead transitions. [2021-03-25 15:05:28,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 17 transitions, 98 flow [2021-03-25 15:05:28,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 15:05:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 15:05:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 864 transitions. [2021-03-25 15:05:28,212 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2021-03-25 15:05:28,212 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 864 transitions. [2021-03-25 15:05:28,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 864 transitions. [2021-03-25 15:05:28,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:05:28,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 864 transitions. [2021-03-25 15:05:28,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.0) internal successors, (864), 6 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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 15:05:28,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states 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 15:05:28,217 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states 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 15:05:28,217 INFO L185 Difference]: Start difference. First operand has 24 places, 14 transitions, 62 flow. Second operand 6 states and 864 transitions. [2021-03-25 15:05:28,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 17 transitions, 98 flow [2021-03-25 15:05:28,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 17 transitions, 81 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-03-25 15:05:28,219 INFO L241 Difference]: Finished difference. Result has 29 places, 14 transitions, 69 flow [2021-03-25 15:05:28,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=69, PETRI_PLACES=29, PETRI_TRANSITIONS=14} [2021-03-25 15:05:28,219 INFO L343 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2021-03-25 15:05:28,219 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:05:28,219 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 14 transitions, 69 flow [2021-03-25 15:05:28,220 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 14 transitions, 69 flow [2021-03-25 15:05:28,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 14 transitions, 69 flow [2021-03-25 15:05:28,225 INFO L129 PetriNetUnfolder]: 1/16 cut-off events. [2021-03-25 15:05:28,225 INFO L130 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2021-03-25 15:05:28,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 16 events. 1/16 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 1/16 useless extension candidates. Maximal degree in co-relation 34. Up to 6 conditions per place. [2021-03-25 15:05:28,225 INFO L142 LiptonReduction]: Number of co-enabled transitions 8 [2021-03-25 15:05:28,496 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2021-03-25 15:05:28,600 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-03-25 15:05:29,010 WARN L205 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2021-03-25 15:05:29,137 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-03-25 15:05:29,273 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-03-25 15:05:29,404 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-03-25 15:05:29,692 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2021-03-25 15:05:29,972 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2021-03-25 15:05:30,274 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-25 15:05:30,408 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-25 15:05:30,559 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2021-03-25 15:05:30,699 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2021-03-25 15:05:30,987 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-25 15:05:31,286 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-25 15:05:31,288 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 15:05:31,289 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 15:05:31,289 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3070 [2021-03-25 15:05:31,289 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 11 transitions, 64 flow [2021-03-25 15:05:31,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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 15:05:31,290 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:05:31,290 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:05:31,290 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 15:05:31,290 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:05:31,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:05:31,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1106007905, now seen corresponding path program 1 times [2021-03-25 15:05:31,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:05:31,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680576074] [2021-03-25 15:05:31,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:05:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 15:05:31,344 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 15:05:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 15:05:31,398 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 15:05:31,439 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 15:05:31,439 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 15:05:31,440 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 15:05:31,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 03:05:31 BasicIcfg [2021-03-25 15:05:31,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 15:05:31,534 INFO L168 Benchmark]: Toolchain (without parser) took 25620.47 ms. Allocated memory was 255.9 MB in the beginning and 627.0 MB in the end (delta: 371.2 MB). Free memory was 234.6 MB in the beginning and 342.2 MB in the end (delta: -107.6 MB). Peak memory consumption was 262.1 MB. Max. memory is 16.0 GB. [2021-03-25 15:05:31,534 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 15:05:31,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 541.87 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 234.6 MB in the beginning and 306.3 MB in the end (delta: -71.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 15:05:31,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.60 ms. Allocated memory is still 346.0 MB. Free memory was 306.3 MB in the beginning and 303.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 15:05:31,535 INFO L168 Benchmark]: Boogie Preprocessor took 29.15 ms. Allocated memory is still 346.0 MB. Free memory was 303.5 MB in the beginning and 302.0 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 15:05:31,535 INFO L168 Benchmark]: RCFGBuilder took 1775.40 ms. Allocated memory is still 346.0 MB. Free memory was 301.4 MB in the beginning and 322.3 MB in the end (delta: -20.9 MB). Peak memory consumption was 67.8 MB. Max. memory is 16.0 GB. [2021-03-25 15:05:31,535 INFO L168 Benchmark]: TraceAbstraction took 23225.80 ms. Allocated memory was 346.0 MB in the beginning and 627.0 MB in the end (delta: 281.0 MB). Free memory was 322.3 MB in the beginning and 342.2 MB in the end (delta: -19.9 MB). Peak memory consumption was 261.1 MB. Max. memory is 16.0 GB. [2021-03-25 15:05:31,537 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.16 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 541.87 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 234.6 MB in the beginning and 306.3 MB in the end (delta: -71.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 42.60 ms. Allocated memory is still 346.0 MB. Free memory was 306.3 MB in the beginning and 303.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.15 ms. Allocated memory is still 346.0 MB. Free memory was 303.5 MB in the beginning and 302.0 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 1775.40 ms. Allocated memory is still 346.0 MB. Free memory was 301.4 MB in the beginning and 322.3 MB in the end (delta: -20.9 MB). Peak memory consumption was 67.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 23225.80 ms. Allocated memory was 346.0 MB in the beginning and 627.0 MB in the end (delta: 281.0 MB). Free memory was 322.3 MB in the beginning and 342.2 MB in the end (delta: -19.9 MB). Peak memory consumption was 261.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: 7495.8ms, 89 PlacesBefore, 33 PlacesAfterwards, 83 TransitionsBefore, 27 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 5 FixpointIterations, 39 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 62 TotalNumberOfCompositions, 934 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 571, positive: 522, positive conditional: 0, positive unconditional: 522, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 380, positive: 353, positive conditional: 0, positive unconditional: 353, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 380, positive: 353, positive conditional: 0, positive unconditional: 353, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 380, positive: 339, positive conditional: 0, positive unconditional: 339, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1221, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 430, negative conditional: 0, negative unconditional: 430, unknown: 733, unknown conditional: 0, unknown unconditional: 733] ], Cache Queries: [ total: 571, positive: 169, positive conditional: 0, positive unconditional: 169, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 380, unknown conditional: 0, unknown unconditional: 380] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1954.1ms, 32 PlacesBefore, 21 PlacesAfterwards, 25 TransitionsBefore, 16 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 410 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 185, positive: 130, positive conditional: 0, positive unconditional: 130, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 792, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 767, unknown conditional: 0, unknown unconditional: 767] ], Cache Queries: [ total: 185, positive: 125, positive conditional: 0, positive unconditional: 125, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1963.8ms, 24 PlacesBefore, 22 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 261 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 36, negative conditional: 0, negative unconditional: 36, 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: 40, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 180.6ms, 23 PlacesBefore, 23 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 174, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 174, negative conditional: 0, negative unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1926.4ms, 26 PlacesBefore, 25 PlacesAfterwards, 14 TransitionsBefore, 13 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 96 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2748.3ms, 24 PlacesBefore, 23 PlacesAfterwards, 13 TransitionsBefore, 12 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 73 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2714, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2714, unknown conditional: 0, unknown unconditional: 2714] ], Cache Queries: [ total: 29, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2053.5ms, 26 PlacesBefore, 24 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 25 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 6, negative conditional: 0, negative unconditional: 6, 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: 10, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3069.0ms, 29 PlacesBefore, 24 PlacesAfterwards, 14 TransitionsBefore, 11 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 3 FixpointIterations, 4 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t2673; [L813] FCALL, FORK 0 pthread_create(&t2673, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 \read(y) [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 [L772] 1 x = 1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L814] 0 pthread_t t2674; [L815] FCALL, FORK 0 pthread_create(&t2674, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 __unbuffered_p1_EAX = x [L787] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L4] COND FALSE 0 !(!cond) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=255, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 23022.5ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 398.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7566.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 20 SDtfs, 5 SDslu, 7 SDs, 0 SdLazy, 73 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 93.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 157.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=7, InterpolantAutomatonStates: 27, 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: 35.3ms SsaConstructionTime, 299.8ms SatisfiabilityAnalysisTime, 525.6ms InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...