/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:43:08,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:43:08,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:43:08,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:43:08,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:43:08,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:43:08,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:43:08,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:43:08,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:43:08,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:43:08,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:43:08,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:43:08,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:43:08,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:43:08,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:43:08,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:43:08,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:43:08,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:43:08,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:43:08,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:43:08,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:43:08,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:43:08,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:43:08,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:43:08,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:43:08,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:43:08,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:43:08,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:43:08,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:43:08,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:43:08,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:43:08,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:43:08,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:43:08,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:43:08,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:43:08,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:43:08,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:43:08,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:43:08,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:43:08,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:43:08,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:43:08,586 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-RepeatedVariableLbe.epf [2021-03-25 04:43:08,619 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:43:08,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:43:08,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:43:08,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:43:08,623 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:43:08,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:43:08,624 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:43:08,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:43:08,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:43:08,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:43:08,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:43:08,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:43:08,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:43:08,626 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:43:08,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:43:08,626 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:43:08,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:43:08,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:43:08,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:43:08,626 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:43:08,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:43:08,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:43:08,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:43:08,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:43:08,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:43:08,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:43:08,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:43:08,628 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:43:08,628 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:43:08,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:43:08,628 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 04:43:08,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:43:08,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:43:08,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:43:08,914 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:43:08,918 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:43:08,920 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i [2021-03-25 04:43:08,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6589635cf/c1f31d6d4af04148a34a37aa6b5efdae/FLAG76e184b5a [2021-03-25 04:43:09,525 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:43:09,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i [2021-03-25 04:43:09,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6589635cf/c1f31d6d4af04148a34a37aa6b5efdae/FLAG76e184b5a [2021-03-25 04:43:09,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6589635cf/c1f31d6d4af04148a34a37aa6b5efdae [2021-03-25 04:43:09,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:43:09,992 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:43:09,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:43:09,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:43:09,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:43:09,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:43:09" (1/1) ... [2021-03-25 04:43:09,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e82db6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:09, skipping insertion in model container [2021-03-25 04:43:09,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:43:09" (1/1) ... [2021-03-25 04:43:10,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:43:10,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:43:10,178 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/mix037_rmo.opt.i[948,961] [2021-03-25 04:43:10,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:43:10,366 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:43:10,375 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/mix037_rmo.opt.i[948,961] [2021-03-25 04:43:10,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:43:10,475 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:43:10,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:10 WrapperNode [2021-03-25 04:43:10,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:43:10,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:43:10,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:43:10,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:43:10,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:10" (1/1) ... [2021-03-25 04:43:10,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:10" (1/1) ... [2021-03-25 04:43:10,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:43:10,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:43:10,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:43:10,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:43:10,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:10" (1/1) ... [2021-03-25 04:43:10,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:10" (1/1) ... [2021-03-25 04:43:10,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:10" (1/1) ... [2021-03-25 04:43:10,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:10" (1/1) ... [2021-03-25 04:43:10,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:10" (1/1) ... [2021-03-25 04:43:10,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:10" (1/1) ... [2021-03-25 04:43:10,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:10" (1/1) ... [2021-03-25 04:43:10,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:43:10,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:43:10,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:43:10,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:43:10,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:10" (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 04:43:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:43:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:43:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:43:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:43:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:43:10,644 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:43:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:43:10,644 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:43:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:43:10,644 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:43:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:43:10,644 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:43:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:43:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:43:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:43:10,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:43:10,646 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 04:43:12,000 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:43:12,000 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:43:12,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:43:12 BoogieIcfgContainer [2021-03-25 04:43:12,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:43:12,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:43:12,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:43:12,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:43:12,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:43:09" (1/3) ... [2021-03-25 04:43:12,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ed5d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:43:12, skipping insertion in model container [2021-03-25 04:43:12,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:10" (2/3) ... [2021-03-25 04:43:12,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ed5d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:43:12, skipping insertion in model container [2021-03-25 04:43:12,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:43:12" (3/3) ... [2021-03-25 04:43:12,008 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_rmo.opt.i [2021-03-25 04:43:12,013 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:43:12,016 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:43:12,017 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:43:12,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,054 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,054 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,055 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,056 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,056 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,056 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,058 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,058 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,058 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,058 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,081 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,081 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,081 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,081 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,082 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,082 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,082 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,083 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,088 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,089 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,089 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,090 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,091 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,091 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,094 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,094 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,098 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,115 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:12,117 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:43:12,133 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:43:12,160 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:43:12,160 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:43:12,160 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:43:12,160 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:43:12,161 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:43:12,161 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:43:12,161 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:43:12,161 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:43:12,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 04:43:12,222 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 04:43:12,223 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:12,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-25 04:43:12,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 04:43:12,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-25 04:43:12,241 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:12,247 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 04:43:12,250 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 04:43:12,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-25 04:43:12,270 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 04:43:12,270 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:12,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-25 04:43:12,274 INFO L142 LiptonReduction]: Number of co-enabled transitions 2488 [2021-03-25 04:43:13,500 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:43:13,870 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:43:14,007 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:43:15,035 INFO L154 LiptonReduction]: Checked pairs total: 4063 [2021-03-25 04:43:15,035 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-25 04:43:15,037 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2798 [2021-03-25 04:43:15,046 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-25 04:43:15,046 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:15,046 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:15,047 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:15,047 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:15,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:15,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1119039953, now seen corresponding path program 1 times [2021-03-25 04:43:15,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:15,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378477799] [2021-03-25 04:43:15,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:15,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:15,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:15,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:15,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:15,252 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 04:43:15,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378477799] [2021-03-25 04:43:15,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:15,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:43:15,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677349926] [2021-03-25 04:43:15,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:43:15,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:43:15,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:43:15,274 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 194 [2021-03-25 04:43:15,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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 04:43:15,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:15,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 194 [2021-03-25 04:43:15,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:15,353 INFO L129 PetriNetUnfolder]: 9/86 cut-off events. [2021-03-25 04:43:15,353 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:15,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 86 events. 9/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 230 event pairs, 3 based on Foata normal form. 5/84 useless extension candidates. Maximal degree in co-relation 99. Up to 17 conditions per place. [2021-03-25 04:43:15,355 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 5 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2021-03-25 04:43:15,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 114 flow [2021-03-25 04:43:15,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:43:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:43:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2021-03-25 04:43:15,373 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9140893470790378 [2021-03-25 04:43:15,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2021-03-25 04:43:15,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2021-03-25 04:43:15,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:15,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2021-03-25 04:43:15,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:15,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states 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 04:43:15,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states 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 04:43:15,393 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 532 transitions. [2021-03-25 04:43:15,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 114 flow [2021-03-25 04:43:15,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:43:15,397 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 96 flow [2021-03-25 04:43:15,399 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2021-03-25 04:43:15,399 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-25 04:43:15,400 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:15,400 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 42 transitions, 96 flow [2021-03-25 04:43:15,401 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 96 flow [2021-03-25 04:43:15,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 96 flow [2021-03-25 04:43:15,415 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-03-25 04:43:15,415 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:15,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:43:15,417 INFO L142 LiptonReduction]: Number of co-enabled transitions 468 [2021-03-25 04:43:15,779 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:43:15,905 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:43:16,660 INFO L154 LiptonReduction]: Checked pairs total: 1840 [2021-03-25 04:43:16,660 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-25 04:43:16,661 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1261 [2021-03-25 04:43:16,661 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2021-03-25 04:43:16,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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 04:43:16,662 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:16,662 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:16,662 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:43:16,662 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:16,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:16,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1795670329, now seen corresponding path program 1 times [2021-03-25 04:43:16,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:16,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951222758] [2021-03-25 04:43:16,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:16,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:16,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:16,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:16,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:16,834 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:43:16,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:43:16,854 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:43:16,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:43:16,860 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 04:43:16,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951222758] [2021-03-25 04:43:16,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:16,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:43:16,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847863247] [2021-03-25 04:43:16,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:43:16,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:43:16,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:43:16,866 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 208 [2021-03-25 04:43:16,867 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states 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 04:43:16,867 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:16,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 208 [2021-03-25 04:43:16,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:17,053 INFO L129 PetriNetUnfolder]: 241/479 cut-off events. [2021-03-25 04:43:17,053 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:17,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 479 events. 241/479 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2420 event pairs, 21 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 866. Up to 157 conditions per place. [2021-03-25 04:43:17,061 INFO L132 encePairwiseOnDemand]: 199/208 looper letters, 9 selfloop transitions, 7 changer transitions 18/53 dead transitions. [2021-03-25 04:43:17,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 186 flow [2021-03-25 04:43:17,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:43:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:43:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1198 transitions. [2021-03-25 04:43:17,065 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8228021978021978 [2021-03-25 04:43:17,066 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1198 transitions. [2021-03-25 04:43:17,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1198 transitions. [2021-03-25 04:43:17,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:17,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1198 transitions. [2021-03-25 04:43:17,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 171.14285714285714) internal successors, (1198), 7 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states 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 04:43:17,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:17,073 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:17,073 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 7 states and 1198 transitions. [2021-03-25 04:43:17,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 186 flow [2021-03-25 04:43:17,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:43:17,075 INFO L241 Difference]: Finished difference. Result has 48 places, 32 transitions, 124 flow [2021-03-25 04:43:17,075 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=124, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2021-03-25 04:43:17,076 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2021-03-25 04:43:17,076 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:17,076 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 32 transitions, 124 flow [2021-03-25 04:43:17,076 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 32 transitions, 124 flow [2021-03-25 04:43:17,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 124 flow [2021-03-25 04:43:17,106 INFO L129 PetriNetUnfolder]: 106/248 cut-off events. [2021-03-25 04:43:17,106 INFO L130 PetriNetUnfolder]: For 103/169 co-relation queries the response was YES. [2021-03-25 04:43:17,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 248 events. 106/248 cut-off events. For 103/169 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1260 event pairs, 58 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 608. Up to 153 conditions per place. [2021-03-25 04:43:17,110 INFO L142 LiptonReduction]: Number of co-enabled transitions 334 [2021-03-25 04:43:17,234 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-25 04:43:17,521 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-25 04:43:17,881 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 04:43:18,068 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 04:43:18,432 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 04:43:18,586 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 04:43:18,593 INFO L154 LiptonReduction]: Checked pairs total: 669 [2021-03-25 04:43:18,593 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:43:18,593 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1517 [2021-03-25 04:43:18,594 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 120 flow [2021-03-25 04:43:18,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states 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 04:43:18,595 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:18,595 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:18,595 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:43:18,595 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:18,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:18,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1462088534, now seen corresponding path program 1 times [2021-03-25 04:43:18,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:18,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156824771] [2021-03-25 04:43:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:18,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:18,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:18,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:18,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:18,692 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:43:18,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:43:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:18,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156824771] [2021-03-25 04:43:18,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:18,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:18,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528272682] [2021-03-25 04:43:18,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:43:18,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:18,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:43:18,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:43:18,704 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 210 [2021-03-25 04:43:18,704 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:18,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:18,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 210 [2021-03-25 04:43:18,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:18,770 INFO L129 PetriNetUnfolder]: 106/285 cut-off events. [2021-03-25 04:43:18,770 INFO L130 PetriNetUnfolder]: For 192/258 co-relation queries the response was YES. [2021-03-25 04:43:18,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 285 events. 106/285 cut-off events. For 192/258 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1461 event pairs, 49 based on Foata normal form. 4/279 useless extension candidates. Maximal degree in co-relation 847. Up to 154 conditions per place. [2021-03-25 04:43:18,772 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 9 selfloop transitions, 14 changer transitions 0/40 dead transitions. [2021-03-25 04:43:18,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 226 flow [2021-03-25 04:43:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:43:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:43:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 699 transitions. [2021-03-25 04:43:18,774 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8321428571428572 [2021-03-25 04:43:18,774 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 699 transitions. [2021-03-25 04:43:18,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 699 transitions. [2021-03-25 04:43:18,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:18,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 699 transitions. [2021-03-25 04:43:18,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:18,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:18,778 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:18,778 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 120 flow. Second operand 4 states and 699 transitions. [2021-03-25 04:43:18,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 226 flow [2021-03-25 04:43:18,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 198 flow, removed 12 selfloop flow, removed 3 redundant places. [2021-03-25 04:43:18,782 INFO L241 Difference]: Finished difference. Result has 44 places, 37 transitions, 193 flow [2021-03-25 04:43:18,783 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2021-03-25 04:43:18,783 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -13 predicate places. [2021-03-25 04:43:18,783 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:18,783 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 193 flow [2021-03-25 04:43:18,784 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 193 flow [2021-03-25 04:43:18,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 193 flow [2021-03-25 04:43:18,818 INFO L129 PetriNetUnfolder]: 104/274 cut-off events. [2021-03-25 04:43:18,819 INFO L130 PetriNetUnfolder]: For 234/301 co-relation queries the response was YES. [2021-03-25 04:43:18,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 274 events. 104/274 cut-off events. For 234/301 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1429 event pairs, 50 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 765. Up to 143 conditions per place. [2021-03-25 04:43:18,822 INFO L142 LiptonReduction]: Number of co-enabled transitions 440 [2021-03-25 04:43:18,832 INFO L154 LiptonReduction]: Checked pairs total: 402 [2021-03-25 04:43:18,832 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:18,832 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-03-25 04:43:18,836 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 193 flow [2021-03-25 04:43:18,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:18,837 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:18,837 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:18,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:43:18,837 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:18,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1006693327, now seen corresponding path program 1 times [2021-03-25 04:43:18,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:18,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938724387] [2021-03-25 04:43:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:18,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:18,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:18,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:18,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:18,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:18,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:18,947 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 04:43:18,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938724387] [2021-03-25 04:43:18,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:18,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:18,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143641021] [2021-03-25 04:43:18,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:43:18,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:43:18,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:43:18,950 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:43:18,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:18,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:18,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:43:18,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:19,115 INFO L129 PetriNetUnfolder]: 636/1241 cut-off events. [2021-03-25 04:43:19,115 INFO L130 PetriNetUnfolder]: For 493/559 co-relation queries the response was YES. [2021-03-25 04:43:19,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2931 conditions, 1241 events. 636/1241 cut-off events. For 493/559 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 8920 event pairs, 310 based on Foata normal form. 104/1202 useless extension candidates. Maximal degree in co-relation 2916. Up to 731 conditions per place. [2021-03-25 04:43:19,127 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 10 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2021-03-25 04:43:19,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 259 flow [2021-03-25 04:43:19,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:43:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:43:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 912 transitions. [2021-03-25 04:43:19,130 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8685714285714285 [2021-03-25 04:43:19,130 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 912 transitions. [2021-03-25 04:43:19,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 912 transitions. [2021-03-25 04:43:19,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:19,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 912 transitions. [2021-03-25 04:43:19,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.4) internal successors, (912), 5 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:19,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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 04:43:19,135 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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 04:43:19,135 INFO L185 Difference]: Start difference. First operand has 44 places, 37 transitions, 193 flow. Second operand 5 states and 912 transitions. [2021-03-25 04:43:19,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 259 flow [2021-03-25 04:43:19,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 259 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:43:19,142 INFO L241 Difference]: Finished difference. Result has 51 places, 46 transitions, 268 flow [2021-03-25 04:43:19,142 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2021-03-25 04:43:19,142 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -6 predicate places. [2021-03-25 04:43:19,142 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:19,143 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 46 transitions, 268 flow [2021-03-25 04:43:19,143 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 46 transitions, 268 flow [2021-03-25 04:43:19,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 268 flow [2021-03-25 04:43:19,268 INFO L129 PetriNetUnfolder]: 677/1310 cut-off events. [2021-03-25 04:43:19,269 INFO L130 PetriNetUnfolder]: For 1188/1713 co-relation queries the response was YES. [2021-03-25 04:43:19,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3939 conditions, 1310 events. 677/1310 cut-off events. For 1188/1713 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 9481 event pairs, 335 based on Foata normal form. 7/1151 useless extension candidates. Maximal degree in co-relation 3921. Up to 833 conditions per place. [2021-03-25 04:43:19,288 INFO L142 LiptonReduction]: Number of co-enabled transitions 706 [2021-03-25 04:43:19,355 INFO L154 LiptonReduction]: Checked pairs total: 393 [2021-03-25 04:43:19,355 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:43:19,355 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 213 [2021-03-25 04:43:19,356 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 262 flow [2021-03-25 04:43:19,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:19,357 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:19,357 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:19,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:43:19,357 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:19,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:19,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1818088589, now seen corresponding path program 1 times [2021-03-25 04:43:19,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:19,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978442707] [2021-03-25 04:43:19,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:19,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:19,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:19,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:19,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:19,427 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 04:43:19,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978442707] [2021-03-25 04:43:19,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:19,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:43:19,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609574775] [2021-03-25 04:43:19,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:43:19,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:19,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:43:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:43:19,433 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 210 [2021-03-25 04:43:19,434 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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 04:43:19,434 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:19,434 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 210 [2021-03-25 04:43:19,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:19,566 INFO L129 PetriNetUnfolder]: 670/1277 cut-off events. [2021-03-25 04:43:19,566 INFO L130 PetriNetUnfolder]: For 1745/2398 co-relation queries the response was YES. [2021-03-25 04:43:19,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 1277 events. 670/1277 cut-off events. For 1745/2398 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 8792 event pairs, 362 based on Foata normal form. 66/1172 useless extension candidates. Maximal degree in co-relation 3896. Up to 830 conditions per place. [2021-03-25 04:43:19,578 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 3 selfloop transitions, 7 changer transitions 1/41 dead transitions. [2021-03-25 04:43:19,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 258 flow [2021-03-25 04:43:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:43:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:43:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2021-03-25 04:43:19,580 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8857142857142857 [2021-03-25 04:43:19,580 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 558 transitions. [2021-03-25 04:43:19,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 558 transitions. [2021-03-25 04:43:19,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:19,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 558 transitions. [2021-03-25 04:43:19,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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 04:43:19,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 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 04:43:19,585 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 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 04:43:19,585 INFO L185 Difference]: Start difference. First operand has 51 places, 45 transitions, 262 flow. Second operand 3 states and 558 transitions. [2021-03-25 04:43:19,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 258 flow [2021-03-25 04:43:19,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 251 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:43:19,594 INFO L241 Difference]: Finished difference. Result has 50 places, 40 transitions, 247 flow [2021-03-25 04:43:19,594 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2021-03-25 04:43:19,594 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2021-03-25 04:43:19,594 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:19,594 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 40 transitions, 247 flow [2021-03-25 04:43:19,595 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 40 transitions, 247 flow [2021-03-25 04:43:19,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 247 flow [2021-03-25 04:43:19,698 INFO L129 PetriNetUnfolder]: 707/1329 cut-off events. [2021-03-25 04:43:19,698 INFO L130 PetriNetUnfolder]: For 1227/1656 co-relation queries the response was YES. [2021-03-25 04:43:19,705 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3848 conditions, 1329 events. 707/1329 cut-off events. For 1227/1656 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 9360 event pairs, 363 based on Foata normal form. 3/1163 useless extension candidates. Maximal degree in co-relation 3830. Up to 914 conditions per place. [2021-03-25 04:43:19,716 INFO L142 LiptonReduction]: Number of co-enabled transitions 522 [2021-03-25 04:43:19,755 INFO L154 LiptonReduction]: Checked pairs total: 140 [2021-03-25 04:43:19,755 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:19,756 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 162 [2021-03-25 04:43:19,760 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 247 flow [2021-03-25 04:43:19,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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 04:43:19,760 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:19,760 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:19,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:43:19,761 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:19,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1183458970, now seen corresponding path program 1 times [2021-03-25 04:43:19,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:19,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116988077] [2021-03-25 04:43:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:19,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:19,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:19,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:19,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:19,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:19,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:19,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:19,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:19,842 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 04:43:19,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116988077] [2021-03-25 04:43:19,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:19,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:43:19,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411855101] [2021-03-25 04:43:19,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:43:19,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:19,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:43:19,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:43:19,844 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:43:19,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 04:43:19,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:19,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:43:19,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:19,981 INFO L129 PetriNetUnfolder]: 469/1024 cut-off events. [2021-03-25 04:43:19,982 INFO L130 PetriNetUnfolder]: For 1337/3328 co-relation queries the response was YES. [2021-03-25 04:43:19,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 1024 events. 469/1024 cut-off events. For 1337/3328 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 7296 event pairs, 119 based on Foata normal form. 232/1166 useless extension candidates. Maximal degree in co-relation 3756. Up to 729 conditions per place. [2021-03-25 04:43:19,991 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 10 selfloop transitions, 14 changer transitions 0/53 dead transitions. [2021-03-25 04:43:19,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 371 flow [2021-03-25 04:43:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:43:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:43:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2021-03-25 04:43:19,994 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8682539682539683 [2021-03-25 04:43:19,994 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1094 transitions. [2021-03-25 04:43:19,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1094 transitions. [2021-03-25 04:43:19,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:19,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1094 transitions. [2021-03-25 04:43:19,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.33333333333334) internal successors, (1094), 6 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states 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 04:43:19,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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 04:43:19,999 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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 04:43:19,999 INFO L185 Difference]: Start difference. First operand has 50 places, 40 transitions, 247 flow. Second operand 6 states and 1094 transitions. [2021-03-25 04:43:19,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 371 flow [2021-03-25 04:43:20,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 364 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:43:20,004 INFO L241 Difference]: Finished difference. Result has 57 places, 49 transitions, 360 flow [2021-03-25 04:43:20,005 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2021-03-25 04:43:20,005 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2021-03-25 04:43:20,005 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:20,005 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 49 transitions, 360 flow [2021-03-25 04:43:20,005 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 49 transitions, 360 flow [2021-03-25 04:43:20,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 49 transitions, 360 flow [2021-03-25 04:43:20,130 INFO L129 PetriNetUnfolder]: 503/1098 cut-off events. [2021-03-25 04:43:20,130 INFO L130 PetriNetUnfolder]: For 3077/3772 co-relation queries the response was YES. [2021-03-25 04:43:20,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4785 conditions, 1098 events. 503/1098 cut-off events. For 3077/3772 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 8212 event pairs, 119 based on Foata normal form. 34/1074 useless extension candidates. Maximal degree in co-relation 4763. Up to 792 conditions per place. [2021-03-25 04:43:20,148 INFO L142 LiptonReduction]: Number of co-enabled transitions 772 [2021-03-25 04:43:20,375 INFO L154 LiptonReduction]: Checked pairs total: 432 [2021-03-25 04:43:20,375 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:43:20,375 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 370 [2021-03-25 04:43:20,376 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 352 flow [2021-03-25 04:43:20,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 04:43:20,376 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:20,377 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:20,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:43:20,377 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:20,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:20,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1588168722, now seen corresponding path program 1 times [2021-03-25 04:43:20,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:20,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480533871] [2021-03-25 04:43:20,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:20,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:20,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:20,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:20,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:20,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:20,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:20,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:20,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:20,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:20,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:20,451 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 04:43:20,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480533871] [2021-03-25 04:43:20,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:20,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:43:20,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286277859] [2021-03-25 04:43:20,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:43:20,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:20,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:43:20,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:43:20,453 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:43:20,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 352 flow. Second operand has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:20,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:20,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:43:20,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:20,567 INFO L129 PetriNetUnfolder]: 251/604 cut-off events. [2021-03-25 04:43:20,567 INFO L130 PetriNetUnfolder]: For 2241/3994 co-relation queries the response was YES. [2021-03-25 04:43:20,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2961 conditions, 604 events. 251/604 cut-off events. For 2241/3994 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3819 event pairs, 39 based on Foata normal form. 260/824 useless extension candidates. Maximal degree in co-relation 2937. Up to 418 conditions per place. [2021-03-25 04:43:20,572 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 6 selfloop transitions, 18 changer transitions 4/57 dead transitions. [2021-03-25 04:43:20,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 494 flow [2021-03-25 04:43:20,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:43:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:43:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1276 transitions. [2021-03-25 04:43:20,576 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8680272108843538 [2021-03-25 04:43:20,576 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1276 transitions. [2021-03-25 04:43:20,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1276 transitions. [2021-03-25 04:43:20,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:20,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1276 transitions. [2021-03-25 04:43:20,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.28571428571428) internal successors, (1276), 7 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states 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 04:43:20,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 04:43:20,583 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 04:43:20,583 INFO L185 Difference]: Start difference. First operand has 57 places, 48 transitions, 352 flow. Second operand 7 states and 1276 transitions. [2021-03-25 04:43:20,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 494 flow [2021-03-25 04:43:20,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 426 flow, removed 27 selfloop flow, removed 5 redundant places. [2021-03-25 04:43:20,593 INFO L241 Difference]: Finished difference. Result has 59 places, 53 transitions, 406 flow [2021-03-25 04:43:20,593 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=406, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2021-03-25 04:43:20,594 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2021-03-25 04:43:20,594 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:20,594 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 53 transitions, 406 flow [2021-03-25 04:43:20,594 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 53 transitions, 406 flow [2021-03-25 04:43:20,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 53 transitions, 406 flow [2021-03-25 04:43:20,648 INFO L129 PetriNetUnfolder]: 257/633 cut-off events. [2021-03-25 04:43:20,648 INFO L130 PetriNetUnfolder]: For 1494/1665 co-relation queries the response was YES. [2021-03-25 04:43:20,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2713 conditions, 633 events. 257/633 cut-off events. For 1494/1665 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4169 event pairs, 39 based on Foata normal form. 1/602 useless extension candidates. Maximal degree in co-relation 2691. Up to 396 conditions per place. [2021-03-25 04:43:20,656 INFO L142 LiptonReduction]: Number of co-enabled transitions 730 [2021-03-25 04:43:20,702 INFO L154 LiptonReduction]: Checked pairs total: 431 [2021-03-25 04:43:20,702 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:43:20,702 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 108 [2021-03-25 04:43:20,707 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 396 flow [2021-03-25 04:43:20,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:20,707 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:20,707 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:20,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:43:20,707 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:20,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:20,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1345868945, now seen corresponding path program 1 times [2021-03-25 04:43:20,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:20,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554456313] [2021-03-25 04:43:20,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:20,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:20,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:20,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:20,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:20,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:20,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:20,805 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:43:20,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:43:20,819 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 04:43:20,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554456313] [2021-03-25 04:43:20,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:20,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:43:20,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189168155] [2021-03-25 04:43:20,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:43:20,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:20,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:43:20,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:43:20,822 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2021-03-25 04:43:20,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 396 flow. Second operand has 5 states, 5 states have (on average 168.6) internal successors, (843), 5 states have internal predecessors, (843), 0 states have call successors, (0), 0 states 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 04:43:20,823 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:20,823 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2021-03-25 04:43:20,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:20,960 INFO L129 PetriNetUnfolder]: 382/867 cut-off events. [2021-03-25 04:43:20,961 INFO L130 PetriNetUnfolder]: For 2011/2285 co-relation queries the response was YES. [2021-03-25 04:43:20,965 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3674 conditions, 867 events. 382/867 cut-off events. For 2011/2285 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5744 event pairs, 19 based on Foata normal form. 12/845 useless extension candidates. Maximal degree in co-relation 3650. Up to 468 conditions per place. [2021-03-25 04:43:20,968 INFO L132 encePairwiseOnDemand]: 201/210 looper letters, 17 selfloop transitions, 24 changer transitions 10/79 dead transitions. [2021-03-25 04:43:20,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 688 flow [2021-03-25 04:43:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:43:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:43:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1034 transitions. [2021-03-25 04:43:20,971 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8206349206349206 [2021-03-25 04:43:20,971 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1034 transitions. [2021-03-25 04:43:20,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1034 transitions. [2021-03-25 04:43:20,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:20,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1034 transitions. [2021-03-25 04:43:20,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.33333333333334) internal successors, (1034), 6 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states 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 04:43:20,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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 04:43:20,976 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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 04:43:20,976 INFO L185 Difference]: Start difference. First operand has 59 places, 52 transitions, 396 flow. Second operand 6 states and 1034 transitions. [2021-03-25 04:43:20,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 688 flow [2021-03-25 04:43:20,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 647 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 04:43:20,996 INFO L241 Difference]: Finished difference. Result has 62 places, 60 transitions, 502 flow [2021-03-25 04:43:20,996 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=502, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2021-03-25 04:43:20,996 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 5 predicate places. [2021-03-25 04:43:20,996 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:20,996 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 502 flow [2021-03-25 04:43:20,997 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 502 flow [2021-03-25 04:43:20,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 502 flow [2021-03-25 04:43:21,062 INFO L129 PetriNetUnfolder]: 308/737 cut-off events. [2021-03-25 04:43:21,062 INFO L130 PetriNetUnfolder]: For 1518/1620 co-relation queries the response was YES. [2021-03-25 04:43:21,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2670 conditions, 737 events. 308/737 cut-off events. For 1518/1620 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4899 event pairs, 41 based on Foata normal form. 1/700 useless extension candidates. Maximal degree in co-relation 2645. Up to 286 conditions per place. [2021-03-25 04:43:21,071 INFO L142 LiptonReduction]: Number of co-enabled transitions 670 [2021-03-25 04:43:21,091 INFO L154 LiptonReduction]: Checked pairs total: 327 [2021-03-25 04:43:21,092 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:21,092 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 96 [2021-03-25 04:43:21,092 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 502 flow [2021-03-25 04:43:21,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.6) internal successors, (843), 5 states have internal predecessors, (843), 0 states have call successors, (0), 0 states 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 04:43:21,093 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:21,093 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:21,093 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:43:21,093 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:21,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:21,094 INFO L82 PathProgramCache]: Analyzing trace with hash 246329855, now seen corresponding path program 2 times [2021-03-25 04:43:21,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:21,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686851180] [2021-03-25 04:43:21,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:21,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:21,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:21,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:21,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:21,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:21,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:21,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:21,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:21,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:21,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:21,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:21,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:21,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686851180] [2021-03-25 04:43:21,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:21,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:43:21,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847735518] [2021-03-25 04:43:21,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:43:21,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:21,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:43:21,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:43:21,203 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:43:21,204 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 502 flow. Second operand has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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 04:43:21,204 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:21,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:43:21,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:21,373 INFO L129 PetriNetUnfolder]: 285/684 cut-off events. [2021-03-25 04:43:21,373 INFO L130 PetriNetUnfolder]: For 1669/2304 co-relation queries the response was YES. [2021-03-25 04:43:21,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2935 conditions, 684 events. 285/684 cut-off events. For 1669/2304 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4368 event pairs, 32 based on Foata normal form. 248/890 useless extension candidates. Maximal degree in co-relation 2908. Up to 269 conditions per place. [2021-03-25 04:43:21,378 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 2 selfloop transitions, 18 changer transitions 17/65 dead transitions. [2021-03-25 04:43:21,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 598 flow [2021-03-25 04:43:21,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:43:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:43:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1450 transitions. [2021-03-25 04:43:21,382 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8630952380952381 [2021-03-25 04:43:21,382 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1450 transitions. [2021-03-25 04:43:21,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1450 transitions. [2021-03-25 04:43:21,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:21,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1450 transitions. [2021-03-25 04:43:21,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 181.25) internal successors, (1450), 8 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states 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 04:43:21,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:21,389 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:21,389 INFO L185 Difference]: Start difference. First operand has 62 places, 60 transitions, 502 flow. Second operand 8 states and 1450 transitions. [2021-03-25 04:43:21,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 598 flow [2021-03-25 04:43:21,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 574 flow, removed 9 selfloop flow, removed 1 redundant places. [2021-03-25 04:43:21,402 INFO L241 Difference]: Finished difference. Result has 71 places, 48 transitions, 385 flow [2021-03-25 04:43:21,402 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=385, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2021-03-25 04:43:21,402 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2021-03-25 04:43:21,403 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:21,403 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 48 transitions, 385 flow [2021-03-25 04:43:21,403 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 48 transitions, 385 flow [2021-03-25 04:43:21,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 48 transitions, 385 flow [2021-03-25 04:43:21,428 INFO L129 PetriNetUnfolder]: 91/241 cut-off events. [2021-03-25 04:43:21,428 INFO L130 PetriNetUnfolder]: For 559/607 co-relation queries the response was YES. [2021-03-25 04:43:21,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 241 events. 91/241 cut-off events. For 559/607 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1215 event pairs, 14 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 961. Up to 91 conditions per place. [2021-03-25 04:43:21,431 INFO L142 LiptonReduction]: Number of co-enabled transitions 374 [2021-03-25 04:43:21,771 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 04:43:21,931 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 04:43:22,277 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 04:43:22,417 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 04:43:22,425 INFO L154 LiptonReduction]: Checked pairs total: 348 [2021-03-25 04:43:22,426 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:43:22,426 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1023 [2021-03-25 04:43:22,426 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 371 flow [2021-03-25 04:43:22,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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 04:43:22,427 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:22,427 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:22,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:43:22,427 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:22,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:22,427 INFO L82 PathProgramCache]: Analyzing trace with hash -104101826, now seen corresponding path program 1 times [2021-03-25 04:43:22,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:22,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072727858] [2021-03-25 04:43:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:22,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:22,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:22,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:22,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:22,471 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:43:22,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:43:22,483 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 04:43:22,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072727858] [2021-03-25 04:43:22,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:22,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:22,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894304654] [2021-03-25 04:43:22,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:43:22,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:22,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:43:22,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:43:22,485 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 213 [2021-03-25 04:43:22,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 371 flow. Second operand has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states 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 04:43:22,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:22,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 213 [2021-03-25 04:43:22,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:22,555 INFO L129 PetriNetUnfolder]: 143/338 cut-off events. [2021-03-25 04:43:22,555 INFO L130 PetriNetUnfolder]: For 1414/1581 co-relation queries the response was YES. [2021-03-25 04:43:22,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 338 events. 143/338 cut-off events. For 1414/1581 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1781 event pairs, 5 based on Foata normal form. 31/348 useless extension candidates. Maximal degree in co-relation 1394. Up to 118 conditions per place. [2021-03-25 04:43:22,558 INFO L132 encePairwiseOnDemand]: 203/213 looper letters, 10 selfloop transitions, 15 changer transitions 2/54 dead transitions. [2021-03-25 04:43:22,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 54 transitions, 496 flow [2021-03-25 04:43:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:43:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:43:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 856 transitions. [2021-03-25 04:43:22,560 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8037558685446009 [2021-03-25 04:43:22,560 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 856 transitions. [2021-03-25 04:43:22,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 856 transitions. [2021-03-25 04:43:22,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:22,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 856 transitions. [2021-03-25 04:43:22,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.2) internal successors, (856), 5 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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 04:43:22,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states 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 04:43:22,565 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states 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 04:43:22,565 INFO L185 Difference]: Start difference. First operand has 67 places, 45 transitions, 371 flow. Second operand 5 states and 856 transitions. [2021-03-25 04:43:22,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 54 transitions, 496 flow [2021-03-25 04:43:22,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 54 transitions, 429 flow, removed 16 selfloop flow, removed 9 redundant places. [2021-03-25 04:43:22,570 INFO L241 Difference]: Finished difference. Result has 64 places, 52 transitions, 422 flow [2021-03-25 04:43:22,571 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2021-03-25 04:43:22,571 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2021-03-25 04:43:22,571 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:22,572 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 52 transitions, 422 flow [2021-03-25 04:43:22,572 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 52 transitions, 422 flow [2021-03-25 04:43:22,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 52 transitions, 422 flow [2021-03-25 04:43:22,596 INFO L129 PetriNetUnfolder]: 131/316 cut-off events. [2021-03-25 04:43:22,597 INFO L130 PetriNetUnfolder]: For 689/753 co-relation queries the response was YES. [2021-03-25 04:43:22,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 316 events. 131/316 cut-off events. For 689/753 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1798 event pairs, 3 based on Foata normal form. 13/307 useless extension candidates. Maximal degree in co-relation 1054. Up to 96 conditions per place. [2021-03-25 04:43:22,600 INFO L142 LiptonReduction]: Number of co-enabled transitions 426 [2021-03-25 04:43:22,607 INFO L154 LiptonReduction]: Checked pairs total: 137 [2021-03-25 04:43:22,607 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:22,607 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-03-25 04:43:22,607 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 422 flow [2021-03-25 04:43:22,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states 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 04:43:22,608 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:22,608 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:22,608 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:43:22,608 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:22,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:22,608 INFO L82 PathProgramCache]: Analyzing trace with hash 936351000, now seen corresponding path program 1 times [2021-03-25 04:43:22,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:22,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777535713] [2021-03-25 04:43:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:22,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:22,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:22,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:22,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:22,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:22,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:22,651 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 04:43:22,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777535713] [2021-03-25 04:43:22,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:22,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:22,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276024155] [2021-03-25 04:43:22,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:43:22,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:22,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:43:22,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:43:22,653 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 213 [2021-03-25 04:43:22,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 422 flow. Second operand has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states 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 04:43:22,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:22,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 213 [2021-03-25 04:43:22,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:22,723 INFO L129 PetriNetUnfolder]: 177/415 cut-off events. [2021-03-25 04:43:22,723 INFO L130 PetriNetUnfolder]: For 1057/1147 co-relation queries the response was YES. [2021-03-25 04:43:22,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 415 events. 177/415 cut-off events. For 1057/1147 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2335 event pairs, 10 based on Foata normal form. 19/408 useless extension candidates. Maximal degree in co-relation 1399. Up to 130 conditions per place. [2021-03-25 04:43:22,726 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 3 selfloop transitions, 1 changer transitions 15/52 dead transitions. [2021-03-25 04:43:22,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 436 flow [2021-03-25 04:43:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:43:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:43:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 746 transitions. [2021-03-25 04:43:22,728 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8755868544600939 [2021-03-25 04:43:22,728 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 746 transitions. [2021-03-25 04:43:22,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 746 transitions. [2021-03-25 04:43:22,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:22,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 746 transitions. [2021-03-25 04:43:22,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.5) internal successors, (746), 4 states have internal predecessors, (746), 0 states have call successors, (0), 0 states 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 04:43:22,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:22,732 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:22,732 INFO L185 Difference]: Start difference. First operand has 64 places, 52 transitions, 422 flow. Second operand 4 states and 746 transitions. [2021-03-25 04:43:22,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 436 flow [2021-03-25 04:43:22,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 52 transitions, 434 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-25 04:43:22,742 INFO L241 Difference]: Finished difference. Result has 68 places, 37 transitions, 246 flow [2021-03-25 04:43:22,742 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=68, PETRI_TRANSITIONS=37} [2021-03-25 04:43:22,742 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2021-03-25 04:43:22,742 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:22,742 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 37 transitions, 246 flow [2021-03-25 04:43:22,743 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 37 transitions, 246 flow [2021-03-25 04:43:22,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 37 transitions, 246 flow [2021-03-25 04:43:22,758 INFO L129 PetriNetUnfolder]: 52/142 cut-off events. [2021-03-25 04:43:22,758 INFO L130 PetriNetUnfolder]: For 420/449 co-relation queries the response was YES. [2021-03-25 04:43:22,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 142 events. 52/142 cut-off events. For 420/449 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 620 event pairs, 3 based on Foata normal form. 8/140 useless extension candidates. Maximal degree in co-relation 460. Up to 44 conditions per place. [2021-03-25 04:43:22,760 INFO L142 LiptonReduction]: Number of co-enabled transitions 136 [2021-03-25 04:43:22,968 INFO L154 LiptonReduction]: Checked pairs total: 45 [2021-03-25 04:43:22,969 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:43:22,969 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 227 [2021-03-25 04:43:22,969 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 35 transitions, 250 flow [2021-03-25 04:43:22,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states 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 04:43:22,970 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:22,970 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:22,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:43:22,970 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:22,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:22,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1952333682, now seen corresponding path program 2 times [2021-03-25 04:43:22,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:22,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920510505] [2021-03-25 04:43:22,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:43:23,015 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:43:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:43:23,067 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:43:23,115 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:43:23,115 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:43:23,116 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:43:23,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:43:23 BasicIcfg [2021-03-25 04:43:23,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:43:23,238 INFO L168 Benchmark]: Toolchain (without parser) took 13245.78 ms. Allocated memory was 255.9 MB in the beginning and 660.6 MB in the end (delta: 404.8 MB). Free memory was 233.0 MB in the beginning and 517.6 MB in the end (delta: -284.6 MB). Peak memory consumption was 118.5 MB. Max. memory is 16.0 GB. [2021-03-25 04:43:23,238 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 92.5 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:43:23,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.70 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 232.6 MB in the beginning and 322.1 MB in the end (delta: -89.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 04:43:23,240 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.24 ms. Allocated memory is still 362.8 MB. Free memory was 322.1 MB in the beginning and 319.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:43:23,241 INFO L168 Benchmark]: Boogie Preprocessor took 43.20 ms. Allocated memory is still 362.8 MB. Free memory was 319.2 MB in the beginning and 317.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:43:23,241 INFO L168 Benchmark]: RCFGBuilder took 1426.28 ms. Allocated memory is still 362.8 MB. Free memory was 317.0 MB in the beginning and 271.4 MB in the end (delta: 45.5 MB). Peak memory consumption was 52.7 MB. Max. memory is 16.0 GB. [2021-03-25 04:43:23,241 INFO L168 Benchmark]: TraceAbstraction took 11233.63 ms. Allocated memory was 362.8 MB in the beginning and 660.6 MB in the end (delta: 297.8 MB). Free memory was 271.4 MB in the beginning and 517.6 MB in the end (delta: -246.1 MB). Peak memory consumption was 50.6 MB. Max. memory is 16.0 GB. [2021-03-25 04:43:23,247 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.48 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 92.5 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 484.70 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 232.6 MB in the beginning and 322.1 MB in the end (delta: -89.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 52.24 ms. Allocated memory is still 362.8 MB. Free memory was 322.1 MB in the beginning and 319.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 43.20 ms. Allocated memory is still 362.8 MB. Free memory was 319.2 MB in the beginning and 317.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1426.28 ms. Allocated memory is still 362.8 MB. Free memory was 317.0 MB in the beginning and 271.4 MB in the end (delta: 45.5 MB). Peak memory consumption was 52.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11233.63 ms. Allocated memory was 362.8 MB in the beginning and 660.6 MB in the end (delta: 297.8 MB). Free memory was 271.4 MB in the beginning and 517.6 MB in the end (delta: -246.1 MB). Peak memory consumption was 50.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2785.9ms, 124 PlacesBefore, 57 PlacesAfterwards, 113 TransitionsBefore, 45 TransitionsAfterwards, 2488 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 4063 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2013, positive: 1924, positive conditional: 0, positive unconditional: 1924, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1221, positive: 1197, positive conditional: 0, positive unconditional: 1197, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1221, positive: 1197, positive conditional: 0, positive unconditional: 1197, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2013, positive: 727, positive conditional: 0, positive unconditional: 727, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 1221, unknown conditional: 0, unknown unconditional: 1221] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1259.9ms, 53 PlacesBefore, 39 PlacesAfterwards, 42 TransitionsBefore, 28 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 1840 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 584, positive: 481, positive conditional: 0, positive unconditional: 481, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 89, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 584, positive: 412, positive conditional: 0, positive unconditional: 412, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 89, unknown conditional: 0, unknown unconditional: 89] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1516.6ms, 48 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 30 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 669 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 204, positive: 168, positive conditional: 0, positive unconditional: 168, 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: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 204, positive: 160, positive conditional: 0, positive unconditional: 160, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 48.3ms, 44 PlacesBefore, 44 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 402 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 155, positive: 138, positive conditional: 0, positive unconditional: 138, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 155, positive: 130, positive conditional: 0, positive unconditional: 130, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 212.6ms, 51 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 393 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 278, positive: 264, positive conditional: 0, positive unconditional: 264, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 278, positive: 257, positive conditional: 0, positive unconditional: 257, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 160.8ms, 50 PlacesBefore, 50 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 140 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 104, positive: 98, positive conditional: 0, positive unconditional: 98, 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: 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] , Cache Queries: [ total: 104, positive: 98, positive conditional: 0, positive unconditional: 98, 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): 127, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 370.1ms, 57 PlacesBefore, 57 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 772 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 432 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 280, positive: 266, positive conditional: 0, positive unconditional: 266, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 280, positive: 257, positive conditional: 0, positive unconditional: 257, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 108.3ms, 59 PlacesBefore, 59 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 431 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 296, positive: 282, positive conditional: 0, positive unconditional: 282, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 296, positive: 269, positive conditional: 0, positive unconditional: 269, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 94.9ms, 62 PlacesBefore, 62 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 327 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 202, positive: 191, positive conditional: 0, positive unconditional: 191, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 202, positive: 190, positive conditional: 0, positive unconditional: 190, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1022.8ms, 71 PlacesBefore, 67 PlacesAfterwards, 48 TransitionsBefore, 45 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 348 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 212, positive: 194, positive conditional: 0, positive unconditional: 194, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 212, positive: 185, positive conditional: 0, positive unconditional: 185, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.9ms, 64 PlacesBefore, 64 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 137 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 78, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 226.2ms, 68 PlacesBefore, 65 PlacesAfterwards, 37 TransitionsBefore, 35 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 45 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 40, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t989; [L857] FCALL, FORK 0 pthread_create(&t989, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t990; [L859] FCALL, FORK 0 pthread_create(&t990, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t991; [L861] FCALL, FORK 0 pthread_create(&t991, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t992; [L863] FCALL, FORK 0 pthread_create(&t992, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L792] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L793] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L794] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L795] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L796] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L797] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10961.0ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1638.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2879.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 81 SDtfs, 54 SDslu, 70 SDs, 0 SdLazy, 234 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 267.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 210.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=502occurred in iteration=8, InterpolantAutomatonStates: 58, 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: 41.4ms SsaConstructionTime, 327.2ms SatisfiabilityAnalysisTime, 703.5ms InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 1120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...