/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-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:06:53,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:06:53,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:06:53,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:06:53,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:06:53,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:06:53,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:06:53,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:06:53,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:06:53,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:06:53,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:06:53,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:06:53,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:06:53,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:06:53,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:06:53,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:06:53,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:06:53,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:06:53,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:06:53,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:06:53,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:06:53,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:06:53,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:06:53,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:06:53,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:06:53,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:06:53,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:06:53,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:06:53,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:06:53,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:06:53,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:06:53,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:06:53,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:06:53,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:06:53,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:06:53,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:06:53,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:06:53,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:06:53,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:06:53,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:06:53,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:06:53,702 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-Before.epf [2022-01-19 04:06:53,718 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:06:53,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:06:53,721 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:06:53,721 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:06:53,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:06:53,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:06:53,721 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:06:53,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:06:53,722 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:06:53,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:06:53,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:06:53,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:06:53,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:06:53,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:06:53,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:06:53,723 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:06:53,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:06:53,723 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:06:53,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:06:53,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:06:53,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:06:53,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:06:53,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:06:53,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:06:53,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:06:53,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:06:53,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:06:53,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:06:53,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:06:53,725 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:06:53,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:06:53,725 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:06:53,725 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 04:06:53,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:06:53,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:06:53,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:06:53,907 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:06:53,908 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:06:53,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2022-01-19 04:06:53,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324188505/f4cca74bc4f24102b5970480960f5dea/FLAGf58e28f59 [2022-01-19 04:06:54,324 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:06:54,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2022-01-19 04:06:54,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324188505/f4cca74bc4f24102b5970480960f5dea/FLAGf58e28f59 [2022-01-19 04:06:54,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324188505/f4cca74bc4f24102b5970480960f5dea [2022-01-19 04:06:54,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:06:54,737 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:06:54,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:06:54,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:06:54,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:06:54,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:06:54" (1/1) ... [2022-01-19 04:06:54,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382ae61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:54, skipping insertion in model container [2022-01-19 04:06:54,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:06:54" (1/1) ... [2022-01-19 04:06:54,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:06:54,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:06:54,891 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-19 04:06:54,962 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-atomic/read_write_lock-1.i[31246,31259] [2022-01-19 04:06:54,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:06:54,973 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:06:54,983 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-19 04:06:54,999 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-atomic/read_write_lock-1.i[31246,31259] [2022-01-19 04:06:55,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:06:55,031 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:06:55,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:55 WrapperNode [2022-01-19 04:06:55,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:06:55,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:06:55,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:06:55,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:06:55,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:55" (1/1) ... [2022-01-19 04:06:55,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:55" (1/1) ... [2022-01-19 04:06:55,060 INFO L137 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2022-01-19 04:06:55,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:06:55,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:06:55,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:06:55,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:06:55,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:55" (1/1) ... [2022-01-19 04:06:55,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:55" (1/1) ... [2022-01-19 04:06:55,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:55" (1/1) ... [2022-01-19 04:06:55,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:55" (1/1) ... [2022-01-19 04:06:55,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:55" (1/1) ... [2022-01-19 04:06:55,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:55" (1/1) ... [2022-01-19 04:06:55,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:55" (1/1) ... [2022-01-19 04:06:55,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:06:55,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:06:55,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:06:55,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:06:55,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:55" (1/1) ... [2022-01-19 04:06:55,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:06:55,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:06:55,107 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 04:06:55,112 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 04:06:55,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 04:06:55,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:06:55,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:06:55,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:06:55,133 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-01-19 04:06:55,134 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-01-19 04:06:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:06:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:06:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:06:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:06:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:06:55,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:06:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-01-19 04:06:55,136 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-01-19 04:06:55,137 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 04:06:55,219 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:06:55,220 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:06:55,348 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:06:55,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:06:55,370 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:06:55,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:06:55 BoogieIcfgContainer [2022-01-19 04:06:55,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:06:55,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:06:55,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:06:55,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:06:55,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:06:54" (1/3) ... [2022-01-19 04:06:55,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d37d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:06:55, skipping insertion in model container [2022-01-19 04:06:55,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:06:55" (2/3) ... [2022-01-19 04:06:55,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d37d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:06:55, skipping insertion in model container [2022-01-19 04:06:55,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:06:55" (3/3) ... [2022-01-19 04:06:55,376 INFO L111 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2022-01-19 04:06:55,380 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:06:55,380 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 04:06:55,380 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:06:55,411 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,412 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,412 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,412 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,412 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,412 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,412 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,412 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,413 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,413 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,413 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,413 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,413 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,413 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,414 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,414 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,414 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,414 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,414 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,414 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,414 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,415 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,415 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,415 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,415 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,415 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,415 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,415 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,415 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,416 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,416 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,416 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,416 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,416 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,416 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,417 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,417 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,417 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,417 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,417 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,417 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,417 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,417 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,417 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,418 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,418 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,418 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,418 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,418 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,418 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,419 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,419 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,419 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,419 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,419 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,419 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,419 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,419 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,420 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,420 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,420 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,420 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,420 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,420 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,420 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,421 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,421 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,421 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,421 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,421 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,421 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,421 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,422 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,422 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,422 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,422 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,422 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,422 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,422 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,422 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,423 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,423 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,423 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,423 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,423 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,424 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,424 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,424 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,424 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,424 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,424 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,424 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,424 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,424 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,425 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,425 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,425 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,425 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,425 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,425 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,427 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,428 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,428 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,428 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,428 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,428 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,428 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,428 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,428 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,429 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,429 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,429 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,429 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,430 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,430 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,430 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,430 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,430 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,430 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,431 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,431 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,431 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,431 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,431 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,432 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,432 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,432 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,432 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,432 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,432 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:06:55,436 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 04:06:55,466 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:06:55,471 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 04:06:55,471 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 04:06:55,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 256 flow [2022-01-19 04:06:55,509 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2022-01-19 04:06:55,509 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 04:06:55,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 108 events. 2/108 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-01-19 04:06:55,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 256 flow [2022-01-19 04:06:55,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 94 transitions, 209 flow [2022-01-19 04:06:55,527 INFO L129 PetriNetUnfolder]: 1/59 cut-off events. [2022-01-19 04:06:55,527 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:06:55,527 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:55,528 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] [2022-01-19 04:06:55,528 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:06:55,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash 764683200, now seen corresponding path program 1 times [2022-01-19 04:06:55,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:55,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483291880] [2022-01-19 04:06:55,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:55,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:55,706 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 04:06:55,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:55,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483291880] [2022-01-19 04:06:55,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483291880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:06:55,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:06:55,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:06:55,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126889469] [2022-01-19 04:06:55,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:55,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:06:55,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:55,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:06:55,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:06:55,751 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-01-19 04:06:55,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 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 04:06:55,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:55,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-01-19 04:06:55,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:56,726 INFO L129 PetriNetUnfolder]: 3826/7989 cut-off events. [2022-01-19 04:06:56,726 INFO L130 PetriNetUnfolder]: For 1855/1855 co-relation queries the response was YES. [2022-01-19 04:06:56,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14639 conditions, 7989 events. 3826/7989 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 71187 event pairs, 1181 based on Foata normal form. 418/8042 useless extension candidates. Maximal degree in co-relation 13913. Up to 2013 conditions per place. [2022-01-19 04:06:56,785 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 109 selfloop transitions, 24 changer transitions 4/201 dead transitions. [2022-01-19 04:06:56,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 201 transitions, 769 flow [2022-01-19 04:06:56,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:06:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:06:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 961 transitions. [2022-01-19 04:06:56,801 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8580357142857142 [2022-01-19 04:06:56,801 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 961 transitions. [2022-01-19 04:06:56,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 961 transitions. [2022-01-19 04:06:56,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:56,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 961 transitions. [2022-01-19 04:06:56,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.1) internal successors, (961), 10 states have internal predecessors, (961), 0 states have call successors, (0), 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 04:06:56,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 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 04:06:56,820 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 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 04:06:56,821 INFO L186 Difference]: Start difference. First operand has 105 places, 94 transitions, 209 flow. Second operand 10 states and 961 transitions. [2022-01-19 04:06:56,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 201 transitions, 769 flow [2022-01-19 04:06:56,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 201 transitions, 713 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-01-19 04:06:56,836 INFO L242 Difference]: Finished difference. Result has 115 places, 117 transitions, 367 flow [2022-01-19 04:06:56,837 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=367, PETRI_PLACES=115, PETRI_TRANSITIONS=117} [2022-01-19 04:06:56,840 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 10 predicate places. [2022-01-19 04:06:56,840 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 367 flow [2022-01-19 04:06:56,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 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 04:06:56,841 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:56,841 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] [2022-01-19 04:06:56,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:06:56,842 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:06:56,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:56,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1416784543, now seen corresponding path program 1 times [2022-01-19 04:06:56,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:56,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894659702] [2022-01-19 04:06:56,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:56,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:56,944 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 04:06:56,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:56,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894659702] [2022-01-19 04:06:56,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894659702] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:06:56,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:06:56,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 04:06:56,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728277178] [2022-01-19 04:06:56,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:56,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:06:56,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:56,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:06:56,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:06:56,948 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 112 [2022-01-19 04:06:56,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 04:06:56,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:56,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 112 [2022-01-19 04:06:56,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:57,137 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][62], [44#writerENTRYtrue, 59#L748-4true, 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, 117#L721true, 153#true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse]) [2022-01-19 04:06:57,137 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-01-19 04:06:57,137 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-01-19 04:06:57,137 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-01-19 04:06:57,137 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-01-19 04:06:57,151 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][63], [59#L748-4true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, 117#L721true, 155#(= ~w~0 1), Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, 22#L717-1true]) [2022-01-19 04:06:57,152 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-01-19 04:06:57,152 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-01-19 04:06:57,152 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-01-19 04:06:57,152 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-01-19 04:06:57,162 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][62], [59#L748-4true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, 117#L721true, 153#true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, 93#L721true]) [2022-01-19 04:06:57,163 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-01-19 04:06:57,163 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 04:06:57,163 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 04:06:57,163 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 04:06:57,185 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][62], [107#L749-2true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, 117#L721true, 153#true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse]) [2022-01-19 04:06:57,185 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-01-19 04:06:57,185 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 04:06:57,185 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 04:06:57,185 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 04:06:57,193 INFO L129 PetriNetUnfolder]: 878/2829 cut-off events. [2022-01-19 04:06:57,193 INFO L130 PetriNetUnfolder]: For 667/678 co-relation queries the response was YES. [2022-01-19 04:06:57,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5401 conditions, 2829 events. 878/2829 cut-off events. For 667/678 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 25982 event pairs, 289 based on Foata normal form. 125/2826 useless extension candidates. Maximal degree in co-relation 4779. Up to 641 conditions per place. [2022-01-19 04:06:57,212 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 19 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2022-01-19 04:06:57,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 124 transitions, 433 flow [2022-01-19 04:06:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:06:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:06:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-01-19 04:06:57,213 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107142857142857 [2022-01-19 04:06:57,213 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2022-01-19 04:06:57,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2022-01-19 04:06:57,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:57,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2022-01-19 04:06:57,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 04:06:57,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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 04:06:57,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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 04:06:57,215 INFO L186 Difference]: Start difference. First operand has 115 places, 117 transitions, 367 flow. Second operand 3 states and 306 transitions. [2022-01-19 04:06:57,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 124 transitions, 433 flow [2022-01-19 04:06:57,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 124 transitions, 433 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:06:57,224 INFO L242 Difference]: Finished difference. Result has 118 places, 117 transitions, 383 flow [2022-01-19 04:06:57,224 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=118, PETRI_TRANSITIONS=117} [2022-01-19 04:06:57,225 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 13 predicate places. [2022-01-19 04:06:57,225 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 117 transitions, 383 flow [2022-01-19 04:06:57,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 04:06:57,225 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:57,225 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] [2022-01-19 04:06:57,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:06:57,226 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:06:57,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash -211743983, now seen corresponding path program 2 times [2022-01-19 04:06:57,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:57,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176340853] [2022-01-19 04:06:57,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:57,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:57,317 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 04:06:57,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:57,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176340853] [2022-01-19 04:06:57,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176340853] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:06:57,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:06:57,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 04:06:57,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691964028] [2022-01-19 04:06:57,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:57,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 04:06:57,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:57,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 04:06:57,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 04:06:57,319 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 112 [2022-01-19 04:06:57,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 117 transitions, 383 flow. Second operand has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 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 04:06:57,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:57,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 112 [2022-01-19 04:06:57,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:57,466 INFO L129 PetriNetUnfolder]: 304/1699 cut-off events. [2022-01-19 04:06:57,466 INFO L130 PetriNetUnfolder]: For 832/877 co-relation queries the response was YES. [2022-01-19 04:06:57,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3194 conditions, 1699 events. 304/1699 cut-off events. For 832/877 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15545 event pairs, 42 based on Foata normal form. 27/1673 useless extension candidates. Maximal degree in co-relation 2866. Up to 271 conditions per place. [2022-01-19 04:06:57,478 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 23 selfloop transitions, 9 changer transitions 2/137 dead transitions. [2022-01-19 04:06:57,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 137 transitions, 517 flow [2022-01-19 04:06:57,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 04:06:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 04:06:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2022-01-19 04:06:57,480 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2022-01-19 04:06:57,480 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2022-01-19 04:06:57,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2022-01-19 04:06:57,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:57,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2022-01-19 04:06:57,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 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 04:06:57,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 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 04:06:57,482 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 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 04:06:57,482 INFO L186 Difference]: Start difference. First operand has 118 places, 117 transitions, 383 flow. Second operand 4 states and 416 transitions. [2022-01-19 04:06:57,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 137 transitions, 517 flow [2022-01-19 04:06:57,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 137 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:06:57,489 INFO L242 Difference]: Finished difference. Result has 122 places, 123 transitions, 441 flow [2022-01-19 04:06:57,490 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=441, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2022-01-19 04:06:57,491 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 17 predicate places. [2022-01-19 04:06:57,492 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 441 flow [2022-01-19 04:06:57,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 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 04:06:57,492 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:57,492 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] [2022-01-19 04:06:57,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:06:57,492 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:06:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:57,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1149119989, now seen corresponding path program 1 times [2022-01-19 04:06:57,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:57,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887314786] [2022-01-19 04:06:57,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:57,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:57,532 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 04:06:57,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:57,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887314786] [2022-01-19 04:06:57,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887314786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:06:57,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:06:57,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:06:57,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468654254] [2022-01-19 04:06:57,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:57,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:06:57,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:57,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:06:57,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:06:57,535 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-01-19 04:06:57,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 441 flow. Second operand has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 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 04:06:57,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:57,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-01-19 04:06:57,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:57,976 INFO L129 PetriNetUnfolder]: 1613/4010 cut-off events. [2022-01-19 04:06:57,978 INFO L130 PetriNetUnfolder]: For 4798/4805 co-relation queries the response was YES. [2022-01-19 04:06:57,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10835 conditions, 4010 events. 1613/4010 cut-off events. For 4798/4805 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 36924 event pairs, 401 based on Foata normal form. 0/3916 useless extension candidates. Maximal degree in co-relation 10228. Up to 724 conditions per place. [2022-01-19 04:06:58,002 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 120 selfloop transitions, 47 changer transitions 42/275 dead transitions. [2022-01-19 04:06:58,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 275 transitions, 1651 flow [2022-01-19 04:06:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:06:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:06:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 950 transitions. [2022-01-19 04:06:58,005 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8482142857142857 [2022-01-19 04:06:58,005 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 950 transitions. [2022-01-19 04:06:58,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 950 transitions. [2022-01-19 04:06:58,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:58,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 950 transitions. [2022-01-19 04:06:58,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 0 states have call successors, (0), 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 04:06:58,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 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 04:06:58,009 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 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 04:06:58,009 INFO L186 Difference]: Start difference. First operand has 122 places, 123 transitions, 441 flow. Second operand 10 states and 950 transitions. [2022-01-19 04:06:58,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 275 transitions, 1651 flow [2022-01-19 04:06:58,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 275 transitions, 1651 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:06:58,026 INFO L242 Difference]: Finished difference. Result has 139 places, 161 transitions, 862 flow [2022-01-19 04:06:58,026 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=862, PETRI_PLACES=139, PETRI_TRANSITIONS=161} [2022-01-19 04:06:58,027 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 34 predicate places. [2022-01-19 04:06:58,027 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 161 transitions, 862 flow [2022-01-19 04:06:58,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 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 04:06:58,027 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:58,028 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] [2022-01-19 04:06:58,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:06:58,028 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:06:58,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1910529791, now seen corresponding path program 1 times [2022-01-19 04:06:58,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:58,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756974067] [2022-01-19 04:06:58,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:58,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:58,088 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 04:06:58,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:58,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756974067] [2022-01-19 04:06:58,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756974067] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:06:58,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:06:58,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:06:58,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184554875] [2022-01-19 04:06:58,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:58,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:06:58,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:58,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:06:58,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:06:58,090 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-01-19 04:06:58,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 161 transitions, 862 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 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 04:06:58,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:58,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-01-19 04:06:58,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:58,573 INFO L129 PetriNetUnfolder]: 1388/3770 cut-off events. [2022-01-19 04:06:58,573 INFO L130 PetriNetUnfolder]: For 6689/6691 co-relation queries the response was YES. [2022-01-19 04:06:58,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11911 conditions, 3770 events. 1388/3770 cut-off events. For 6689/6691 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 35816 event pairs, 304 based on Foata normal form. 38/3762 useless extension candidates. Maximal degree in co-relation 11237. Up to 588 conditions per place. [2022-01-19 04:06:58,598 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 109 selfloop transitions, 55 changer transitions 10/240 dead transitions. [2022-01-19 04:06:58,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 240 transitions, 1682 flow [2022-01-19 04:06:58,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:06:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:06:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 842 transitions. [2022-01-19 04:06:58,601 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8353174603174603 [2022-01-19 04:06:58,601 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 842 transitions. [2022-01-19 04:06:58,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 842 transitions. [2022-01-19 04:06:58,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:58,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 842 transitions. [2022-01-19 04:06:58,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.55555555555556) internal successors, (842), 9 states have internal predecessors, (842), 0 states have call successors, (0), 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 04:06:58,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 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 04:06:58,605 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 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 04:06:58,605 INFO L186 Difference]: Start difference. First operand has 139 places, 161 transitions, 862 flow. Second operand 9 states and 842 transitions. [2022-01-19 04:06:58,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 240 transitions, 1682 flow [2022-01-19 04:06:58,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 240 transitions, 1662 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-01-19 04:06:58,629 INFO L242 Difference]: Finished difference. Result has 151 places, 173 transitions, 1130 flow [2022-01-19 04:06:58,630 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1130, PETRI_PLACES=151, PETRI_TRANSITIONS=173} [2022-01-19 04:06:58,631 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 46 predicate places. [2022-01-19 04:06:58,631 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 173 transitions, 1130 flow [2022-01-19 04:06:58,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 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 04:06:58,632 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:58,632 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] [2022-01-19 04:06:58,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:06:58,633 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:06:58,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:58,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1123190917, now seen corresponding path program 1 times [2022-01-19 04:06:58,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:58,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914001055] [2022-01-19 04:06:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:58,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:58,693 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 04:06:58,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:58,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914001055] [2022-01-19 04:06:58,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914001055] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:06:58,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:06:58,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:06:58,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745013133] [2022-01-19 04:06:58,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:58,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:06:58,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:58,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:06:58,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:06:58,696 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-01-19 04:06:58,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 173 transitions, 1130 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 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 04:06:58,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:58,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-01-19 04:06:58,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:59,239 INFO L129 PetriNetUnfolder]: 1489/3948 cut-off events. [2022-01-19 04:06:59,239 INFO L130 PetriNetUnfolder]: For 9082/9089 co-relation queries the response was YES. [2022-01-19 04:06:59,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13258 conditions, 3948 events. 1489/3948 cut-off events. For 9082/9089 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 37122 event pairs, 363 based on Foata normal form. 46/3930 useless extension candidates. Maximal degree in co-relation 12006. Up to 736 conditions per place. [2022-01-19 04:06:59,272 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 118 selfloop transitions, 62 changer transitions 18/267 dead transitions. [2022-01-19 04:06:59,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 267 transitions, 2104 flow [2022-01-19 04:06:59,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:06:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:06:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 853 transitions. [2022-01-19 04:06:59,275 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8462301587301587 [2022-01-19 04:06:59,275 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 853 transitions. [2022-01-19 04:06:59,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 853 transitions. [2022-01-19 04:06:59,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:59,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 853 transitions. [2022-01-19 04:06:59,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.77777777777777) internal successors, (853), 9 states have internal predecessors, (853), 0 states have call successors, (0), 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 04:06:59,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 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 04:06:59,278 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 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 04:06:59,278 INFO L186 Difference]: Start difference. First operand has 151 places, 173 transitions, 1130 flow. Second operand 9 states and 853 transitions. [2022-01-19 04:06:59,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 267 transitions, 2104 flow [2022-01-19 04:06:59,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 267 transitions, 2088 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-01-19 04:06:59,313 INFO L242 Difference]: Finished difference. Result has 164 places, 187 transitions, 1462 flow [2022-01-19 04:06:59,313 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1462, PETRI_PLACES=164, PETRI_TRANSITIONS=187} [2022-01-19 04:06:59,314 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 59 predicate places. [2022-01-19 04:06:59,314 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 187 transitions, 1462 flow [2022-01-19 04:06:59,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 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 04:06:59,314 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:59,315 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] [2022-01-19 04:06:59,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:06:59,315 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:06:59,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:59,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1738809264, now seen corresponding path program 1 times [2022-01-19 04:06:59,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:59,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028015458] [2022-01-19 04:06:59,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:59,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:59,364 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 04:06:59,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:59,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028015458] [2022-01-19 04:06:59,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028015458] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:06:59,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:06:59,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 04:06:59,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231627541] [2022-01-19 04:06:59,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:59,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 04:06:59,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:59,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 04:06:59,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 04:06:59,366 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 112 [2022-01-19 04:06:59,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 187 transitions, 1462 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 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 04:06:59,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:59,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 112 [2022-01-19 04:06:59,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:59,568 INFO L129 PetriNetUnfolder]: 270/1876 cut-off events. [2022-01-19 04:06:59,568 INFO L130 PetriNetUnfolder]: For 4476/4584 co-relation queries the response was YES. [2022-01-19 04:06:59,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5804 conditions, 1876 events. 270/1876 cut-off events. For 4476/4584 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 18462 event pairs, 52 based on Foata normal form. 93/1955 useless extension candidates. Maximal degree in co-relation 5661. Up to 171 conditions per place. [2022-01-19 04:06:59,580 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 18 selfloop transitions, 8 changer transitions 24/176 dead transitions. [2022-01-19 04:06:59,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 176 transitions, 1192 flow [2022-01-19 04:06:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 04:06:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 04:06:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2022-01-19 04:06:59,581 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9125 [2022-01-19 04:06:59,582 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2022-01-19 04:06:59,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2022-01-19 04:06:59,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:59,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2022-01-19 04:06:59,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 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 04:06:59,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:59,584 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:59,584 INFO L186 Difference]: Start difference. First operand has 164 places, 187 transitions, 1462 flow. Second operand 5 states and 511 transitions. [2022-01-19 04:06:59,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 176 transitions, 1192 flow [2022-01-19 04:06:59,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 176 transitions, 1115 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-01-19 04:06:59,604 INFO L242 Difference]: Finished difference. Result has 164 places, 145 transitions, 852 flow [2022-01-19 04:06:59,604 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=852, PETRI_PLACES=164, PETRI_TRANSITIONS=145} [2022-01-19 04:06:59,604 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 59 predicate places. [2022-01-19 04:06:59,604 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 145 transitions, 852 flow [2022-01-19 04:06:59,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 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 04:06:59,605 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:06:59,605 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] [2022-01-19 04:06:59,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:06:59,605 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:06:59,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:06:59,605 INFO L85 PathProgramCache]: Analyzing trace with hash -783498844, now seen corresponding path program 2 times [2022-01-19 04:06:59,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:06:59,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693649737] [2022-01-19 04:06:59,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:06:59,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:06:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:06:59,643 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 04:06:59,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:06:59,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693649737] [2022-01-19 04:06:59,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693649737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:06:59,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:06:59,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 04:06:59,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805246226] [2022-01-19 04:06:59,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:06:59,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 04:06:59,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:59,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 04:06:59,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 04:06:59,645 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 112 [2022-01-19 04:06:59,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 145 transitions, 852 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 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 04:06:59,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:59,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 112 [2022-01-19 04:06:59,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:59,719 INFO L129 PetriNetUnfolder]: 81/675 cut-off events. [2022-01-19 04:06:59,719 INFO L130 PetriNetUnfolder]: For 1642/1648 co-relation queries the response was YES. [2022-01-19 04:06:59,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2237 conditions, 675 events. 81/675 cut-off events. For 1642/1648 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4571 event pairs, 26 based on Foata normal form. 11/681 useless extension candidates. Maximal degree in co-relation 2207. Up to 80 conditions per place. [2022-01-19 04:06:59,722 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 0 selfloop transitions, 0 changer transitions 116/116 dead transitions. [2022-01-19 04:06:59,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 116 transitions, 564 flow [2022-01-19 04:06:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 04:06:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 04:06:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2022-01-19 04:06:59,723 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9017857142857143 [2022-01-19 04:06:59,723 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2022-01-19 04:06:59,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2022-01-19 04:06:59,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:06:59,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2022-01-19 04:06:59,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 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 04:06:59,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:59,726 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:06:59,726 INFO L186 Difference]: Start difference. First operand has 164 places, 145 transitions, 852 flow. Second operand 5 states and 505 transitions. [2022-01-19 04:06:59,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 116 transitions, 564 flow [2022-01-19 04:06:59,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 116 transitions, 464 flow, removed 14 selfloop flow, removed 21 redundant places. [2022-01-19 04:06:59,730 INFO L242 Difference]: Finished difference. Result has 134 places, 0 transitions, 0 flow [2022-01-19 04:06:59,731 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=134, PETRI_TRANSITIONS=0} [2022-01-19 04:06:59,732 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 29 predicate places. [2022-01-19 04:06:59,732 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 0 transitions, 0 flow [2022-01-19 04:06:59,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 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 04:06:59,734 INFO L764 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 04:06:59,734 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (5 of 7 remaining) [2022-01-19 04:06:59,734 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 04:06:59,735 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 04:06:59,735 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 04:06:59,735 INFO L764 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-01-19 04:06:59,735 INFO L764 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 04:06:59,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:06:59,737 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2022-01-19 04:06:59,740 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:06:59,740 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:06:59,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:06:59 BasicIcfg [2022-01-19 04:06:59,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:06:59,748 INFO L158 Benchmark]: Toolchain (without parser) took 5010.39ms. Allocated memory was 402.7MB in the beginning and 851.4MB in the end (delta: 448.8MB). Free memory was 345.4MB in the beginning and 773.0MB in the end (delta: -427.6MB). Peak memory consumption was 509.8MB. Max. memory is 16.0GB. [2022-01-19 04:06:59,748 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 402.7MB. Free memory is still 363.4MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:06:59,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.99ms. Allocated memory was 402.7MB in the beginning and 484.4MB in the end (delta: 81.8MB). Free memory was 345.1MB in the beginning and 447.1MB in the end (delta: -102.0MB). Peak memory consumption was 7.2MB. Max. memory is 16.0GB. [2022-01-19 04:06:59,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.20ms. Allocated memory is still 484.4MB. Free memory was 447.1MB in the beginning and 445.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:06:59,748 INFO L158 Benchmark]: Boogie Preprocessor took 20.14ms. Allocated memory is still 484.4MB. Free memory was 445.0MB in the beginning and 442.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:06:59,750 INFO L158 Benchmark]: RCFGBuilder took 289.79ms. Allocated memory is still 484.4MB. Free memory was 442.9MB in the beginning and 427.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 04:06:59,750 INFO L158 Benchmark]: TraceAbstraction took 4374.66ms. Allocated memory was 484.4MB in the beginning and 851.4MB in the end (delta: 367.0MB). Free memory was 426.1MB in the beginning and 773.0MB in the end (delta: -346.8MB). Peak memory consumption was 511.8MB. Max. memory is 16.0GB. [2022-01-19 04:06:59,751 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 402.7MB. Free memory is still 363.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 287.99ms. Allocated memory was 402.7MB in the beginning and 484.4MB in the end (delta: 81.8MB). Free memory was 345.1MB in the beginning and 447.1MB in the end (delta: -102.0MB). Peak memory consumption was 7.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 28.20ms. Allocated memory is still 484.4MB. Free memory was 447.1MB in the beginning and 445.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.14ms. Allocated memory is still 484.4MB. Free memory was 445.0MB in the beginning and 442.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 289.79ms. Allocated memory is still 484.4MB. Free memory was 442.9MB in the beginning and 427.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 4374.66ms. Allocated memory was 484.4MB in the beginning and 851.4MB in the end (delta: 367.0MB). Free memory was 426.1MB in the beginning and 773.0MB in the end (delta: -346.8MB). Peak memory consumption was 511.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 739]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 136 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 437 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 437 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 661 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1263 IncrementalHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 104 mSDtfsCounter, 1263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1462occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-01-19 04:06:59,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...