/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 15:21:54,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 15:21:54,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 15:21:54,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 15:21:54,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 15:21:54,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 15:21:54,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 15:21:54,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 15:21:54,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 15:21:54,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 15:21:54,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 15:21:54,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 15:21:54,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 15:21:54,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 15:21:54,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 15:21:54,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 15:21:54,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 15:21:54,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 15:21:54,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 15:21:54,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 15:21:54,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 15:21:54,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 15:21:54,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 15:21:54,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 15:21:54,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 15:21:54,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 15:21:54,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 15:21:54,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 15:21:54,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 15:21:54,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 15:21:54,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 15:21:54,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 15:21:54,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 15:21:54,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 15:21:54,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 15:21:54,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 15:21:54,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 15:21:54,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 15:21:54,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 15:21:54,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 15:21:54,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 15:21:54,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 15:21:54,587 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 15:21:54,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 15:21:54,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 15:21:54,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 15:21:54,589 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 15:21:54,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 15:21:54,589 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 15:21:54,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 15:21:54,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 15:21:54,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 15:21:54,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 15:21:54,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 15:21:54,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 15:21:54,590 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 15:21:54,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 15:21:54,590 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 15:21:54,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 15:21:54,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 15:21:54,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 15:21:54,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 15:21:54,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 15:21:54,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 15:21:54,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 15:21:54,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 15:21:54,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 15:21:54,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 15:21:54,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 15:21:54,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 15:21:54,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 15:21:54,593 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 15:21:54,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 15:21:54,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 15:21:54,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 15:21:54,901 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 15:21:54,902 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 15:21:54,902 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-03-25 15:21:54,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec07294b/41b0b34cdadf49b68f429f030d3ad98e/FLAG1bf523925 [2021-03-25 15:21:55,484 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 15:21:55,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-03-25 15:21:55,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec07294b/41b0b34cdadf49b68f429f030d3ad98e/FLAG1bf523925 [2021-03-25 15:21:55,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec07294b/41b0b34cdadf49b68f429f030d3ad98e [2021-03-25 15:21:55,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 15:21:55,993 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 15:21:55,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 15:21:55,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 15:21:55,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 15:21:55,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:21:55" (1/1) ... [2021-03-25 15:21:56,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6875f6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:55, skipping insertion in model container [2021-03-25 15:21:56,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:21:55" (1/1) ... [2021-03-25 15:21:56,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 15:21:56,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 15:21:56,151 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-25 15:21:56,541 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-03-25 15:21:56,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 15:21:56,569 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 15:21:56,579 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-25 15:21:56,603 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-03-25 15:21:56,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 15:21:56,847 INFO L208 MainTranslator]: Completed translation [2021-03-25 15:21:56,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:56 WrapperNode [2021-03-25 15:21:56,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 15:21:56,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 15:21:56,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 15:21:56,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 15:21:56,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:56" (1/1) ... [2021-03-25 15:21:56,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:56" (1/1) ... [2021-03-25 15:21:56,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 15:21:56,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 15:21:56,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 15:21:56,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 15:21:56,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:56" (1/1) ... [2021-03-25 15:21:56,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:56" (1/1) ... [2021-03-25 15:21:56,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:56" (1/1) ... [2021-03-25 15:21:56,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:56" (1/1) ... [2021-03-25 15:21:56,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:56" (1/1) ... [2021-03-25 15:21:56,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:56" (1/1) ... [2021-03-25 15:21:56,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:56" (1/1) ... [2021-03-25 15:21:56,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 15:21:56,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 15:21:56,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 15:21:56,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 15:21:56,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 15:21:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 15:21:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 15:21:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 15:21:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 15:21:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-03-25 15:21:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 15:21:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 15:21:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-03-25 15:21:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-03-25 15:21:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 15:21:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 15:21:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 15:21:57,014 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 15:21:57,665 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 15:21:57,666 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-03-25 15:21:57,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:21:57 BoogieIcfgContainer [2021-03-25 15:21:57,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 15:21:57,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 15:21:57,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 15:21:57,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 15:21:57,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 03:21:55" (1/3) ... [2021-03-25 15:21:57,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bb5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:21:57, skipping insertion in model container [2021-03-25 15:21:57,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:21:56" (2/3) ... [2021-03-25 15:21:57,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bb5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:21:57, skipping insertion in model container [2021-03-25 15:21:57,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:21:57" (3/3) ... [2021-03-25 15:21:57,676 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2021-03-25 15:21:57,679 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 15:21:57,683 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2021-03-25 15:21:57,684 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 15:21:57,709 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,709 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,709 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,709 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,710 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,710 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,710 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,710 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,710 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,710 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,711 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,711 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,711 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,711 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,711 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,711 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,711 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,711 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,711 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,712 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,712 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,712 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,712 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,712 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,712 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,712 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,712 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,713 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,713 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,713 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,713 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,713 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,713 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,713 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,713 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,714 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,714 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,714 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,714 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,714 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,714 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,714 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,714 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,715 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,715 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,715 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,715 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,715 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,715 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,715 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,715 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,716 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,716 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,716 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,716 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,716 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,716 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,716 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,716 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,716 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,718 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,718 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,718 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,718 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,718 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,718 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,718 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,719 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,719 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,719 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,719 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,719 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,719 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,719 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,719 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,720 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,720 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,720 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,720 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,720 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,720 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,720 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,722 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,722 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,722 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,722 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,722 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,723 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,723 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,723 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,723 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,723 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,725 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,725 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,725 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,725 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,725 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,725 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,726 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,726 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,726 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,726 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:21:57,731 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-03-25 15:21:57,749 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-03-25 15:21:57,764 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 15:21:57,764 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 15:21:57,764 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 15:21:57,764 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 15:21:57,764 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 15:21:57,764 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 15:21:57,764 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 15:21:57,765 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 15:21:57,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 152 places, 156 transitions, 334 flow [2021-03-25 15:21:57,825 INFO L129 PetriNetUnfolder]: 11/196 cut-off events. [2021-03-25 15:21:57,825 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 15:21:57,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 196 events. 11/196 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 358 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 111. Up to 4 conditions per place. [2021-03-25 15:21:57,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 156 transitions, 334 flow [2021-03-25 15:21:57,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 144 transitions, 306 flow [2021-03-25 15:21:57,836 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:21:57,846 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 144 transitions, 306 flow [2021-03-25 15:21:57,848 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 144 transitions, 306 flow [2021-03-25 15:21:57,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 142 places, 144 transitions, 306 flow [2021-03-25 15:21:57,876 INFO L129 PetriNetUnfolder]: 8/177 cut-off events. [2021-03-25 15:21:57,877 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 15:21:57,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 177 events. 8/177 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 300 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 101. Up to 4 conditions per place. [2021-03-25 15:21:57,880 INFO L142 LiptonReduction]: Number of co-enabled transitions 1512 [2021-03-25 15:22:03,767 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-03-25 15:22:23,076 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-03-25 15:22:30,348 INFO L154 LiptonReduction]: Checked pairs total: 1692 [2021-03-25 15:22:30,348 INFO L156 LiptonReduction]: Total number of compositions: 113 [2021-03-25 15:22:30,350 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32515 [2021-03-25 15:22:30,357 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-03-25 15:22:30,357 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:22:30,358 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:22:30,358 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:22:30,359 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:22:30,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:22:30,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2133033277, now seen corresponding path program 1 times [2021-03-25 15:22:30,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:22:30,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637805814] [2021-03-25 15:22:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:22:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:22:30,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:22:30,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:22:30,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:22:30,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:22:30,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:22:30,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:22:30,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:22:30,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 15:22:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:22:30,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637805814] [2021-03-25 15:22:30,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:22:30,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:22:30,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106077008] [2021-03-25 15:22:30,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:22:30,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:22:30,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:22:30,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:22:30,715 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 269 [2021-03-25 15:22:30,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:30,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:22:30,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 269 [2021-03-25 15:22:30,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:22:30,915 INFO L129 PetriNetUnfolder]: 170/350 cut-off events. [2021-03-25 15:22:30,915 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-25 15:22:30,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 350 events. 170/350 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1489 event pairs, 165 based on Foata normal form. 1/321 useless extension candidates. Maximal degree in co-relation 587. Up to 315 conditions per place. [2021-03-25 15:22:30,923 INFO L132 encePairwiseOnDemand]: 257/269 looper letters, 28 selfloop transitions, 7 changer transitions 2/58 dead transitions. [2021-03-25 15:22:30,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 208 flow [2021-03-25 15:22:30,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:22:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:22:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 747 transitions. [2021-03-25 15:22:30,947 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5553903345724907 [2021-03-25 15:22:30,947 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 747 transitions. [2021-03-25 15:22:30,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 747 transitions. [2021-03-25 15:22:30,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:22:30,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 747 transitions. [2021-03-25 15:22:30,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:30,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:30,965 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:30,967 INFO L185 Difference]: Start difference. First operand has 61 places, 62 transitions, 142 flow. Second operand 5 states and 747 transitions. [2021-03-25 15:22:30,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 208 flow [2021-03-25 15:22:30,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 15:22:30,972 INFO L241 Difference]: Finished difference. Result has 58 places, 56 transitions, 144 flow [2021-03-25 15:22:30,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2021-03-25 15:22:30,974 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2021-03-25 15:22:30,974 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:22:30,974 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 56 transitions, 144 flow [2021-03-25 15:22:30,975 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 144 flow [2021-03-25 15:22:30,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 144 flow [2021-03-25 15:22:30,982 INFO L129 PetriNetUnfolder]: 4/84 cut-off events. [2021-03-25 15:22:30,982 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 15:22:30,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 84 events. 4/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 224 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2021-03-25 15:22:30,983 INFO L142 LiptonReduction]: Number of co-enabled transitions 252 [2021-03-25 15:22:36,485 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2021-03-25 15:22:36,997 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2021-03-25 15:22:37,211 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2021-03-25 15:22:39,982 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-03-25 15:22:53,231 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-03-25 15:22:53,524 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2021-03-25 15:22:53,629 INFO L154 LiptonReduction]: Checked pairs total: 768 [2021-03-25 15:22:53,629 INFO L156 LiptonReduction]: Total number of compositions: 26 [2021-03-25 15:22:53,630 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22656 [2021-03-25 15:22:53,631 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 106 flow [2021-03-25 15:22:53,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:53,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:22:53,631 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:22:53,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 15:22:53,632 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:22:53,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:22:53,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1151715474, now seen corresponding path program 1 times [2021-03-25 15:22:53,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:22:53,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576422053] [2021-03-25 15:22:53,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:22:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:22:53,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:22:53,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:22:53,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:22:53,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:22:53,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:22:53,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 15:22:53,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:22:53,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 15:22:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:22:53,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576422053] [2021-03-25 15:22:53,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:22:53,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:22:53,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471582221] [2021-03-25 15:22:53,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:22:53,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:22:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:22:53,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:22:53,729 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 295 [2021-03-25 15:22:53,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:53,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:22:53,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 295 [2021-03-25 15:22:53,730 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:22:53,845 INFO L129 PetriNetUnfolder]: 171/331 cut-off events. [2021-03-25 15:22:53,845 INFO L130 PetriNetUnfolder]: For 50/54 co-relation queries the response was YES. [2021-03-25 15:22:53,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 331 events. 171/331 cut-off events. For 50/54 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1421 event pairs, 93 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 658. Up to 182 conditions per place. [2021-03-25 15:22:53,848 INFO L132 encePairwiseOnDemand]: 283/295 looper letters, 25 selfloop transitions, 11 changer transitions 1/46 dead transitions. [2021-03-25 15:22:53,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 197 flow [2021-03-25 15:22:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:22:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:22:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2021-03-25 15:22:53,852 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5172881355932203 [2021-03-25 15:22:53,852 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 763 transitions. [2021-03-25 15:22:53,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 763 transitions. [2021-03-25 15:22:53,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:22:53,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 763 transitions. [2021-03-25 15:22:53,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:53,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:53,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:53,862 INFO L185 Difference]: Start difference. First operand has 37 places, 37 transitions, 106 flow. Second operand 5 states and 763 transitions. [2021-03-25 15:22:53,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 197 flow [2021-03-25 15:22:53,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 15:22:53,865 INFO L241 Difference]: Finished difference. Result has 39 places, 38 transitions, 132 flow [2021-03-25 15:22:53,865 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2021-03-25 15:22:53,866 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -22 predicate places. [2021-03-25 15:22:53,866 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:22:53,866 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 38 transitions, 132 flow [2021-03-25 15:22:53,867 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 38 transitions, 132 flow [2021-03-25 15:22:53,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 132 flow [2021-03-25 15:22:53,873 INFO L129 PetriNetUnfolder]: 5/63 cut-off events. [2021-03-25 15:22:53,873 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-25 15:22:53,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 63 events. 5/63 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 166 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 34. Up to 12 conditions per place. [2021-03-25 15:22:53,874 INFO L142 LiptonReduction]: Number of co-enabled transitions 158 [2021-03-25 15:22:54,154 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 15:22:54,379 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-25 15:22:54,492 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-25 15:22:54,596 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2021-03-25 15:22:54,698 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2021-03-25 15:22:55,293 WARN L205 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 15:22:55,471 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-03-25 15:22:55,990 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 127 [2021-03-25 15:22:56,192 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-25 15:22:57,320 WARN L205 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 162 [2021-03-25 15:22:57,727 WARN L205 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2021-03-25 15:22:58,673 WARN L205 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 169 [2021-03-25 15:22:59,103 WARN L205 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-25 15:22:59,108 INFO L154 LiptonReduction]: Checked pairs total: 516 [2021-03-25 15:22:59,109 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 15:22:59,109 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5243 [2021-03-25 15:22:59,110 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 124 flow [2021-03-25 15:22:59,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:59,110 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:22:59,111 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2021-03-25 15:22:59,111 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 15:22:59,111 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:22:59,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:22:59,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1328672246, now seen corresponding path program 1 times [2021-03-25 15:22:59,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:22:59,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251809787] [2021-03-25 15:22:59,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:22:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:22:59,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:22:59,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:22:59,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:22:59,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:22:59,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:22:59,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 15:22:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:22:59,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251809787] [2021-03-25 15:22:59,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:22:59,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:22:59,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153317457] [2021-03-25 15:22:59,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 15:22:59,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:22:59,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 15:22:59,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 15:22:59,185 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 302 [2021-03-25 15:22:59,186 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:59,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:22:59,186 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 302 [2021-03-25 15:22:59,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:22:59,303 INFO L129 PetriNetUnfolder]: 241/455 cut-off events. [2021-03-25 15:22:59,303 INFO L130 PetriNetUnfolder]: For 81/85 co-relation queries the response was YES. [2021-03-25 15:22:59,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 455 events. 241/455 cut-off events. For 81/85 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2053 event pairs, 94 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 514. Up to 340 conditions per place. [2021-03-25 15:22:59,307 INFO L132 encePairwiseOnDemand]: 294/302 looper letters, 27 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2021-03-25 15:22:59,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 211 flow [2021-03-25 15:22:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:22:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:22:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2021-03-25 15:22:59,310 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5960264900662252 [2021-03-25 15:22:59,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 540 transitions. [2021-03-25 15:22:59,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 540 transitions. [2021-03-25 15:22:59,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:22:59,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 540 transitions. [2021-03-25 15:22:59,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:59,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:59,314 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:22:59,314 INFO L185 Difference]: Start difference. First operand has 35 places, 34 transitions, 124 flow. Second operand 3 states and 540 transitions. [2021-03-25 15:22:59,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 211 flow [2021-03-25 15:22:59,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 15:22:59,317 INFO L241 Difference]: Finished difference. Result has 35 places, 37 transitions, 147 flow [2021-03-25 15:22:59,317 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=35, PETRI_TRANSITIONS=37} [2021-03-25 15:22:59,317 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -26 predicate places. [2021-03-25 15:22:59,317 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:22:59,318 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 37 transitions, 147 flow [2021-03-25 15:22:59,321 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 37 transitions, 147 flow [2021-03-25 15:22:59,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 37 transitions, 147 flow [2021-03-25 15:22:59,334 INFO L129 PetriNetUnfolder]: 31/134 cut-off events. [2021-03-25 15:22:59,334 INFO L130 PetriNetUnfolder]: For 48/56 co-relation queries the response was YES. [2021-03-25 15:22:59,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 134 events. 31/134 cut-off events. For 48/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 651 event pairs, 15 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 151. Up to 54 conditions per place. [2021-03-25 15:22:59,335 INFO L142 LiptonReduction]: Number of co-enabled transitions 168 [2021-03-25 15:23:08,347 WARN L205 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 167 DAG size of output: 165 [2021-03-25 15:23:09,120 WARN L205 SmtUtils]: Spent 771.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2021-03-25 15:23:10,867 WARN L205 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 175 DAG size of output: 173 [2021-03-25 15:23:11,737 WARN L205 SmtUtils]: Spent 864.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-25 15:23:11,763 INFO L154 LiptonReduction]: Checked pairs total: 271 [2021-03-25 15:23:11,764 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 15:23:11,764 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12447 [2021-03-25 15:23:11,765 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 35 transitions, 143 flow [2021-03-25 15:23:11,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:11,765 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:23:11,765 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-25 15:23:11,766 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 15:23:11,766 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:23:11,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:23:11,766 INFO L82 PathProgramCache]: Analyzing trace with hash 519069801, now seen corresponding path program 1 times [2021-03-25 15:23:11,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:23:11,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432822554] [2021-03-25 15:23:11,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:23:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:23:11,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:11,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:23:11,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:11,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 15:23:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:23:11,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432822554] [2021-03-25 15:23:11,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:23:11,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:23:11,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657251158] [2021-03-25 15:23:11,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 15:23:11,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:23:11,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 15:23:11,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 15:23:11,808 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 304 [2021-03-25 15:23:11,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 35 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:11,809 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:23:11,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 304 [2021-03-25 15:23:11,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:23:11,920 INFO L129 PetriNetUnfolder]: 268/507 cut-off events. [2021-03-25 15:23:11,920 INFO L130 PetriNetUnfolder]: For 316/320 co-relation queries the response was YES. [2021-03-25 15:23:11,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 507 events. 268/507 cut-off events. For 316/320 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2435 event pairs, 106 based on Foata normal form. 32/534 useless extension candidates. Maximal degree in co-relation 722. Up to 376 conditions per place. [2021-03-25 15:23:11,924 INFO L132 encePairwiseOnDemand]: 298/304 looper letters, 27 selfloop transitions, 9 changer transitions 4/47 dead transitions. [2021-03-25 15:23:11,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 277 flow [2021-03-25 15:23:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:23:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:23:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2021-03-25 15:23:11,927 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5899122807017544 [2021-03-25 15:23:11,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2021-03-25 15:23:11,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2021-03-25 15:23:11,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:23:11,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2021-03-25 15:23:11,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:11,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:11,931 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:11,931 INFO L185 Difference]: Start difference. First operand has 33 places, 35 transitions, 143 flow. Second operand 3 states and 538 transitions. [2021-03-25 15:23:11,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 277 flow [2021-03-25 15:23:11,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 262 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 15:23:11,936 INFO L241 Difference]: Finished difference. Result has 35 places, 39 transitions, 191 flow [2021-03-25 15:23:11,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=35, PETRI_TRANSITIONS=39} [2021-03-25 15:23:11,937 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -26 predicate places. [2021-03-25 15:23:11,937 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:23:11,937 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 39 transitions, 191 flow [2021-03-25 15:23:11,937 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 39 transitions, 191 flow [2021-03-25 15:23:11,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 39 transitions, 191 flow [2021-03-25 15:23:11,955 INFO L129 PetriNetUnfolder]: 74/206 cut-off events. [2021-03-25 15:23:11,955 INFO L130 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2021-03-25 15:23:11,956 INFO L84 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 206 events. 74/206 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1050 event pairs, 23 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 192. Up to 113 conditions per place. [2021-03-25 15:23:11,957 INFO L142 LiptonReduction]: Number of co-enabled transitions 148 [2021-03-25 15:23:14,311 INFO L154 LiptonReduction]: Checked pairs total: 421 [2021-03-25 15:23:14,311 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 15:23:14,311 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2374 [2021-03-25 15:23:14,312 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 38 transitions, 189 flow [2021-03-25 15:23:14,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:14,313 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:23:14,313 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:23:14,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 15:23:14,313 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:23:14,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:23:14,313 INFO L82 PathProgramCache]: Analyzing trace with hash 199267917, now seen corresponding path program 1 times [2021-03-25 15:23:14,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:23:14,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170732099] [2021-03-25 15:23:14,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:23:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:23:14,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:14,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:23:14,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:14,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:23:14,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:14,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:23:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:23:14,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170732099] [2021-03-25 15:23:14,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:23:14,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:23:14,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085669231] [2021-03-25 15:23:14,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 15:23:14,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:23:14,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 15:23:14,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 15:23:14,402 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 306 [2021-03-25 15:23:14,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 38 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:14,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:23:14,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 306 [2021-03-25 15:23:14,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:23:14,427 INFO L129 PetriNetUnfolder]: 6/41 cut-off events. [2021-03-25 15:23:14,427 INFO L130 PetriNetUnfolder]: For 39/47 co-relation queries the response was YES. [2021-03-25 15:23:14,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 41 events. 6/41 cut-off events. For 39/47 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 4 based on Foata normal form. 15/54 useless extension candidates. Maximal degree in co-relation 82. Up to 14 conditions per place. [2021-03-25 15:23:14,428 INFO L132 encePairwiseOnDemand]: 304/306 looper letters, 1 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2021-03-25 15:23:14,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 86 flow [2021-03-25 15:23:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:23:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:23:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2021-03-25 15:23:14,430 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2021-03-25 15:23:14,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2021-03-25 15:23:14,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2021-03-25 15:23:14,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:23:14,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2021-03-25 15:23:14,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:14,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:14,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:14,436 INFO L185 Difference]: Start difference. First operand has 34 places, 38 transitions, 189 flow. Second operand 3 states and 738 transitions. [2021-03-25 15:23:14,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 86 flow [2021-03-25 15:23:14,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 21 transitions, 70 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-25 15:23:14,437 INFO L241 Difference]: Finished difference. Result has 26 places, 21 transitions, 68 flow [2021-03-25 15:23:14,437 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2021-03-25 15:23:14,437 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -35 predicate places. [2021-03-25 15:23:14,437 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:23:14,437 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 68 flow [2021-03-25 15:23:14,438 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 68 flow [2021-03-25 15:23:14,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 68 flow [2021-03-25 15:23:14,443 INFO L129 PetriNetUnfolder]: 6/41 cut-off events. [2021-03-25 15:23:14,443 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 15:23:14,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 41 events. 6/41 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 4 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 14 conditions per place. [2021-03-25 15:23:14,443 INFO L142 LiptonReduction]: Number of co-enabled transitions 68 [2021-03-25 15:23:16,630 INFO L154 LiptonReduction]: Checked pairs total: 26 [2021-03-25 15:23:16,630 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:23:16,630 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2193 [2021-03-25 15:23:16,632 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 68 flow [2021-03-25 15:23:16,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:16,633 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:23:16,633 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:23:16,633 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 15:23:16,633 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:23:16,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:23:16,634 INFO L82 PathProgramCache]: Analyzing trace with hash 923373155, now seen corresponding path program 1 times [2021-03-25 15:23:16,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:23:16,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814641871] [2021-03-25 15:23:16,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:23:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:23:16,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:16,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:23:16,779 INFO L142 QuantifierPusher]: treesize reduction 4, result has 84.0 percent of original size [2021-03-25 15:23:16,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 15:23:16,791 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.5 percent of original size [2021-03-25 15:23:16,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 15:23:16,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:16,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 15:23:16,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:16,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:23:16,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:16,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:23:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:23:16,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814641871] [2021-03-25 15:23:16,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:23:16,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:23:16,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133626226] [2021-03-25 15:23:16,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:23:16,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:23:16,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:23:16,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:23:16,830 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 306 [2021-03-25 15:23:16,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 147.16666666666666) internal successors, (883), 6 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:16,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:23:16,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 306 [2021-03-25 15:23:16,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:23:17,084 INFO L129 PetriNetUnfolder]: 77/195 cut-off events. [2021-03-25 15:23:17,084 INFO L130 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2021-03-25 15:23:17,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 195 events. 77/195 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 808 event pairs, 14 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 195. Up to 67 conditions per place. [2021-03-25 15:23:17,085 INFO L132 encePairwiseOnDemand]: 297/306 looper letters, 24 selfloop transitions, 18 changer transitions 0/47 dead transitions. [2021-03-25 15:23:17,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 47 transitions, 232 flow [2021-03-25 15:23:17,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 15:23:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 15:23:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1058 transitions. [2021-03-25 15:23:17,088 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4939309056956116 [2021-03-25 15:23:17,088 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1058 transitions. [2021-03-25 15:23:17,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1058 transitions. [2021-03-25 15:23:17,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:23:17,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1058 transitions. [2021-03-25 15:23:17,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 151.14285714285714) internal successors, (1058), 7 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 306.0) internal successors, (2448), 8 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,093 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 306.0) internal successors, (2448), 8 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,093 INFO L185 Difference]: Start difference. First operand has 25 places, 21 transitions, 68 flow. Second operand 7 states and 1058 transitions. [2021-03-25 15:23:17,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 47 transitions, 232 flow [2021-03-25 15:23:17,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 15:23:17,095 INFO L241 Difference]: Finished difference. Result has 32 places, 34 transitions, 177 flow [2021-03-25 15:23:17,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=177, PETRI_PLACES=32, PETRI_TRANSITIONS=34} [2021-03-25 15:23:17,096 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -29 predicate places. [2021-03-25 15:23:17,096 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:23:17,096 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 34 transitions, 177 flow [2021-03-25 15:23:17,096 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 34 transitions, 177 flow [2021-03-25 15:23:17,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 34 transitions, 177 flow [2021-03-25 15:23:17,105 INFO L129 PetriNetUnfolder]: 24/108 cut-off events. [2021-03-25 15:23:17,106 INFO L130 PetriNetUnfolder]: For 82/84 co-relation queries the response was YES. [2021-03-25 15:23:17,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 108 events. 24/108 cut-off events. For 82/84 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 460 event pairs, 4 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 65. Up to 40 conditions per place. [2021-03-25 15:23:17,106 INFO L142 LiptonReduction]: Number of co-enabled transitions 86 [2021-03-25 15:23:17,120 INFO L154 LiptonReduction]: Checked pairs total: 77 [2021-03-25 15:23:17,120 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:23:17,120 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-25 15:23:17,124 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 34 transitions, 177 flow [2021-03-25 15:23:17,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 147.16666666666666) internal successors, (883), 6 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,125 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:23:17,125 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:23:17,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 15:23:17,126 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:23:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:23:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1723437535, now seen corresponding path program 1 times [2021-03-25 15:23:17,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:23:17,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641794608] [2021-03-25 15:23:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:23:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:23:17,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:17,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 15:23:17,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:17,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 15:23:17,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:17,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:23:17,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:17,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 15:23:17,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:17,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:23:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:23:17,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641794608] [2021-03-25 15:23:17,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:23:17,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:23:17,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875009792] [2021-03-25 15:23:17,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:23:17,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:23:17,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:23:17,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:23:17,228 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 306 [2021-03-25 15:23:17,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 34 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:23:17,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 306 [2021-03-25 15:23:17,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:23:17,367 INFO L129 PetriNetUnfolder]: 93/228 cut-off events. [2021-03-25 15:23:17,367 INFO L130 PetriNetUnfolder]: For 247/247 co-relation queries the response was YES. [2021-03-25 15:23:17,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 228 events. 93/228 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 930 event pairs, 64 based on Foata normal form. 7/233 useless extension candidates. Maximal degree in co-relation 279. Up to 187 conditions per place. [2021-03-25 15:23:17,368 INFO L132 encePairwiseOnDemand]: 298/306 looper letters, 39 selfloop transitions, 11 changer transitions 0/52 dead transitions. [2021-03-25 15:23:17,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 52 transitions, 390 flow [2021-03-25 15:23:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 15:23:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 15:23:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1067 transitions. [2021-03-25 15:23:17,372 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5811546840958606 [2021-03-25 15:23:17,372 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1067 transitions. [2021-03-25 15:23:17,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1067 transitions. [2021-03-25 15:23:17,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:23:17,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1067 transitions. [2021-03-25 15:23:17,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,379 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,380 INFO L185 Difference]: Start difference. First operand has 32 places, 34 transitions, 177 flow. Second operand 6 states and 1067 transitions. [2021-03-25 15:23:17,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 52 transitions, 390 flow [2021-03-25 15:23:17,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 52 transitions, 367 flow, removed 9 selfloop flow, removed 1 redundant places. [2021-03-25 15:23:17,384 INFO L241 Difference]: Finished difference. Result has 39 places, 44 transitions, 282 flow [2021-03-25 15:23:17,384 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=39, PETRI_TRANSITIONS=44} [2021-03-25 15:23:17,384 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -22 predicate places. [2021-03-25 15:23:17,384 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:23:17,384 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 44 transitions, 282 flow [2021-03-25 15:23:17,385 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 44 transitions, 282 flow [2021-03-25 15:23:17,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 44 transitions, 282 flow [2021-03-25 15:23:17,395 INFO L129 PetriNetUnfolder]: 25/116 cut-off events. [2021-03-25 15:23:17,395 INFO L130 PetriNetUnfolder]: For 140/141 co-relation queries the response was YES. [2021-03-25 15:23:17,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 116 events. 25/116 cut-off events. For 140/141 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 530 event pairs, 5 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 264. Up to 37 conditions per place. [2021-03-25 15:23:17,396 INFO L142 LiptonReduction]: Number of co-enabled transitions 84 [2021-03-25 15:23:17,399 INFO L154 LiptonReduction]: Checked pairs total: 140 [2021-03-25 15:23:17,399 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:23:17,399 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-25 15:23:17,402 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 44 transitions, 282 flow [2021-03-25 15:23:17,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,402 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:23:17,403 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:23:17,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 15:23:17,403 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:23:17,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:23:17,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1431458119, now seen corresponding path program 1 times [2021-03-25 15:23:17,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:23:17,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836490638] [2021-03-25 15:23:17,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:23:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:23:17,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:17,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 15:23:17,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:17,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 15:23:17,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:17,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 15:23:17,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:17,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 15:23:17,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:17,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 15:23:17,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:17,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:23:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:23:17,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836490638] [2021-03-25 15:23:17,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:23:17,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 15:23:17,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877330207] [2021-03-25 15:23:17,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:23:17,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:23:17,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:23:17,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:23:17,557 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 306 [2021-03-25 15:23:17,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 44 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 154.33333333333334) internal successors, (926), 6 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:23:17,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 306 [2021-03-25 15:23:17,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:23:17,809 INFO L129 PetriNetUnfolder]: 76/196 cut-off events. [2021-03-25 15:23:17,810 INFO L130 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2021-03-25 15:23:17,810 INFO L84 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 196 events. 76/196 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 778 event pairs, 8 based on Foata normal form. 10/205 useless extension candidates. Maximal degree in co-relation 606. Up to 82 conditions per place. [2021-03-25 15:23:17,811 INFO L132 encePairwiseOnDemand]: 299/306 looper letters, 49 selfloop transitions, 21 changer transitions 0/72 dead transitions. [2021-03-25 15:23:17,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 72 transitions, 564 flow [2021-03-25 15:23:17,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 15:23:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 15:23:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1263 transitions. [2021-03-25 15:23:17,855 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5159313725490197 [2021-03-25 15:23:17,856 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1263 transitions. [2021-03-25 15:23:17,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1263 transitions. [2021-03-25 15:23:17,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:23:17,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1263 transitions. [2021-03-25 15:23:17,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 157.875) internal successors, (1263), 8 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 306.0) internal successors, (2754), 9 states have internal predecessors, (2754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,862 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 306.0) internal successors, (2754), 9 states have internal predecessors, (2754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,863 INFO L185 Difference]: Start difference. First operand has 39 places, 44 transitions, 282 flow. Second operand 8 states and 1263 transitions. [2021-03-25 15:23:17,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 72 transitions, 564 flow [2021-03-25 15:23:17,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 546 flow, removed 9 selfloop flow, removed 0 redundant places. [2021-03-25 15:23:17,868 INFO L241 Difference]: Finished difference. Result has 52 places, 53 transitions, 406 flow [2021-03-25 15:23:17,868 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=406, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2021-03-25 15:23:17,868 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2021-03-25 15:23:17,868 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:23:17,868 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 53 transitions, 406 flow [2021-03-25 15:23:17,869 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 53 transitions, 406 flow [2021-03-25 15:23:17,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 53 transitions, 406 flow [2021-03-25 15:23:17,879 INFO L129 PetriNetUnfolder]: 27/121 cut-off events. [2021-03-25 15:23:17,880 INFO L130 PetriNetUnfolder]: For 244/246 co-relation queries the response was YES. [2021-03-25 15:23:17,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 121 events. 27/121 cut-off events. For 244/246 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 517 event pairs, 3 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 240. Up to 34 conditions per place. [2021-03-25 15:23:17,881 INFO L142 LiptonReduction]: Number of co-enabled transitions 72 [2021-03-25 15:23:17,891 INFO L154 LiptonReduction]: Checked pairs total: 202 [2021-03-25 15:23:17,891 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:23:17,891 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-25 15:23:17,892 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 406 flow [2021-03-25 15:23:17,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.33333333333334) internal successors, (926), 6 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:17,892 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:23:17,892 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:23:17,893 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 15:23:17,893 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:23:17,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:23:17,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1988800215, now seen corresponding path program 2 times [2021-03-25 15:23:17,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:23:17,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770386351] [2021-03-25 15:23:17,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:23:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:23:18,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:18,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:23:18,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:18,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 15:23:18,049 INFO L142 QuantifierPusher]: treesize reduction 6, result has 83.3 percent of original size [2021-03-25 15:23:18,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 15:23:18,066 INFO L142 QuantifierPusher]: treesize reduction 6, result has 86.0 percent of original size [2021-03-25 15:23:18,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 15:23:18,074 INFO L142 QuantifierPusher]: treesize reduction 6, result has 85.7 percent of original size [2021-03-25 15:23:18,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 15:23:18,097 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.1 percent of original size [2021-03-25 15:23:18,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 15:23:18,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:18,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:23:18,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:18,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:23:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:23:18,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770386351] [2021-03-25 15:23:18,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:23:18,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 15:23:18,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478943845] [2021-03-25 15:23:18,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 15:23:18,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:23:18,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 15:23:18,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 15:23:18,134 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 306 [2021-03-25 15:23:18,135 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 406 flow. Second operand has 8 states, 8 states have (on average 142.75) internal successors, (1142), 8 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:18,135 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:23:18,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 306 [2021-03-25 15:23:18,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:23:18,455 INFO L129 PetriNetUnfolder]: 101/281 cut-off events. [2021-03-25 15:23:18,455 INFO L130 PetriNetUnfolder]: For 680/680 co-relation queries the response was YES. [2021-03-25 15:23:18,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 281 events. 101/281 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1402 event pairs, 22 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 1019. Up to 110 conditions per place. [2021-03-25 15:23:18,458 INFO L132 encePairwiseOnDemand]: 299/306 looper letters, 53 selfloop transitions, 23 changer transitions 0/80 dead transitions. [2021-03-25 15:23:18,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 744 flow [2021-03-25 15:23:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 15:23:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 15:23:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 882 transitions. [2021-03-25 15:23:18,461 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2021-03-25 15:23:18,461 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 882 transitions. [2021-03-25 15:23:18,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 882 transitions. [2021-03-25 15:23:18,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:23:18,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 882 transitions. [2021-03-25 15:23:18,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:18,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:18,466 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:18,466 INFO L185 Difference]: Start difference. First operand has 52 places, 53 transitions, 406 flow. Second operand 6 states and 882 transitions. [2021-03-25 15:23:18,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 744 flow [2021-03-25 15:23:18,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 80 transitions, 724 flow, removed 10 selfloop flow, removed 0 redundant places. [2021-03-25 15:23:18,471 INFO L241 Difference]: Finished difference. Result has 58 places, 61 transitions, 533 flow [2021-03-25 15:23:18,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=58, PETRI_TRANSITIONS=61} [2021-03-25 15:23:18,471 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2021-03-25 15:23:18,471 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:23:18,471 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 61 transitions, 533 flow [2021-03-25 15:23:18,472 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 61 transitions, 533 flow [2021-03-25 15:23:18,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 533 flow [2021-03-25 15:23:18,486 INFO L129 PetriNetUnfolder]: 36/164 cut-off events. [2021-03-25 15:23:18,487 INFO L130 PetriNetUnfolder]: For 433/433 co-relation queries the response was YES. [2021-03-25 15:23:18,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 164 events. 36/164 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 875 event pairs, 6 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 390. Up to 40 conditions per place. [2021-03-25 15:23:18,488 INFO L142 LiptonReduction]: Number of co-enabled transitions 86 [2021-03-25 15:23:18,494 INFO L154 LiptonReduction]: Checked pairs total: 270 [2021-03-25 15:23:18,494 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:23:18,495 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-25 15:23:18,495 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 61 transitions, 533 flow [2021-03-25 15:23:18,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 142.75) internal successors, (1142), 8 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:18,496 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:23:18,496 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:23:18,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 15:23:18,496 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:23:18,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:23:18,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1603933597, now seen corresponding path program 3 times [2021-03-25 15:23:18,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:23:18,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013105348] [2021-03-25 15:23:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:23:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:23:18,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:18,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:23:18,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:18,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:23:18,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:18,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 15:23:18,663 INFO L142 QuantifierPusher]: treesize reduction 28, result has 50.9 percent of original size [2021-03-25 15:23:18,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 15:23:18,683 INFO L142 QuantifierPusher]: treesize reduction 28, result has 56.3 percent of original size [2021-03-25 15:23:18,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 15:23:18,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:18,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 15:23:18,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:18,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:23:18,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:23:18,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:23:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:23:18,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013105348] [2021-03-25 15:23:18,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:23:18,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 15:23:18,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304601841] [2021-03-25 15:23:18,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 15:23:18,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:23:18,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 15:23:18,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 15:23:18,726 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 306 [2021-03-25 15:23:18,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 533 flow. Second operand has 8 states, 8 states have (on average 142.75) internal successors, (1142), 8 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:18,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:23:18,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 306 [2021-03-25 15:23:18,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:23:19,126 INFO L129 PetriNetUnfolder]: 116/321 cut-off events. [2021-03-25 15:23:19,127 INFO L130 PetriNetUnfolder]: For 980/980 co-relation queries the response was YES. [2021-03-25 15:23:19,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 321 events. 116/321 cut-off events. For 980/980 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1704 event pairs, 20 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 1225. Up to 109 conditions per place. [2021-03-25 15:23:19,130 INFO L132 encePairwiseOnDemand]: 298/306 looper letters, 58 selfloop transitions, 37 changer transitions 0/99 dead transitions. [2021-03-25 15:23:19,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 957 flow [2021-03-25 15:23:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 15:23:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 15:23:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1180 transitions. [2021-03-25 15:23:19,133 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4820261437908497 [2021-03-25 15:23:19,133 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1180 transitions. [2021-03-25 15:23:19,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1180 transitions. [2021-03-25 15:23:19,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:23:19,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1180 transitions. [2021-03-25 15:23:19,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 147.5) internal successors, (1180), 8 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:19,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 306.0) internal successors, (2754), 9 states have internal predecessors, (2754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:19,140 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 306.0) internal successors, (2754), 9 states have internal predecessors, (2754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:19,140 INFO L185 Difference]: Start difference. First operand has 58 places, 61 transitions, 533 flow. Second operand 8 states and 1180 transitions. [2021-03-25 15:23:19,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 957 flow [2021-03-25 15:23:19,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 99 transitions, 926 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-03-25 15:23:19,177 INFO L241 Difference]: Finished difference. Result has 66 places, 76 transitions, 756 flow [2021-03-25 15:23:19,177 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=756, PETRI_PLACES=66, PETRI_TRANSITIONS=76} [2021-03-25 15:23:19,177 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2021-03-25 15:23:19,178 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:23:19,178 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 76 transitions, 756 flow [2021-03-25 15:23:19,178 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 76 transitions, 756 flow [2021-03-25 15:23:19,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 76 transitions, 756 flow [2021-03-25 15:23:19,195 INFO L129 PetriNetUnfolder]: 38/179 cut-off events. [2021-03-25 15:23:19,195 INFO L130 PetriNetUnfolder]: For 665/668 co-relation queries the response was YES. [2021-03-25 15:23:19,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 179 events. 38/179 cut-off events. For 665/668 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1025 event pairs, 4 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 471. Up to 41 conditions per place. [2021-03-25 15:23:19,197 INFO L142 LiptonReduction]: Number of co-enabled transitions 114 [2021-03-25 15:23:19,206 INFO L154 LiptonReduction]: Checked pairs total: 486 [2021-03-25 15:23:19,207 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:23:19,207 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-03-25 15:23:19,207 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 76 transitions, 756 flow [2021-03-25 15:23:19,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 142.75) internal successors, (1142), 8 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:23:19,208 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:23:19,208 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:23:19,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 15:23:19,208 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:23:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:23:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash 607125571, now seen corresponding path program 1 times [2021-03-25 15:23:19,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:23:19,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709747735] [2021-03-25 15:23:19,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:23:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 15:23:19,251 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 15:23:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 15:23:19,291 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 15:23:19,328 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 15:23:19,328 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 15:23:19,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 15:23:19,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 03:23:19 BasicIcfg [2021-03-25 15:23:19,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 15:23:19,396 INFO L168 Benchmark]: Toolchain (without parser) took 83402.18 ms. Allocated memory was 255.9 MB in the beginning and 459.3 MB in the end (delta: 203.4 MB). Free memory was 232.4 MB in the beginning and 377.0 MB in the end (delta: -144.6 MB). Peak memory consumption was 58.7 MB. Max. memory is 16.0 GB. [2021-03-25 15:23:19,396 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 238.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 15:23:19,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.42 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 232.0 MB in the beginning and 282.8 MB in the end (delta: -50.8 MB). Peak memory consumption was 60.3 MB. Max. memory is 16.0 GB. [2021-03-25 15:23:19,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.22 ms. Allocated memory is still 367.0 MB. Free memory was 282.8 MB in the beginning and 278.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 15:23:19,397 INFO L168 Benchmark]: Boogie Preprocessor took 38.81 ms. Allocated memory is still 367.0 MB. Free memory was 278.9 MB in the beginning and 276.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 15:23:19,397 INFO L168 Benchmark]: RCFGBuilder took 713.45 ms. Allocated memory is still 367.0 MB. Free memory was 276.8 MB in the beginning and 227.6 MB in the end (delta: 49.3 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. [2021-03-25 15:23:19,397 INFO L168 Benchmark]: TraceAbstraction took 81725.75 ms. Allocated memory was 367.0 MB in the beginning and 459.3 MB in the end (delta: 92.3 MB). Free memory was 227.6 MB in the beginning and 377.0 MB in the end (delta: -149.4 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 15:23:19,398 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 238.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 853.42 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 232.0 MB in the beginning and 282.8 MB in the end (delta: -50.8 MB). Peak memory consumption was 60.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 65.22 ms. Allocated memory is still 367.0 MB. Free memory was 282.8 MB in the beginning and 278.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 38.81 ms. Allocated memory is still 367.0 MB. Free memory was 278.9 MB in the beginning and 276.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 713.45 ms. Allocated memory is still 367.0 MB. Free memory was 276.8 MB in the beginning and 227.6 MB in the end (delta: 49.3 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 81725.75 ms. Allocated memory was 367.0 MB in the beginning and 459.3 MB in the end (delta: 92.3 MB). Free memory was 227.6 MB in the beginning and 377.0 MB in the end (delta: -149.4 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32499.9ms, 142 PlacesBefore, 61 PlacesAfterwards, 144 TransitionsBefore, 62 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 4 FixpointIterations, 63 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 1692 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 951, positive: 902, positive conditional: 0, positive unconditional: 902, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 857, positive: 830, positive conditional: 0, positive unconditional: 830, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 857, positive: 830, positive conditional: 0, positive unconditional: 830, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 857, positive: 830, positive conditional: 0, positive unconditional: 830, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29361, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 559, negative conditional: 0, negative unconditional: 559, unknown: 28802, unknown conditional: 0, unknown unconditional: 28802] ], Cache Queries: [ total: 951, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 857, unknown conditional: 0, unknown unconditional: 857] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22654.7ms, 58 PlacesBefore, 37 PlacesAfterwards, 56 TransitionsBefore, 37 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 4 FixpointIterations, 20 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 26 TotalNumberOfCompositions, 768 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 187, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 91, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 91, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19658, positive: 231, positive conditional: 0, positive unconditional: 231, negative: 335, negative conditional: 0, negative unconditional: 335, unknown: 19092, unknown conditional: 0, unknown unconditional: 19092] ], Cache Queries: [ total: 187, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 91, unknown conditional: 0, unknown unconditional: 91] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5241.8ms, 39 PlacesBefore, 35 PlacesAfterwards, 38 TransitionsBefore, 34 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 516 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 109, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 31, Positive conditional cache size: 0, Positive unconditional cache size: 31, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12443.0ms, 35 PlacesBefore, 33 PlacesAfterwards, 37 TransitionsBefore, 35 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 271 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 62, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7054, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 210, negative conditional: 0, negative unconditional: 210, unknown: 6844, unknown conditional: 0, unknown unconditional: 6844] ], Cache Queries: [ total: 62, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2374.0ms, 35 PlacesBefore, 34 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 421 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 112, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2184, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 2114, unknown conditional: 0, unknown unconditional: 2114] ], Cache Queries: [ total: 112, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2192.5ms, 26 PlacesBefore, 25 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 26 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2185, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 2115, unknown conditional: 0, unknown unconditional: 2115] ], Cache Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.9ms, 32 PlacesBefore, 32 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 77 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.4ms, 39 PlacesBefore, 39 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 140 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.3ms, 52 PlacesBefore, 52 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 202 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.7ms, 58 PlacesBefore, 58 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 270 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.8ms, 66 PlacesBefore, 66 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 486 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1688] 0 struct device *my_dev; [L1727] 0 return 0; [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1707] 0 data->shared.a [L1675] COND FALSE 0 !(!expression) [L1708] 0 data->shared.b [L1675] COND FALSE 0 !(!expression) [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={9:24}, t1={7:0}, t2={3:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={9:24}, t1={7:0}, t2={3:0}] [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [arg={0:0}, my_dev={9:24}, t1={7:0}, t2={3:0}] [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 1 data->shared.a = 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, my_dev={9:24}, t1={7:0}, t2={3:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 2 data->shared.a = 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={3:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 [L1701] 1 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={3:0}] [L1699] 2 data->shared.b = lb + 1 [L1701] 2 return 0; [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={3:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={3:0}] [L1740] 0 data.shared.a [L1675] COND FALSE 0 !(!expression) [L1741] 0 data.shared.b [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 81568.4ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2231.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 32590.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 139 SDtfs, 176 SDslu, 68 SDs, 0 SdLazy, 700 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 960.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 649.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=756occurred in iteration=10, InterpolantAutomatonStates: 54, 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: 26.6ms SsaConstructionTime, 265.6ms SatisfiabilityAnalysisTime, 1031.8ms InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 1165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...