/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-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 11:47:24,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 11:47:24,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 11:47:24,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 11:47:24,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 11:47:24,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 11:47:24,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 11:47:24,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 11:47:24,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 11:47:24,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 11:47:24,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 11:47:24,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 11:47:24,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 11:47:24,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 11:47:24,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 11:47:24,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 11:47:24,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 11:47:24,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 11:47:24,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 11:47:24,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 11:47:24,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 11:47:24,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 11:47:24,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 11:47:24,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 11:47:24,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 11:47:24,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 11:47:24,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 11:47:24,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 11:47:24,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 11:47:24,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 11:47:24,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 11:47:24,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 11:47:24,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 11:47:24,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 11:47:24,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 11:47:24,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 11:47:24,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 11:47:24,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 11:47:24,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 11:47:24,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 11:47:24,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 11:47:24,912 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-NoLbe-After.epf [2022-01-19 11:47:24,959 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 11:47:24,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 11:47:24,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 11:47:24,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 11:47:24,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 11:47:24,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 11:47:24,965 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 11:47:24,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 11:47:24,965 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 11:47:24,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 11:47:24,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 11:47:24,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 11:47:24,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 11:47:24,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 11:47:24,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 11:47:24,966 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 11:47:24,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 11:47:24,966 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 11:47:24,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 11:47:24,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 11:47:24,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 11:47:24,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 11:47:24,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 11:47:24,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:47:24,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 11:47:24,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 11:47:24,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 11:47:24,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 11:47:24,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 11:47:24,967 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 11:47:24,967 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 11:47:24,967 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 11:47:24,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-01-19 11:47:25,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 11:47:25,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 11:47:25,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 11:47:25,163 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 11:47:25,165 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 11:47:25,166 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-01-19 11:47:25,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ea90cbe/5ae62ad4e7bf48a6bf06dc78647dcb48/FLAGedf320369 [2022-01-19 11:47:25,567 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 11:47:25,567 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-01-19 11:47:25,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ea90cbe/5ae62ad4e7bf48a6bf06dc78647dcb48/FLAGedf320369 [2022-01-19 11:47:25,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ea90cbe/5ae62ad4e7bf48a6bf06dc78647dcb48 [2022-01-19 11:47:25,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 11:47:25,959 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 11:47:25,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 11:47:25,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 11:47:25,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 11:47:25,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:47:25" (1/1) ... [2022-01-19 11:47:25,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136bf06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:25, skipping insertion in model container [2022-01-19 11:47:25,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:47:25" (1/1) ... [2022-01-19 11:47:25,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 11:47:25,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 11:47:26,091 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-19 11:47:26,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39095,39108] [2022-01-19 11:47:26,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39180,39193] [2022-01-19 11:47:26,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39232,39245] [2022-01-19 11:47:26,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:47:26,246 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 11:47:26,256 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-19 11:47:26,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39095,39108] [2022-01-19 11:47:26,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39180,39193] [2022-01-19 11:47:26,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39232,39245] [2022-01-19 11:47:26,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:47:26,326 INFO L208 MainTranslator]: Completed translation [2022-01-19 11:47:26,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:26 WrapperNode [2022-01-19 11:47:26,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 11:47:26,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 11:47:26,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 11:47:26,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 11:47:26,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:26" (1/1) ... [2022-01-19 11:47:26,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:26" (1/1) ... [2022-01-19 11:47:26,377 INFO L137 Inliner]: procedures = 224, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2022-01-19 11:47:26,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 11:47:26,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 11:47:26,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 11:47:26,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 11:47:26,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:26" (1/1) ... [2022-01-19 11:47:26,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:26" (1/1) ... [2022-01-19 11:47:26,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:26" (1/1) ... [2022-01-19 11:47:26,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:26" (1/1) ... [2022-01-19 11:47:26,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:26" (1/1) ... [2022-01-19 11:47:26,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:26" (1/1) ... [2022-01-19 11:47:26,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:26" (1/1) ... [2022-01-19 11:47:26,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 11:47:26,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 11:47:26,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 11:47:26,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 11:47:26,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:26" (1/1) ... [2022-01-19 11:47:26,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:47:26,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 11:47:26,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 11:47:26,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 11:47:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2022-01-19 11:47:26,450 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2022-01-19 11:47:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 11:47:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 11:47:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 11:47:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 11:47:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 11:47:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 11:47:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 11:47:26,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 11:47:26,451 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 11:47:26,568 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 11:47:26,569 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 11:47:26,806 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 11:47:26,812 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 11:47:26,812 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-19 11:47:26,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:47:26 BoogieIcfgContainer [2022-01-19 11:47:26,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 11:47:26,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 11:47:26,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 11:47:26,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 11:47:26,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 11:47:25" (1/3) ... [2022-01-19 11:47:26,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7059486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:47:26, skipping insertion in model container [2022-01-19 11:47:26,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:47:26" (2/3) ... [2022-01-19 11:47:26,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7059486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:47:26, skipping insertion in model container [2022-01-19 11:47:26,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:47:26" (3/3) ... [2022-01-19 11:47:26,827 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2022-01-19 11:47:26,831 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 11:47:26,831 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-19 11:47:26,831 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 11:47:26,882 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,882 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,883 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,883 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,883 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,883 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,883 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,884 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,884 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,884 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,884 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,884 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,885 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,885 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,885 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,885 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,885 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,885 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,886 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,886 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,886 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,886 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,886 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,887 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,888 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,888 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,889 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,889 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,889 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,890 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,890 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,890 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,890 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,890 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,890 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,890 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,890 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,890 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,891 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,891 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,891 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,891 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,891 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,891 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,891 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,891 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,891 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,892 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,892 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,892 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,892 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,892 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,892 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,893 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,893 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,893 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,893 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,893 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,893 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,893 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,893 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,893 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,893 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,893 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,894 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,894 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,895 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,895 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,895 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,895 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,895 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,895 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,895 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,896 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,896 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,896 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,896 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,896 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,896 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,896 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,896 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,896 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,897 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,897 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,898 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,898 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,898 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,898 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,899 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,899 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,901 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,904 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,905 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,905 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,905 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,905 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,905 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,906 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,906 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,906 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,907 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,907 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,907 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,907 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,907 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,907 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,907 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,908 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,908 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,908 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,908 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,908 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,908 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,908 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,908 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,908 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,908 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,909 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,909 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,909 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,909 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,909 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,909 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,909 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,909 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,909 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,910 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,910 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,910 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,910 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,910 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,910 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,911 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,911 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,911 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,911 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,911 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,912 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,912 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,912 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,913 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,913 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,913 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,913 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,913 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,914 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,914 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,914 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,914 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,914 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,914 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,914 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,914 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,914 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,915 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,916 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,916 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,916 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,916 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,916 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,917 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,917 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,917 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,917 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,918 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,918 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,918 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,918 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,918 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,918 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,918 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,918 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,918 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,918 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,919 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,919 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,919 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,919 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,919 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,919 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,919 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,919 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,919 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,919 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,920 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,920 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,920 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,920 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,920 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,920 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,920 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,920 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,921 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,921 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,921 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,921 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,921 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,921 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,921 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,921 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,922 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,922 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,922 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,922 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,922 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,922 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,922 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,922 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,922 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,922 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,923 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,923 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,923 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,923 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,924 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,924 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,925 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,928 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,929 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,929 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,929 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,929 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,929 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,929 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,929 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,929 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,930 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,930 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,931 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,931 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,931 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,931 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,931 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,931 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,931 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,931 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,932 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,932 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,932 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,932 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,932 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,933 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,933 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,937 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,938 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,938 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,938 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,938 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,938 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,938 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,939 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,939 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,939 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,939 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,939 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,939 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,945 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,945 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,945 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,945 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,945 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,945 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,945 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,946 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,946 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,946 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,946 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,946 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,946 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,946 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,947 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,947 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,947 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,947 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,947 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,947 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,947 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,947 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,948 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,948 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,948 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,948 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,948 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,948 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,948 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:47:26,952 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-19 11:47:27,005 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 11:47:27,011 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 11:47:27,011 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 11:47:27,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 152 places, 158 transitions, 324 flow [2022-01-19 11:47:27,075 INFO L129 PetriNetUnfolder]: 10/157 cut-off events. [2022-01-19 11:47:27,075 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 11:47:27,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 157 events. 10/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 270 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2022-01-19 11:47:27,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 158 transitions, 324 flow [2022-01-19 11:47:27,086 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 148 transitions, 299 flow [2022-01-19 11:47:27,098 INFO L129 PetriNetUnfolder]: 2/51 cut-off events. [2022-01-19 11:47:27,098 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:47:27,098 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:47:27,099 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:47:27,099 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:47:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:47:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash 847621616, now seen corresponding path program 1 times [2022-01-19 11:47:27,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:47:27,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687456044] [2022-01-19 11:47:27,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:47:27,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:47:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:47:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:47:27,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:47:27,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687456044] [2022-01-19 11:47:27,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687456044] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:47:27,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:47:27,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 11:47:27,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959817727] [2022-01-19 11:47:27,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:47:27,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 11:47:27,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:47:27,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 11:47:27,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 11:47:27,327 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 158 [2022-01-19 11:47:27,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 148 transitions, 299 flow. Second operand has 2 states, 2 states have (on average 151.0) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:27,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:47:27,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 158 [2022-01-19 11:47:27,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:47:27,360 INFO L129 PetriNetUnfolder]: 4/142 cut-off events. [2022-01-19 11:47:27,360 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 11:47:27,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 4/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 213 event pairs, 0 based on Foata normal form. 6/141 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2022-01-19 11:47:27,362 INFO L132 encePairwiseOnDemand]: 152/158 looper letters, 1 selfloop transitions, 0 changer transitions 0/142 dead transitions. [2022-01-19 11:47:27,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 142 transitions, 289 flow [2022-01-19 11:47:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 11:47:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 11:47:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2022-01-19 11:47:27,371 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9715189873417721 [2022-01-19 11:47:27,371 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2022-01-19 11:47:27,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2022-01-19 11:47:27,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:47:27,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2022-01-19 11:47:27,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:27,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:27,380 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:27,381 INFO L186 Difference]: Start difference. First operand has 142 places, 148 transitions, 299 flow. Second operand 2 states and 307 transitions. [2022-01-19 11:47:27,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 142 transitions, 289 flow [2022-01-19 11:47:27,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 142 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 11:47:27,386 INFO L242 Difference]: Finished difference. Result has 142 places, 142 transitions, 286 flow [2022-01-19 11:47:27,387 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=286, PETRI_PLACES=142, PETRI_TRANSITIONS=142} [2022-01-19 11:47:27,390 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 0 predicate places. [2022-01-19 11:47:27,390 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 142 transitions, 286 flow [2022-01-19 11:47:27,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 151.0) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:27,390 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:47:27,390 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:47:27,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 11:47:27,391 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:47:27,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:47:27,391 INFO L85 PathProgramCache]: Analyzing trace with hash 506434889, now seen corresponding path program 1 times [2022-01-19 11:47:27,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:47:27,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887200929] [2022-01-19 11:47:27,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:47:27,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:47:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:47:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:47:27,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:47:27,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887200929] [2022-01-19 11:47:27,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887200929] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:47:27,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:47:27,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 11:47:27,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356490647] [2022-01-19 11:47:27,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:47:27,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 11:47:27,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:47:27,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 11:47:27,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 11:47:27,448 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 158 [2022-01-19 11:47:27,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 142 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:27,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:47:27,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 158 [2022-01-19 11:47:27,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:47:27,482 INFO L129 PetriNetUnfolder]: 5/185 cut-off events. [2022-01-19 11:47:27,482 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:47:27,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 185 events. 5/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 161 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 196. Up to 7 conditions per place. [2022-01-19 11:47:27,484 INFO L132 encePairwiseOnDemand]: 155/158 looper letters, 7 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2022-01-19 11:47:27,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 145 transitions, 310 flow [2022-01-19 11:47:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 11:47:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 11:47:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2022-01-19 11:47:27,486 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9388185654008439 [2022-01-19 11:47:27,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2022-01-19 11:47:27,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2022-01-19 11:47:27,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:47:27,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2022-01-19 11:47:27,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:27,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:27,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:27,490 INFO L186 Difference]: Start difference. First operand has 142 places, 142 transitions, 286 flow. Second operand 3 states and 445 transitions. [2022-01-19 11:47:27,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 145 transitions, 310 flow [2022-01-19 11:47:27,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 145 transitions, 310 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 11:47:27,493 INFO L242 Difference]: Finished difference. Result has 145 places, 143 transitions, 298 flow [2022-01-19 11:47:27,493 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=145, PETRI_TRANSITIONS=143} [2022-01-19 11:47:27,493 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 3 predicate places. [2022-01-19 11:47:27,493 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 298 flow [2022-01-19 11:47:27,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:27,494 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:47:27,494 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:47:27,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 11:47:27,495 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:47:27,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:47:27,495 INFO L85 PathProgramCache]: Analyzing trace with hash -654644372, now seen corresponding path program 1 times [2022-01-19 11:47:27,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:47:27,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490682039] [2022-01-19 11:47:27,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:47:27,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:47:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:47:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:47:27,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:47:27,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490682039] [2022-01-19 11:47:27,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490682039] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:47:27,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:47:27,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-19 11:47:27,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385095340] [2022-01-19 11:47:27,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:47:27,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 11:47:27,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:47:27,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 11:47:27,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-01-19 11:47:27,894 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 158 [2022-01-19 11:47:27,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 298 flow. Second operand has 18 states, 18 states have (on average 88.27777777777777) internal successors, (1589), 18 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:27,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:47:27,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 158 [2022-01-19 11:47:27,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:47:29,618 INFO L129 PetriNetUnfolder]: 583/2004 cut-off events. [2022-01-19 11:47:29,618 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-19 11:47:29,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3132 conditions, 2004 events. 583/2004 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 12792 event pairs, 252 based on Foata normal form. 0/1894 useless extension candidates. Maximal degree in co-relation 3127. Up to 766 conditions per place. [2022-01-19 11:47:29,628 INFO L132 encePairwiseOnDemand]: 137/158 looper letters, 129 selfloop transitions, 34 changer transitions 10/255 dead transitions. [2022-01-19 11:47:29,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 255 transitions, 868 flow [2022-01-19 11:47:29,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 11:47:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 11:47:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2067 transitions. [2022-01-19 11:47:29,632 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5946490218642118 [2022-01-19 11:47:29,632 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2067 transitions. [2022-01-19 11:47:29,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2067 transitions. [2022-01-19 11:47:29,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:47:29,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2067 transitions. [2022-01-19 11:47:29,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 93.95454545454545) internal successors, (2067), 22 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:29,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 158.0) internal successors, (3634), 23 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:29,643 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 158.0) internal successors, (3634), 23 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:29,643 INFO L186 Difference]: Start difference. First operand has 145 places, 143 transitions, 298 flow. Second operand 22 states and 2067 transitions. [2022-01-19 11:47:29,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 255 transitions, 868 flow [2022-01-19 11:47:29,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 255 transitions, 866 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 11:47:29,647 INFO L242 Difference]: Finished difference. Result has 175 places, 174 transitions, 503 flow [2022-01-19 11:47:29,648 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=503, PETRI_PLACES=175, PETRI_TRANSITIONS=174} [2022-01-19 11:47:29,648 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 33 predicate places. [2022-01-19 11:47:29,648 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 174 transitions, 503 flow [2022-01-19 11:47:29,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 88.27777777777777) internal successors, (1589), 18 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:29,649 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:47:29,649 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:47:29,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 11:47:29,649 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:47:29,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:47:29,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2143908831, now seen corresponding path program 1 times [2022-01-19 11:47:29,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:47:29,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137178953] [2022-01-19 11:47:29,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:47:29,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:47:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:47:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:47:30,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:47:30,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137178953] [2022-01-19 11:47:30,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137178953] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:47:30,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:47:30,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:47:30,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845606323] [2022-01-19 11:47:30,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:47:30,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:47:30,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:47:30,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:47:30,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:47:30,292 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:47:30,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 174 transitions, 503 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:30,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:47:30,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:47:30,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:47:34,272 INFO L129 PetriNetUnfolder]: 1897/5425 cut-off events. [2022-01-19 11:47:34,272 INFO L130 PetriNetUnfolder]: For 1621/1626 co-relation queries the response was YES. [2022-01-19 11:47:34,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11032 conditions, 5425 events. 1897/5425 cut-off events. For 1621/1626 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 38964 event pairs, 636 based on Foata normal form. 20/5207 useless extension candidates. Maximal degree in co-relation 11017. Up to 1877 conditions per place. [2022-01-19 11:47:34,305 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 337 selfloop transitions, 91 changer transitions 3/502 dead transitions. [2022-01-19 11:47:34,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 502 transitions, 2593 flow [2022-01-19 11:47:34,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 11:47:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 11:47:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3138 transitions. [2022-01-19 11:47:34,311 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5367772836127267 [2022-01-19 11:47:34,311 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3138 transitions. [2022-01-19 11:47:34,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3138 transitions. [2022-01-19 11:47:34,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:47:34,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3138 transitions. [2022-01-19 11:47:34,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 84.8108108108108) internal successors, (3138), 37 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:34,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:34,325 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:34,325 INFO L186 Difference]: Start difference. First operand has 175 places, 174 transitions, 503 flow. Second operand 37 states and 3138 transitions. [2022-01-19 11:47:34,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 502 transitions, 2593 flow [2022-01-19 11:47:34,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 502 transitions, 2582 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 11:47:34,341 INFO L242 Difference]: Finished difference. Result has 230 places, 255 transitions, 1245 flow [2022-01-19 11:47:34,341 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1245, PETRI_PLACES=230, PETRI_TRANSITIONS=255} [2022-01-19 11:47:34,342 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 88 predicate places. [2022-01-19 11:47:34,342 INFO L470 AbstractCegarLoop]: Abstraction has has 230 places, 255 transitions, 1245 flow [2022-01-19 11:47:34,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:34,344 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:47:34,344 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:47:34,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 11:47:34,344 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:47:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:47:34,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1028678017, now seen corresponding path program 2 times [2022-01-19 11:47:34,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:47:34,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405819369] [2022-01-19 11:47:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:47:34,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:47:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:47:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:47:34,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:47:34,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405819369] [2022-01-19 11:47:34,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405819369] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:47:34,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:47:34,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:47:34,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972227599] [2022-01-19 11:47:34,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:47:34,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:47:34,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:47:34,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:47:34,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:47:34,955 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:47:34,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 255 transitions, 1245 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:34,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:47:34,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:47:34,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:47:39,107 INFO L129 PetriNetUnfolder]: 2297/6566 cut-off events. [2022-01-19 11:47:39,107 INFO L130 PetriNetUnfolder]: For 8292/8295 co-relation queries the response was YES. [2022-01-19 11:47:39,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16912 conditions, 6566 events. 2297/6566 cut-off events. For 8292/8295 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 50250 event pairs, 427 based on Foata normal form. 18/6302 useless extension candidates. Maximal degree in co-relation 16872. Up to 2347 conditions per place. [2022-01-19 11:47:39,153 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 367 selfloop transitions, 116 changer transitions 1/555 dead transitions. [2022-01-19 11:47:39,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 555 transitions, 3917 flow [2022-01-19 11:47:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 11:47:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 11:47:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3117 transitions. [2022-01-19 11:47:39,160 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5331850838179952 [2022-01-19 11:47:39,160 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3117 transitions. [2022-01-19 11:47:39,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3117 transitions. [2022-01-19 11:47:39,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:47:39,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3117 transitions. [2022-01-19 11:47:39,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 84.24324324324324) internal successors, (3117), 37 states have internal predecessors, (3117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:39,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:39,176 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:39,176 INFO L186 Difference]: Start difference. First operand has 230 places, 255 transitions, 1245 flow. Second operand 37 states and 3117 transitions. [2022-01-19 11:47:39,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 555 transitions, 3917 flow [2022-01-19 11:47:39,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 555 transitions, 3890 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-01-19 11:47:39,206 INFO L242 Difference]: Finished difference. Result has 283 places, 326 transitions, 2220 flow [2022-01-19 11:47:39,207 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=2220, PETRI_PLACES=283, PETRI_TRANSITIONS=326} [2022-01-19 11:47:39,207 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 141 predicate places. [2022-01-19 11:47:39,207 INFO L470 AbstractCegarLoop]: Abstraction has has 283 places, 326 transitions, 2220 flow [2022-01-19 11:47:39,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:39,208 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:47:39,208 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:47:39,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 11:47:39,208 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:47:39,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:47:39,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1366726909, now seen corresponding path program 3 times [2022-01-19 11:47:39,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:47:39,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138247040] [2022-01-19 11:47:39,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:47:39,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:47:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:47:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:47:39,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:47:39,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138247040] [2022-01-19 11:47:39,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138247040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:47:39,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:47:39,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:47:39,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867806230] [2022-01-19 11:47:39,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:47:39,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:47:39,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:47:39,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:47:39,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:47:39,782 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:47:39,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 326 transitions, 2220 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:39,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:47:39,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:47:39,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:47:45,768 INFO L129 PetriNetUnfolder]: 3204/8725 cut-off events. [2022-01-19 11:47:45,769 INFO L130 PetriNetUnfolder]: For 27009/27024 co-relation queries the response was YES. [2022-01-19 11:47:45,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28865 conditions, 8725 events. 3204/8725 cut-off events. For 27009/27024 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 70156 event pairs, 762 based on Foata normal form. 25/8397 useless extension candidates. Maximal degree in co-relation 28802. Up to 3450 conditions per place. [2022-01-19 11:47:45,862 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 484 selfloop transitions, 160 changer transitions 14/729 dead transitions. [2022-01-19 11:47:45,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 729 transitions, 6309 flow [2022-01-19 11:47:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-19 11:47:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-01-19 11:47:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 4127 transitions. [2022-01-19 11:47:45,867 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5330663911134074 [2022-01-19 11:47:45,867 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 4127 transitions. [2022-01-19 11:47:45,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 4127 transitions. [2022-01-19 11:47:45,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:47:45,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 4127 transitions. [2022-01-19 11:47:45,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 84.22448979591837) internal successors, (4127), 49 states have internal predecessors, (4127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:45,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 158.0) internal successors, (7900), 50 states have internal predecessors, (7900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:45,880 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 158.0) internal successors, (7900), 50 states have internal predecessors, (7900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:45,880 INFO L186 Difference]: Start difference. First operand has 283 places, 326 transitions, 2220 flow. Second operand 49 states and 4127 transitions. [2022-01-19 11:47:45,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 729 transitions, 6309 flow [2022-01-19 11:47:45,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 729 transitions, 6043 flow, removed 104 selfloop flow, removed 8 redundant places. [2022-01-19 11:47:45,986 INFO L242 Difference]: Finished difference. Result has 360 places, 445 transitions, 3911 flow [2022-01-19 11:47:45,986 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=2040, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=3911, PETRI_PLACES=360, PETRI_TRANSITIONS=445} [2022-01-19 11:47:45,988 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 218 predicate places. [2022-01-19 11:47:45,988 INFO L470 AbstractCegarLoop]: Abstraction has has 360 places, 445 transitions, 3911 flow [2022-01-19 11:47:45,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:45,989 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:47:45,989 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:47:45,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 11:47:45,989 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:47:45,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:47:45,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1084924805, now seen corresponding path program 4 times [2022-01-19 11:47:45,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:47:45,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211306173] [2022-01-19 11:47:45,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:47:45,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:47:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:47:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:47:46,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:47:46,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211306173] [2022-01-19 11:47:46,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211306173] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:47:46,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:47:46,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:47:46,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109069622] [2022-01-19 11:47:46,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:47:46,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:47:46,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:47:46,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:47:46,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:47:46,682 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:47:46,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 445 transitions, 3911 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:46,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:47:46,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:47:46,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:47:52,079 INFO L129 PetriNetUnfolder]: 3867/10439 cut-off events. [2022-01-19 11:47:52,079 INFO L130 PetriNetUnfolder]: For 57389/57405 co-relation queries the response was YES. [2022-01-19 11:47:52,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38945 conditions, 10439 events. 3867/10439 cut-off events. For 57389/57405 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 87607 event pairs, 1339 based on Foata normal form. 22/10027 useless extension candidates. Maximal degree in co-relation 38845. Up to 4209 conditions per place. [2022-01-19 11:47:52,168 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 567 selfloop transitions, 140 changer transitions 3/781 dead transitions. [2022-01-19 11:47:52,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 781 transitions, 8223 flow [2022-01-19 11:47:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 11:47:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 11:47:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3149 transitions. [2022-01-19 11:47:52,171 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5386589120766336 [2022-01-19 11:47:52,171 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3149 transitions. [2022-01-19 11:47:52,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3149 transitions. [2022-01-19 11:47:52,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:47:52,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3149 transitions. [2022-01-19 11:47:52,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 85.10810810810811) internal successors, (3149), 37 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:52,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:52,180 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:52,180 INFO L186 Difference]: Start difference. First operand has 360 places, 445 transitions, 3911 flow. Second operand 37 states and 3149 transitions. [2022-01-19 11:47:52,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 781 transitions, 8223 flow [2022-01-19 11:47:52,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 781 transitions, 7895 flow, removed 148 selfloop flow, removed 7 redundant places. [2022-01-19 11:47:52,427 INFO L242 Difference]: Finished difference. Result has 418 places, 518 transitions, 5075 flow [2022-01-19 11:47:52,428 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=3594, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=5075, PETRI_PLACES=418, PETRI_TRANSITIONS=518} [2022-01-19 11:47:52,428 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 276 predicate places. [2022-01-19 11:47:52,428 INFO L470 AbstractCegarLoop]: Abstraction has has 418 places, 518 transitions, 5075 flow [2022-01-19 11:47:52,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:52,429 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:47:52,429 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:47:52,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 11:47:52,429 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:47:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:47:52,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1419731227, now seen corresponding path program 5 times [2022-01-19 11:47:52,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:47:52,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508912813] [2022-01-19 11:47:52,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:47:52,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:47:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:47:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:47:52,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:47:52,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508912813] [2022-01-19 11:47:52,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508912813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:47:52,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:47:52,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:47:52,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080432233] [2022-01-19 11:47:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:47:52,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:47:52,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:47:52,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:47:52,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:47:52,973 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:47:52,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 518 transitions, 5075 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:47:52,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:47:52,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:47:52,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:48:00,159 INFO L129 PetriNetUnfolder]: 4098/10904 cut-off events. [2022-01-19 11:48:00,159 INFO L130 PetriNetUnfolder]: For 81686/81704 co-relation queries the response was YES. [2022-01-19 11:48:00,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44392 conditions, 10904 events. 4098/10904 cut-off events. For 81686/81704 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 92694 event pairs, 951 based on Foata normal form. 26/10515 useless extension candidates. Maximal degree in co-relation 44263. Up to 3416 conditions per place. [2022-01-19 11:48:00,304 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 631 selfloop transitions, 299 changer transitions 13/1014 dead transitions. [2022-01-19 11:48:00,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 1014 transitions, 11506 flow [2022-01-19 11:48:00,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-19 11:48:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-01-19 11:48:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 4255 transitions. [2022-01-19 11:48:00,308 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5280466617026558 [2022-01-19 11:48:00,308 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 4255 transitions. [2022-01-19 11:48:00,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 4255 transitions. [2022-01-19 11:48:00,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:48:00,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 4255 transitions. [2022-01-19 11:48:00,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 83.43137254901961) internal successors, (4255), 51 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:00,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 158.0) internal successors, (8216), 52 states have internal predecessors, (8216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:00,320 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 158.0) internal successors, (8216), 52 states have internal predecessors, (8216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:00,321 INFO L186 Difference]: Start difference. First operand has 418 places, 518 transitions, 5075 flow. Second operand 51 states and 4255 transitions. [2022-01-19 11:48:00,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 1014 transitions, 11506 flow [2022-01-19 11:48:00,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 1014 transitions, 10966 flow, removed 260 selfloop flow, removed 6 redundant places. [2022-01-19 11:48:00,747 INFO L242 Difference]: Finished difference. Result has 496 places, 604 transitions, 6902 flow [2022-01-19 11:48:00,748 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=4714, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=6902, PETRI_PLACES=496, PETRI_TRANSITIONS=604} [2022-01-19 11:48:00,748 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 354 predicate places. [2022-01-19 11:48:00,748 INFO L470 AbstractCegarLoop]: Abstraction has has 496 places, 604 transitions, 6902 flow [2022-01-19 11:48:00,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:00,749 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:48:00,749 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:48:00,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 11:48:00,749 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:48:00,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:48:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1657952229, now seen corresponding path program 6 times [2022-01-19 11:48:00,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:48:00,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995327111] [2022-01-19 11:48:00,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:48:00,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:48:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:48:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:48:01,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:48:01,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995327111] [2022-01-19 11:48:01,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995327111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:48:01,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:48:01,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:48:01,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007061083] [2022-01-19 11:48:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:48:01,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:48:01,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:48:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:48:01,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:48:01,278 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:48:01,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 604 transitions, 6902 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:01,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:48:01,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:48:01,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:48:07,784 INFO L129 PetriNetUnfolder]: 4921/13140 cut-off events. [2022-01-19 11:48:07,785 INFO L130 PetriNetUnfolder]: For 155630/155644 co-relation queries the response was YES. [2022-01-19 11:48:07,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60423 conditions, 13140 events. 4921/13140 cut-off events. For 155630/155644 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 117068 event pairs, 1485 based on Foata normal form. 23/12633 useless extension candidates. Maximal degree in co-relation 60260. Up to 5463 conditions per place. [2022-01-19 11:48:07,966 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 723 selfloop transitions, 193 changer transitions 4/991 dead transitions. [2022-01-19 11:48:07,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 991 transitions, 13410 flow [2022-01-19 11:48:07,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 11:48:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 11:48:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3165 transitions. [2022-01-19 11:48:07,969 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5413958262059528 [2022-01-19 11:48:07,969 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3165 transitions. [2022-01-19 11:48:07,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3165 transitions. [2022-01-19 11:48:07,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:48:07,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3165 transitions. [2022-01-19 11:48:07,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 85.54054054054055) internal successors, (3165), 37 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:07,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:07,978 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:07,978 INFO L186 Difference]: Start difference. First operand has 496 places, 604 transitions, 6902 flow. Second operand 37 states and 3165 transitions. [2022-01-19 11:48:07,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 991 transitions, 13410 flow [2022-01-19 11:48:08,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 991 transitions, 12423 flow, removed 219 selfloop flow, removed 15 redundant places. [2022-01-19 11:48:08,640 INFO L242 Difference]: Finished difference. Result has 543 places, 691 transitions, 8480 flow [2022-01-19 11:48:08,640 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=6180, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=8480, PETRI_PLACES=543, PETRI_TRANSITIONS=691} [2022-01-19 11:48:08,641 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 401 predicate places. [2022-01-19 11:48:08,641 INFO L470 AbstractCegarLoop]: Abstraction has has 543 places, 691 transitions, 8480 flow [2022-01-19 11:48:08,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:08,641 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:48:08,641 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:48:08,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 11:48:08,642 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:48:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:48:08,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1633184395, now seen corresponding path program 7 times [2022-01-19 11:48:08,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:48:08,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904726036] [2022-01-19 11:48:08,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:48:08,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:48:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:48:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:48:09,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:48:09,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904726036] [2022-01-19 11:48:09,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904726036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:48:09,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:48:09,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:48:09,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167956009] [2022-01-19 11:48:09,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:48:09,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:48:09,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:48:09,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:48:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:48:09,119 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:48:09,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 691 transitions, 8480 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:09,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:48:09,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:48:09,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:48:18,518 INFO L129 PetriNetUnfolder]: 5344/13898 cut-off events. [2022-01-19 11:48:18,518 INFO L130 PetriNetUnfolder]: For 219532/219548 co-relation queries the response was YES. [2022-01-19 11:48:18,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70045 conditions, 13898 events. 5344/13898 cut-off events. For 219532/219548 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 123204 event pairs, 1829 based on Foata normal form. 30/13370 useless extension candidates. Maximal degree in co-relation 69856. Up to 5523 conditions per place. [2022-01-19 11:48:18,744 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 748 selfloop transitions, 302 changer transitions 20/1141 dead transitions. [2022-01-19 11:48:18,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 1141 transitions, 16235 flow [2022-01-19 11:48:18,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-19 11:48:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-01-19 11:48:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 4435 transitions. [2022-01-19 11:48:18,748 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5398003894839338 [2022-01-19 11:48:18,748 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 4435 transitions. [2022-01-19 11:48:18,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 4435 transitions. [2022-01-19 11:48:18,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:48:18,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 4435 transitions. [2022-01-19 11:48:18,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 85.28846153846153) internal successors, (4435), 52 states have internal predecessors, (4435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:18,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 158.0) internal successors, (8374), 53 states have internal predecessors, (8374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:18,759 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 158.0) internal successors, (8374), 53 states have internal predecessors, (8374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:18,759 INFO L186 Difference]: Start difference. First operand has 543 places, 691 transitions, 8480 flow. Second operand 52 states and 4435 transitions. [2022-01-19 11:48:18,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 1141 transitions, 16235 flow [2022-01-19 11:48:19,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 1141 transitions, 15545 flow, removed 290 selfloop flow, removed 9 redundant places. [2022-01-19 11:48:19,512 INFO L242 Difference]: Finished difference. Result has 616 places, 782 transitions, 10516 flow [2022-01-19 11:48:19,513 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=7817, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=10516, PETRI_PLACES=616, PETRI_TRANSITIONS=782} [2022-01-19 11:48:19,513 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 474 predicate places. [2022-01-19 11:48:19,513 INFO L470 AbstractCegarLoop]: Abstraction has has 616 places, 782 transitions, 10516 flow [2022-01-19 11:48:19,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:19,514 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:48:19,514 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:48:19,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 11:48:19,514 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:48:19,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:48:19,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1827845697, now seen corresponding path program 8 times [2022-01-19 11:48:19,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:48:19,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896361706] [2022-01-19 11:48:19,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:48:19,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:48:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:48:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:48:20,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:48:20,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896361706] [2022-01-19 11:48:20,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896361706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:48:20,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:48:20,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:48:20,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590190040] [2022-01-19 11:48:20,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:48:20,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:48:20,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:48:20,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:48:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:48:20,057 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:48:20,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 782 transitions, 10516 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:20,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:48:20,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:48:20,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:48:28,106 INFO L129 PetriNetUnfolder]: 5731/15210 cut-off events. [2022-01-19 11:48:28,106 INFO L130 PetriNetUnfolder]: For 292360/292393 co-relation queries the response was YES. [2022-01-19 11:48:28,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80087 conditions, 15210 events. 5731/15210 cut-off events. For 292360/292393 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 139529 event pairs, 1661 based on Foata normal form. 35/14640 useless extension candidates. Maximal degree in co-relation 79867. Up to 6107 conditions per place. [2022-01-19 11:48:28,461 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 849 selfloop transitions, 307 changer transitions 4/1231 dead transitions. [2022-01-19 11:48:28,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 1231 transitions, 18663 flow [2022-01-19 11:48:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 11:48:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 11:48:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3144 transitions. [2022-01-19 11:48:28,465 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5378036264112214 [2022-01-19 11:48:28,465 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3144 transitions. [2022-01-19 11:48:28,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3144 transitions. [2022-01-19 11:48:28,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:48:28,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3144 transitions. [2022-01-19 11:48:28,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 84.97297297297297) internal successors, (3144), 37 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:28,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:28,473 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:28,473 INFO L186 Difference]: Start difference. First operand has 616 places, 782 transitions, 10516 flow. Second operand 37 states and 3144 transitions. [2022-01-19 11:48:28,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 1231 transitions, 18663 flow [2022-01-19 11:48:29,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 1231 transitions, 17692 flow, removed 313 selfloop flow, removed 13 redundant places. [2022-01-19 11:48:29,832 INFO L242 Difference]: Finished difference. Result has 666 places, 859 transitions, 12491 flow [2022-01-19 11:48:29,833 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=9721, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=12491, PETRI_PLACES=666, PETRI_TRANSITIONS=859} [2022-01-19 11:48:29,834 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 524 predicate places. [2022-01-19 11:48:29,834 INFO L470 AbstractCegarLoop]: Abstraction has has 666 places, 859 transitions, 12491 flow [2022-01-19 11:48:29,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:29,834 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:48:29,834 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:48:29,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 11:48:29,834 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:48:29,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:48:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash 109563799, now seen corresponding path program 9 times [2022-01-19 11:48:29,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:48:29,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370276579] [2022-01-19 11:48:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:48:29,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:48:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:48:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:48:30,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:48:30,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370276579] [2022-01-19 11:48:30,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370276579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:48:30,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:48:30,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:48:30,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209171962] [2022-01-19 11:48:30,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:48:30,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:48:30,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:48:30,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:48:30,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:48:30,309 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:48:30,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 859 transitions, 12491 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:30,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:48:30,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:48:30,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:48:41,054 INFO L129 PetriNetUnfolder]: 6663/17422 cut-off events. [2022-01-19 11:48:41,054 INFO L130 PetriNetUnfolder]: For 432985/433005 co-relation queries the response was YES. [2022-01-19 11:48:41,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100780 conditions, 17422 events. 6663/17422 cut-off events. For 432985/433005 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 163734 event pairs, 1971 based on Foata normal form. 28/16739 useless extension candidates. Maximal degree in co-relation 100533. Up to 7501 conditions per place. [2022-01-19 11:48:41,498 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 947 selfloop transitions, 256 changer transitions 6/1280 dead transitions. [2022-01-19 11:48:41,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 1280 transitions, 21435 flow [2022-01-19 11:48:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 11:48:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 11:48:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3678 transitions. [2022-01-19 11:48:41,502 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5413600235501913 [2022-01-19 11:48:41,502 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3678 transitions. [2022-01-19 11:48:41,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3678 transitions. [2022-01-19 11:48:41,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:48:41,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3678 transitions. [2022-01-19 11:48:41,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 85.53488372093024) internal successors, (3678), 43 states have internal predecessors, (3678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:41,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:41,511 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:41,511 INFO L186 Difference]: Start difference. First operand has 666 places, 859 transitions, 12491 flow. Second operand 43 states and 3678 transitions. [2022-01-19 11:48:41,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 1280 transitions, 21435 flow [2022-01-19 11:48:43,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 1280 transitions, 19461 flow, removed 919 selfloop flow, removed 8 redundant places. [2022-01-19 11:48:43,734 INFO L242 Difference]: Finished difference. Result has 733 places, 962 transitions, 14912 flow [2022-01-19 11:48:43,735 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=11747, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=14912, PETRI_PLACES=733, PETRI_TRANSITIONS=962} [2022-01-19 11:48:43,735 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 591 predicate places. [2022-01-19 11:48:43,735 INFO L470 AbstractCegarLoop]: Abstraction has has 733 places, 962 transitions, 14912 flow [2022-01-19 11:48:43,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:43,736 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:48:43,736 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:48:43,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 11:48:43,736 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:48:43,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:48:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash -680050159, now seen corresponding path program 10 times [2022-01-19 11:48:43,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:48:43,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359014196] [2022-01-19 11:48:43,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:48:43,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:48:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:48:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:48:44,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:48:44,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359014196] [2022-01-19 11:48:44,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359014196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:48:44,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:48:44,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:48:44,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085812878] [2022-01-19 11:48:44,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:48:44,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:48:44,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:48:44,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:48:44,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:48:44,245 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:48:44,246 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 962 transitions, 14912 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:44,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:48:44,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:48:44,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:48:56,768 INFO L129 PetriNetUnfolder]: 7029/18191 cut-off events. [2022-01-19 11:48:56,769 INFO L130 PetriNetUnfolder]: For 446209/446253 co-relation queries the response was YES. [2022-01-19 11:48:57,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107446 conditions, 18191 events. 7029/18191 cut-off events. For 446209/446253 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 172617 event pairs, 1406 based on Foata normal form. 42/17549 useless extension candidates. Maximal degree in co-relation 107166. Up to 5206 conditions per place. [2022-01-19 11:48:57,309 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1000 selfloop transitions, 580 changer transitions 19/1670 dead transitions. [2022-01-19 11:48:57,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 1670 transitions, 28105 flow [2022-01-19 11:48:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-19 11:48:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2022-01-19 11:48:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 4572 transitions. [2022-01-19 11:48:57,314 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5358649789029536 [2022-01-19 11:48:57,314 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 4572 transitions. [2022-01-19 11:48:57,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 4572 transitions. [2022-01-19 11:48:57,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:48:57,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 4572 transitions. [2022-01-19 11:48:57,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 84.66666666666667) internal successors, (4572), 54 states have internal predecessors, (4572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:57,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 158.0) internal successors, (8690), 55 states have internal predecessors, (8690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:57,324 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 158.0) internal successors, (8690), 55 states have internal predecessors, (8690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:57,324 INFO L186 Difference]: Start difference. First operand has 733 places, 962 transitions, 14912 flow. Second operand 54 states and 4572 transitions. [2022-01-19 11:48:57,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 1670 transitions, 28105 flow [2022-01-19 11:48:59,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 778 places, 1670 transitions, 26905 flow, removed 549 selfloop flow, removed 8 redundant places. [2022-01-19 11:48:59,681 INFO L242 Difference]: Finished difference. Result has 809 places, 1064 transitions, 18097 flow [2022-01-19 11:48:59,682 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=13897, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=481, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=18097, PETRI_PLACES=809, PETRI_TRANSITIONS=1064} [2022-01-19 11:48:59,682 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 667 predicate places. [2022-01-19 11:48:59,682 INFO L470 AbstractCegarLoop]: Abstraction has has 809 places, 1064 transitions, 18097 flow [2022-01-19 11:48:59,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:48:59,683 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:48:59,683 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:48:59,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 11:48:59,683 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:48:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:48:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1742405489, now seen corresponding path program 11 times [2022-01-19 11:48:59,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:48:59,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014781902] [2022-01-19 11:48:59,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:48:59,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:48:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:49:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:49:00,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:49:00,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014781902] [2022-01-19 11:49:00,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014781902] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:49:00,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:49:00,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:49:00,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859787725] [2022-01-19 11:49:00,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:49:00,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:49:00,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:49:00,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:49:00,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:49:00,206 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:49:00,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 809 places, 1064 transitions, 18097 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:49:00,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:49:00,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:49:00,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:49:13,606 INFO L129 PetriNetUnfolder]: 8010/20991 cut-off events. [2022-01-19 11:49:13,606 INFO L130 PetriNetUnfolder]: For 622280/622314 co-relation queries the response was YES. [2022-01-19 11:49:14,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129937 conditions, 20991 events. 8010/20991 cut-off events. For 622280/622314 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 204553 event pairs, 2572 based on Foata normal form. 33/20197 useless extension candidates. Maximal degree in co-relation 129626. Up to 8759 conditions per place. [2022-01-19 11:49:14,319 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1140 selfloop transitions, 419 changer transitions 4/1634 dead transitions. [2022-01-19 11:49:14,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 846 places, 1634 transitions, 30399 flow [2022-01-19 11:49:14,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-19 11:49:14,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-01-19 11:49:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3248 transitions. [2022-01-19 11:49:14,322 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5409726848767489 [2022-01-19 11:49:14,322 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3248 transitions. [2022-01-19 11:49:14,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3248 transitions. [2022-01-19 11:49:14,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:49:14,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3248 transitions. [2022-01-19 11:49:14,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 85.47368421052632) internal successors, (3248), 38 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:49:14,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 158.0) internal successors, (6162), 39 states have internal predecessors, (6162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:49:14,329 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 158.0) internal successors, (6162), 39 states have internal predecessors, (6162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:49:14,329 INFO L186 Difference]: Start difference. First operand has 809 places, 1064 transitions, 18097 flow. Second operand 38 states and 3248 transitions. [2022-01-19 11:49:14,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 846 places, 1634 transitions, 30399 flow [2022-01-19 11:49:18,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 831 places, 1634 transitions, 28060 flow, removed 663 selfloop flow, removed 15 redundant places. [2022-01-19 11:49:18,381 INFO L242 Difference]: Finished difference. Result has 854 places, 1206 transitions, 21541 flow [2022-01-19 11:49:18,383 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=16660, PETRI_DIFFERENCE_MINUEND_PLACES=794, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1064, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=21541, PETRI_PLACES=854, PETRI_TRANSITIONS=1206} [2022-01-19 11:49:18,383 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 712 predicate places. [2022-01-19 11:49:18,383 INFO L470 AbstractCegarLoop]: Abstraction has has 854 places, 1206 transitions, 21541 flow [2022-01-19 11:49:18,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:49:18,383 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:49:18,384 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:49:18,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 11:49:18,384 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:49:18,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:49:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash -410028145, now seen corresponding path program 12 times [2022-01-19 11:49:18,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:49:18,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711799411] [2022-01-19 11:49:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:49:18,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:49:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:49:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:49:18,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:49:18,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711799411] [2022-01-19 11:49:18,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711799411] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:49:18,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:49:18,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:49:18,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598943547] [2022-01-19 11:49:18,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:49:18,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:49:18,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:49:18,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:49:18,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:49:18,902 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:49:18,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 854 places, 1206 transitions, 21541 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:49:18,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:49:18,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:49:18,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:49:34,918 INFO L129 PetriNetUnfolder]: 9263/24071 cut-off events. [2022-01-19 11:49:34,918 INFO L130 PetriNetUnfolder]: For 858735/858808 co-relation queries the response was YES. [2022-01-19 11:49:36,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159313 conditions, 24071 events. 9263/24071 cut-off events. For 858735/858808 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 238553 event pairs, 2939 based on Foata normal form. 57/23195 useless extension candidates. Maximal degree in co-relation 158982. Up to 10180 conditions per place. [2022-01-19 11:49:36,134 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1246 selfloop transitions, 426 changer transitions 15/1758 dead transitions. [2022-01-19 11:49:36,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 900 places, 1758 transitions, 36274 flow [2022-01-19 11:49:36,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-19 11:49:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-01-19 11:49:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3993 transitions. [2022-01-19 11:49:36,137 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5377053595475357 [2022-01-19 11:49:36,137 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3993 transitions. [2022-01-19 11:49:36,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3993 transitions. [2022-01-19 11:49:36,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:49:36,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3993 transitions. [2022-01-19 11:49:36,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 84.95744680851064) internal successors, (3993), 47 states have internal predecessors, (3993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:49:36,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 158.0) internal successors, (7584), 48 states have internal predecessors, (7584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:49:36,145 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 158.0) internal successors, (7584), 48 states have internal predecessors, (7584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:49:36,145 INFO L186 Difference]: Start difference. First operand has 854 places, 1206 transitions, 21541 flow. Second operand 47 states and 3993 transitions. [2022-01-19 11:49:36,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 900 places, 1758 transitions, 36274 flow [2022-01-19 11:49:41,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 887 places, 1758 transitions, 33946 flow, removed 972 selfloop flow, removed 13 redundant places. [2022-01-19 11:49:41,591 INFO L242 Difference]: Finished difference. Result has 920 places, 1404 transitions, 27750 flow [2022-01-19 11:49:41,593 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=20540, PETRI_DIFFERENCE_MINUEND_PLACES=841, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=876, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=27750, PETRI_PLACES=920, PETRI_TRANSITIONS=1404} [2022-01-19 11:49:41,593 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 778 predicate places. [2022-01-19 11:49:41,593 INFO L470 AbstractCegarLoop]: Abstraction has has 920 places, 1404 transitions, 27750 flow [2022-01-19 11:49:41,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:49:41,594 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:49:41,594 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:49:41,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 11:49:41,594 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:49:41,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:49:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash -982693187, now seen corresponding path program 13 times [2022-01-19 11:49:41,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:49:41,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545925822] [2022-01-19 11:49:41,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:49:41,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:49:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:49:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:49:42,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:49:42,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545925822] [2022-01-19 11:49:42,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545925822] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:49:42,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:49:42,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:49:42,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097536496] [2022-01-19 11:49:42,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:49:42,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:49:42,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:49:42,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:49:42,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:49:42,131 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:49:42,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 920 places, 1404 transitions, 27750 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:49:42,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:49:42,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:49:42,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:50:00,446 INFO L129 PetriNetUnfolder]: 10305/26728 cut-off events. [2022-01-19 11:50:00,447 INFO L130 PetriNetUnfolder]: For 977480/977564 co-relation queries the response was YES. [2022-01-19 11:50:01,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 181324 conditions, 26728 events. 10305/26728 cut-off events. For 977480/977564 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 269422 event pairs, 2725 based on Foata normal form. 56/25740 useless extension candidates. Maximal degree in co-relation 180960. Up to 10101 conditions per place. [2022-01-19 11:50:01,905 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1305 selfloop transitions, 590 changer transitions 4/1970 dead transitions. [2022-01-19 11:50:01,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 1970 transitions, 41859 flow [2022-01-19 11:50:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 11:50:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 11:50:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3654 transitions. [2022-01-19 11:50:01,909 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5378274948483956 [2022-01-19 11:50:01,909 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3654 transitions. [2022-01-19 11:50:01,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3654 transitions. [2022-01-19 11:50:01,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:50:01,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3654 transitions. [2022-01-19 11:50:01,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 84.97674418604652) internal successors, (3654), 43 states have internal predecessors, (3654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:50:01,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:50:01,918 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:50:01,918 INFO L186 Difference]: Start difference. First operand has 920 places, 1404 transitions, 27750 flow. Second operand 43 states and 3654 transitions. [2022-01-19 11:50:01,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 1970 transitions, 41859 flow [2022-01-19 11:50:09,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 953 places, 1970 transitions, 40723 flow, removed 478 selfloop flow, removed 9 redundant places. [2022-01-19 11:50:09,060 INFO L242 Difference]: Finished difference. Result has 983 places, 1561 transitions, 33598 flow [2022-01-19 11:50:09,061 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=26620, PETRI_DIFFERENCE_MINUEND_PLACES=911, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=453, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=33598, PETRI_PLACES=983, PETRI_TRANSITIONS=1561} [2022-01-19 11:50:09,062 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 841 predicate places. [2022-01-19 11:50:09,062 INFO L470 AbstractCegarLoop]: Abstraction has has 983 places, 1561 transitions, 33598 flow [2022-01-19 11:50:09,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:50:09,062 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:50:09,062 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:50:09,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 11:50:09,062 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:50:09,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:50:09,063 INFO L85 PathProgramCache]: Analyzing trace with hash -737988387, now seen corresponding path program 14 times [2022-01-19 11:50:09,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:50:09,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638388825] [2022-01-19 11:50:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:50:09,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:50:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:50:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:50:09,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:50:09,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638388825] [2022-01-19 11:50:09,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638388825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:50:09,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:50:09,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-19 11:50:09,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874371824] [2022-01-19 11:50:09,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:50:09,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 11:50:09,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:50:09,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 11:50:09,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2022-01-19 11:50:09,501 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 158 [2022-01-19 11:50:09,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 1561 transitions, 33598 flow. Second operand has 25 states, 25 states have (on average 81.08) internal successors, (2027), 25 states have internal predecessors, (2027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:50:09,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:50:09,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 158 [2022-01-19 11:50:09,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:50:28,092 INFO L129 PetriNetUnfolder]: 8905/25562 cut-off events. [2022-01-19 11:50:28,093 INFO L130 PetriNetUnfolder]: For 1156805/1157515 co-relation queries the response was YES. [2022-01-19 11:50:30,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183235 conditions, 25562 events. 8905/25562 cut-off events. For 1156805/1157515 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 273876 event pairs, 2445 based on Foata normal form. 273/24895 useless extension candidates. Maximal degree in co-relation 182841. Up to 8658 conditions per place. [2022-01-19 11:50:30,669 INFO L132 encePairwiseOnDemand]: 129/158 looper letters, 1159 selfloop transitions, 708 changer transitions 14/2010 dead transitions. [2022-01-19 11:50:30,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 2010 transitions, 46940 flow [2022-01-19 11:50:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-19 11:50:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-01-19 11:50:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3190 transitions. [2022-01-19 11:50:30,672 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5608298171589311 [2022-01-19 11:50:30,672 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3190 transitions. [2022-01-19 11:50:30,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3190 transitions. [2022-01-19 11:50:30,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:50:30,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3190 transitions. [2022-01-19 11:50:30,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 88.61111111111111) internal successors, (3190), 36 states have internal predecessors, (3190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:50:30,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 158.0) internal successors, (5846), 37 states have internal predecessors, (5846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:50:30,679 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 158.0) internal successors, (5846), 37 states have internal predecessors, (5846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:50:30,679 INFO L186 Difference]: Start difference. First operand has 983 places, 1561 transitions, 33598 flow. Second operand 36 states and 3190 transitions. [2022-01-19 11:50:30,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 2010 transitions, 46940 flow [2022-01-19 11:50:38,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1008 places, 2010 transitions, 45409 flow, removed 649 selfloop flow, removed 10 redundant places. [2022-01-19 11:50:38,921 INFO L242 Difference]: Finished difference. Result has 1032 places, 1764 transitions, 40613 flow [2022-01-19 11:50:38,922 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=32262, PETRI_DIFFERENCE_MINUEND_PLACES=973, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=520, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=40613, PETRI_PLACES=1032, PETRI_TRANSITIONS=1764} [2022-01-19 11:50:38,923 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 890 predicate places. [2022-01-19 11:50:38,923 INFO L470 AbstractCegarLoop]: Abstraction has has 1032 places, 1764 transitions, 40613 flow [2022-01-19 11:50:38,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 81.08) internal successors, (2027), 25 states have internal predecessors, (2027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:50:38,923 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:50:38,923 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:50:38,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 11:50:38,923 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:50:38,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:50:38,924 INFO L85 PathProgramCache]: Analyzing trace with hash 929706661, now seen corresponding path program 15 times [2022-01-19 11:50:38,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:50:38,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255082731] [2022-01-19 11:50:38,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:50:38,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:50:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:50:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:50:39,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:50:39,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255082731] [2022-01-19 11:50:39,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255082731] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:50:39,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:50:39,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:50:39,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359754660] [2022-01-19 11:50:39,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:50:39,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:50:39,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:50:39,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:50:39,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:50:39,430 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:50:39,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 1764 transitions, 40613 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:50:39,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:50:39,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:50:39,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:51:05,252 INFO L129 PetriNetUnfolder]: 12061/30819 cut-off events. [2022-01-19 11:51:05,252 INFO L130 PetriNetUnfolder]: For 1574618/1574772 co-relation queries the response was YES. [2022-01-19 11:51:07,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237654 conditions, 30819 events. 12061/30819 cut-off events. For 1574618/1574772 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 317254 event pairs, 4082 based on Foata normal form. 124/29705 useless extension candidates. Maximal degree in co-relation 237236. Up to 14383 conditions per place. [2022-01-19 11:51:07,291 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1666 selfloop transitions, 419 changer transitions 6/2162 dead transitions. [2022-01-19 11:51:07,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1074 places, 2162 transitions, 51490 flow [2022-01-19 11:51:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 11:51:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 11:51:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3682 transitions. [2022-01-19 11:51:07,294 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5419487783338239 [2022-01-19 11:51:07,294 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3682 transitions. [2022-01-19 11:51:07,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3682 transitions. [2022-01-19 11:51:07,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:51:07,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3682 transitions. [2022-01-19 11:51:07,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 85.62790697674419) internal successors, (3682), 43 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:51:07,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:51:07,302 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:51:07,302 INFO L186 Difference]: Start difference. First operand has 1032 places, 1764 transitions, 40613 flow. Second operand 43 states and 3682 transitions. [2022-01-19 11:51:07,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1074 places, 2162 transitions, 51490 flow [2022-01-19 11:51:18,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1063 places, 2162 transitions, 50210 flow, removed 539 selfloop flow, removed 11 redundant places. [2022-01-19 11:51:18,823 INFO L242 Difference]: Finished difference. Result has 1097 places, 1860 transitions, 43624 flow [2022-01-19 11:51:18,825 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=39357, PETRI_DIFFERENCE_MINUEND_PLACES=1021, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=329, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=43624, PETRI_PLACES=1097, PETRI_TRANSITIONS=1860} [2022-01-19 11:51:18,825 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 955 predicate places. [2022-01-19 11:51:18,825 INFO L470 AbstractCegarLoop]: Abstraction has has 1097 places, 1860 transitions, 43624 flow [2022-01-19 11:51:18,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:51:18,825 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:51:18,825 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:51:18,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 11:51:18,826 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:51:18,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:51:18,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1429447959, now seen corresponding path program 16 times [2022-01-19 11:51:18,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:51:18,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585868868] [2022-01-19 11:51:18,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:51:18,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:51:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:51:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:51:19,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:51:19,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585868868] [2022-01-19 11:51:19,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585868868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:51:19,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:51:19,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:51:19,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807331797] [2022-01-19 11:51:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:51:19,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:51:19,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:51:19,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:51:19,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:51:19,274 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:51:19,275 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1097 places, 1860 transitions, 43624 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:51:19,275 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:51:19,275 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:51:19,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:51:53,823 INFO L129 PetriNetUnfolder]: 15552/39520 cut-off events. [2022-01-19 11:51:53,824 INFO L130 PetriNetUnfolder]: For 2348333/2348526 co-relation queries the response was YES. [2022-01-19 11:51:58,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 331612 conditions, 39520 events. 15552/39520 cut-off events. For 2348333/2348526 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 417037 event pairs, 4680 based on Foata normal form. 155/38105 useless extension candidates. Maximal degree in co-relation 331160. Up to 15461 conditions per place. [2022-01-19 11:51:58,522 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1875 selfloop transitions, 941 changer transitions 6/2893 dead transitions. [2022-01-19 11:51:58,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1141 places, 2893 transitions, 78638 flow [2022-01-19 11:51:58,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-19 11:51:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-01-19 11:51:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3824 transitions. [2022-01-19 11:51:58,526 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5378340365682138 [2022-01-19 11:51:58,526 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 3824 transitions. [2022-01-19 11:51:58,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 3824 transitions. [2022-01-19 11:51:58,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:51:58,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 3824 transitions. [2022-01-19 11:51:58,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 84.97777777777777) internal successors, (3824), 45 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:51:58,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 158.0) internal successors, (7268), 46 states have internal predecessors, (7268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:51:58,534 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 158.0) internal successors, (7268), 46 states have internal predecessors, (7268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:51:58,534 INFO L186 Difference]: Start difference. First operand has 1097 places, 1860 transitions, 43624 flow. Second operand 45 states and 3824 transitions. [2022-01-19 11:51:58,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1141 places, 2893 transitions, 78638 flow [2022-01-19 11:52:20,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1134 places, 2893 transitions, 77029 flow, removed 774 selfloop flow, removed 7 redundant places. [2022-01-19 11:52:20,287 INFO L242 Difference]: Finished difference. Result has 1167 places, 2418 transitions, 67225 flow [2022-01-19 11:52:20,289 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=42015, PETRI_DIFFERENCE_MINUEND_PLACES=1090, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=414, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=67225, PETRI_PLACES=1167, PETRI_TRANSITIONS=2418} [2022-01-19 11:52:20,289 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 1025 predicate places. [2022-01-19 11:52:20,289 INFO L470 AbstractCegarLoop]: Abstraction has has 1167 places, 2418 transitions, 67225 flow [2022-01-19 11:52:20,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:52:20,290 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:52:20,290 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:52:20,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 11:52:20,290 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:52:20,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:52:20,290 INFO L85 PathProgramCache]: Analyzing trace with hash -622515957, now seen corresponding path program 17 times [2022-01-19 11:52:20,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:52:20,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166159173] [2022-01-19 11:52:20,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:52:20,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:52:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:52:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:52:20,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:52:20,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166159173] [2022-01-19 11:52:20,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166159173] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:52:20,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:52:20,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:52:20,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861157197] [2022-01-19 11:52:20,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:52:20,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:52:20,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:52:20,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:52:20,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:52:20,757 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:52:20,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1167 places, 2418 transitions, 67225 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:52:20,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:52:20,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:52:20,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:53:16,918 INFO L129 PetriNetUnfolder]: 21875/54810 cut-off events. [2022-01-19 11:53:16,918 INFO L130 PetriNetUnfolder]: For 3853740/3854002 co-relation queries the response was YES. [2022-01-19 11:53:23,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 509659 conditions, 54810 events. 21875/54810 cut-off events. For 3853740/3854002 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 593290 event pairs, 5727 based on Foata normal form. 196/52835 useless extension candidates. Maximal degree in co-relation 509174. Up to 19812 conditions per place. [2022-01-19 11:53:24,026 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 2325 selfloop transitions, 1522 changer transitions 5/3923 dead transitions. [2022-01-19 11:53:24,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1209 places, 3923 transitions, 126616 flow [2022-01-19 11:53:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 11:53:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 11:53:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3675 transitions. [2022-01-19 11:53:24,029 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5409184574624669 [2022-01-19 11:53:24,029 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3675 transitions. [2022-01-19 11:53:24,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3675 transitions. [2022-01-19 11:53:24,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:53:24,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3675 transitions. [2022-01-19 11:53:24,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 85.46511627906976) internal successors, (3675), 43 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:53:24,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:53:24,036 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:53:24,036 INFO L186 Difference]: Start difference. First operand has 1167 places, 2418 transitions, 67225 flow. Second operand 43 states and 3675 transitions. [2022-01-19 11:53:24,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1209 places, 3923 transitions, 126616 flow [2022-01-19 11:54:21,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1199 places, 3923 transitions, 122314 flow, removed 2023 selfloop flow, removed 10 redundant places. [2022-01-19 11:54:21,420 INFO L242 Difference]: Finished difference. Result has 1230 places, 3377 transitions, 111124 flow [2022-01-19 11:54:21,422 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=65184, PETRI_DIFFERENCE_MINUEND_PLACES=1157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=580, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=111124, PETRI_PLACES=1230, PETRI_TRANSITIONS=3377} [2022-01-19 11:54:21,423 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 1088 predicate places. [2022-01-19 11:54:21,423 INFO L470 AbstractCegarLoop]: Abstraction has has 1230 places, 3377 transitions, 111124 flow [2022-01-19 11:54:21,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:54:21,423 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:54:21,423 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:54:21,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 11:54:21,423 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 11:54:21,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:54:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1600645409, now seen corresponding path program 18 times [2022-01-19 11:54:21,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:54:21,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27990119] [2022-01-19 11:54:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:54:21,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:54:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:54:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:54:21,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:54:21,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27990119] [2022-01-19 11:54:21,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27990119] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:54:21,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:54:21,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 11:54:21,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591737683] [2022-01-19 11:54:21,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:54:21,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 11:54:21,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:54:21,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 11:54:21,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-01-19 11:54:21,908 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 11:54:21,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1230 places, 3377 transitions, 111124 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:54:21,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:54:21,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 11:54:21,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand