./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 02:43:04,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 02:43:04,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 02:43:04,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 02:43:04,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 02:43:04,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 02:43:04,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 02:43:04,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 02:43:04,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 02:43:04,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 02:43:04,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 02:43:04,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 02:43:04,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 02:43:04,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 02:43:04,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 02:43:04,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 02:43:04,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 02:43:04,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 02:43:04,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 02:43:04,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 02:43:04,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 02:43:04,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 02:43:04,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 02:43:04,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 02:43:04,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 02:43:04,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 02:43:04,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 02:43:04,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 02:43:04,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 02:43:04,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 02:43:04,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 02:43:04,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 02:43:04,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 02:43:04,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 02:43:04,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 02:43:04,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 02:43:04,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 02:43:04,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 02:43:04,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 02:43:04,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 02:43:04,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 02:43:04,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 02:43:04,969 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 02:43:04,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 02:43:04,970 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 02:43:04,970 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 02:43:04,971 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 02:43:04,971 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 02:43:04,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 02:43:04,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 02:43:04,972 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 02:43:04,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 02:43:04,972 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 02:43:04,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 02:43:04,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 02:43:04,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 02:43:04,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 02:43:04,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 02:43:04,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 02:43:04,973 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 02:43:04,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 02:43:04,973 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 02:43:04,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 02:43:04,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 02:43:04,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 02:43:04,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 02:43:04,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:43:04,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 02:43:04,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 02:43:04,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 02:43:04,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 02:43:04,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 02:43:04,976 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 02:43:04,976 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 02:43:04,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 02:43:04,976 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 02:43:04,976 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2021-12-16 02:43:05,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 02:43:05,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 02:43:05,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 02:43:05,174 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 02:43:05,175 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 02:43:05,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2021-12-16 02:43:05,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5051a565f/b33ec518ba764a87839aab08cb2728a9/FLAGcc8a1e961 [2021-12-16 02:43:05,618 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 02:43:05,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2021-12-16 02:43:05,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5051a565f/b33ec518ba764a87839aab08cb2728a9/FLAGcc8a1e961 [2021-12-16 02:43:05,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5051a565f/b33ec518ba764a87839aab08cb2728a9 [2021-12-16 02:43:05,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 02:43:05,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 02:43:05,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 02:43:05,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 02:43:05,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 02:43:05,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:43:05" (1/1) ... [2021-12-16 02:43:05,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2942d0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:05, skipping insertion in model container [2021-12-16 02:43:05,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:43:05" (1/1) ... [2021-12-16 02:43:05,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 02:43:05,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 02:43:05,819 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-12-16 02:43:05,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2021-12-16 02:43:05,943 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:43:05,955 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 02:43:05,983 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-12-16 02:43:06,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2021-12-16 02:43:06,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:43:06,043 INFO L208 MainTranslator]: Completed translation [2021-12-16 02:43:06,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:06 WrapperNode [2021-12-16 02:43:06,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 02:43:06,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 02:43:06,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 02:43:06,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 02:43:06,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:06" (1/1) ... [2021-12-16 02:43:06,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:06" (1/1) ... [2021-12-16 02:43:06,091 INFO L137 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2021-12-16 02:43:06,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 02:43:06,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 02:43:06,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 02:43:06,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 02:43:06,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:06" (1/1) ... [2021-12-16 02:43:06,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:06" (1/1) ... [2021-12-16 02:43:06,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:06" (1/1) ... [2021-12-16 02:43:06,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:06" (1/1) ... [2021-12-16 02:43:06,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:06" (1/1) ... [2021-12-16 02:43:06,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:06" (1/1) ... [2021-12-16 02:43:06,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:06" (1/1) ... [2021-12-16 02:43:06,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 02:43:06,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 02:43:06,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 02:43:06,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 02:43:06,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:06" (1/1) ... [2021-12-16 02:43:06,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:43:06,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:43:06,177 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) [2021-12-16 02:43:06,204 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 [2021-12-16 02:43:06,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 02:43:06,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 02:43:06,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-16 02:43:06,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 02:43:06,227 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2021-12-16 02:43:06,227 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2021-12-16 02:43:06,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 02:43:06,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 02:43:06,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 02:43:06,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-16 02:43:06,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 02:43:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 02:43:06,228 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2021-12-16 02:43:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2021-12-16 02:43:06,229 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-16 02:43:06,335 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 02:43:06,336 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 02:43:06,485 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 02:43:06,505 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 02:43:06,506 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-16 02:43:06,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:43:06 BoogieIcfgContainer [2021-12-16 02:43:06,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 02:43:06,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 02:43:06,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 02:43:06,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 02:43:06,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:43:05" (1/3) ... [2021-12-16 02:43:06,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c225bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:43:06, skipping insertion in model container [2021-12-16 02:43:06,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:06" (2/3) ... [2021-12-16 02:43:06,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c225bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:43:06, skipping insertion in model container [2021-12-16 02:43:06,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:43:06" (3/3) ... [2021-12-16 02:43:06,515 INFO L111 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2021-12-16 02:43:06,518 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-16 02:43:06,518 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 02:43:06,518 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 02:43:06,518 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-16 02:43:06,547 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,547 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,548 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,548 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,548 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,548 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,548 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,548 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,549 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,549 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,549 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,549 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,549 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,550 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,550 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,550 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,550 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,551 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,551 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,551 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,552 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,552 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,552 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,552 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,552 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,553 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,554 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,554 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,554 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,554 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,554 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,555 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,555 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,555 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,556 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,556 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,556 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,556 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,557 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,558 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,558 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,558 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,558 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,558 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,558 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,559 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,559 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,559 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,559 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,560 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,560 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,563 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,564 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,564 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,564 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,564 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,564 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,564 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,565 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,565 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,565 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,565 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,565 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,565 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,565 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,566 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,566 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,566 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,566 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,566 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,566 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,567 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,567 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,567 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,570 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,570 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,570 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,570 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,571 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,571 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,572 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,572 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,572 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,572 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,572 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,572 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,572 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,573 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,573 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,573 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,573 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,573 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,574 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,574 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,574 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,574 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,574 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,574 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,575 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,575 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,575 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,575 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,575 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,575 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,575 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,576 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,576 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,576 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,578 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,581 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,581 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,581 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,581 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,581 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,582 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,582 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,582 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,583 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,585 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,585 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,585 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,585 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,585 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,586 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,586 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,586 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,586 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,586 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,587 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,587 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,588 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,588 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,588 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,588 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,589 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,589 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,589 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,589 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:06,592 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-12-16 02:43:06,633 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 02:43:06,638 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=true, 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 [2021-12-16 02:43:06,638 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-16 02:43:06,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 260 flow [2021-12-16 02:43:06,697 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2021-12-16 02:43:06,697 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-16 02:43:06,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 110 events. 2/110 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-12-16 02:43:06,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 114 transitions, 260 flow [2021-12-16 02:43:06,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 96 transitions, 213 flow [2021-12-16 02:43:06,722 INFO L129 PetriNetUnfolder]: 1/59 cut-off events. [2021-12-16 02:43:06,722 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-16 02:43:06,722 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:06,723 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] [2021-12-16 02:43:06,723 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-16 02:43:06,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:06,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2006515335, now seen corresponding path program 1 times [2021-12-16 02:43:06,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:06,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659377881] [2021-12-16 02:43:06,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:06,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:06,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:06,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659377881] [2021-12-16 02:43:06,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659377881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:06,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:06,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:43:06,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793294539] [2021-12-16 02:43:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:06,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:43:06,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:07,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:43:07,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:43:07,021 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2021-12-16 02:43:07,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:07,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:07,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2021-12-16 02:43:07,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:08,027 INFO L129 PetriNetUnfolder]: 3525/7769 cut-off events. [2021-12-16 02:43:08,027 INFO L130 PetriNetUnfolder]: For 1654/1654 co-relation queries the response was YES. [2021-12-16 02:43:08,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13923 conditions, 7769 events. 3525/7769 cut-off events. For 1654/1654 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 71695 event pairs, 961 based on Foata normal form. 422/7837 useless extension candidates. Maximal degree in co-relation 13398. Up to 1729 conditions per place. [2021-12-16 02:43:08,104 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 116 selfloop transitions, 32 changer transitions 0/214 dead transitions. [2021-12-16 02:43:08,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 214 transitions, 823 flow [2021-12-16 02:43:08,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 02:43:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-16 02:43:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1160 transitions. [2021-12-16 02:43:08,121 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2021-12-16 02:43:08,122 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1160 transitions. [2021-12-16 02:43:08,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1160 transitions. [2021-12-16 02:43:08,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:08,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1160 transitions. [2021-12-16 02:43:08,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.66666666666667) internal successors, (1160), 12 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:08,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:08,139 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:08,140 INFO L186 Difference]: Start difference. First operand has 107 places, 96 transitions, 213 flow. Second operand 12 states and 1160 transitions. [2021-12-16 02:43:08,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 214 transitions, 823 flow [2021-12-16 02:43:08,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 214 transitions, 764 flow, removed 0 selfloop flow, removed 7 redundant places. [2021-12-16 02:43:08,158 INFO L242 Difference]: Finished difference. Result has 119 places, 129 transitions, 416 flow [2021-12-16 02:43:08,159 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=416, PETRI_PLACES=119, PETRI_TRANSITIONS=129} [2021-12-16 02:43:08,162 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 12 predicate places. [2021-12-16 02:43:08,162 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 129 transitions, 416 flow [2021-12-16 02:43:08,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:08,163 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:08,163 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] [2021-12-16 02:43:08,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 02:43:08,164 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-16 02:43:08,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:08,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1738116757, now seen corresponding path program 1 times [2021-12-16 02:43:08,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:08,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638027489] [2021-12-16 02:43:08,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:08,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:08,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:08,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638027489] [2021-12-16 02:43:08,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638027489] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:08,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:08,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 02:43:08,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306082323] [2021-12-16 02:43:08,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:08,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:43:08,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:08,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:43:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 02:43:08,260 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 114 [2021-12-16 02:43:08,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 129 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:08,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:08,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 114 [2021-12-16 02:43:08,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:08,466 INFO L129 PetriNetUnfolder]: 412/2302 cut-off events. [2021-12-16 02:43:08,466 INFO L130 PetriNetUnfolder]: For 379/394 co-relation queries the response was YES. [2021-12-16 02:43:08,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 2302 events. 412/2302 cut-off events. For 379/394 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 22522 event pairs, 96 based on Foata normal form. 53/2230 useless extension candidates. Maximal degree in co-relation 3614. Up to 259 conditions per place. [2021-12-16 02:43:08,479 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 15 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2021-12-16 02:43:08,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 134 transitions, 470 flow [2021-12-16 02:43:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:43:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-16 02:43:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2021-12-16 02:43:08,481 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2021-12-16 02:43:08,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2021-12-16 02:43:08,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2021-12-16 02:43:08,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:08,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2021-12-16 02:43:08,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:08,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:08,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:08,483 INFO L186 Difference]: Start difference. First operand has 119 places, 129 transitions, 416 flow. Second operand 3 states and 314 transitions. [2021-12-16 02:43:08,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 134 transitions, 470 flow [2021-12-16 02:43:08,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 134 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 02:43:08,491 INFO L242 Difference]: Finished difference. Result has 122 places, 129 transitions, 432 flow [2021-12-16 02:43:08,492 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2021-12-16 02:43:08,492 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 15 predicate places. [2021-12-16 02:43:08,492 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 432 flow [2021-12-16 02:43:08,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:08,493 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:08,493 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] [2021-12-16 02:43:08,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 02:43:08,493 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-16 02:43:08,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash -546292075, now seen corresponding path program 2 times [2021-12-16 02:43:08,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:08,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379205794] [2021-12-16 02:43:08,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:08,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:08,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:08,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379205794] [2021-12-16 02:43:08,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379205794] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:08,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:08,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:43:08,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284626278] [2021-12-16 02:43:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:08,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:43:08,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:08,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:43:08,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:43:08,590 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2021-12-16 02:43:08,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:08,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:08,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2021-12-16 02:43:08,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:09,108 INFO L129 PetriNetUnfolder]: 1590/4818 cut-off events. [2021-12-16 02:43:09,108 INFO L130 PetriNetUnfolder]: For 2362/2464 co-relation queries the response was YES. [2021-12-16 02:43:09,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10147 conditions, 4818 events. 1590/4818 cut-off events. For 2362/2464 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 48905 event pairs, 145 based on Foata normal form. 50/4728 useless extension candidates. Maximal degree in co-relation 8937. Up to 767 conditions per place. [2021-12-16 02:43:09,144 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 45 selfloop transitions, 19 changer transitions 4/175 dead transitions. [2021-12-16 02:43:09,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 175 transitions, 737 flow [2021-12-16 02:43:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:43:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-16 02:43:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2021-12-16 02:43:09,146 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9087719298245615 [2021-12-16 02:43:09,146 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2021-12-16 02:43:09,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2021-12-16 02:43:09,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:09,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2021-12-16 02:43:09,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:09,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:09,149 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:09,150 INFO L186 Difference]: Start difference. First operand has 122 places, 129 transitions, 432 flow. Second operand 5 states and 518 transitions. [2021-12-16 02:43:09,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 175 transitions, 737 flow [2021-12-16 02:43:09,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 175 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-16 02:43:09,167 INFO L242 Difference]: Finished difference. Result has 124 places, 143 transitions, 510 flow [2021-12-16 02:43:09,168 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=124, PETRI_TRANSITIONS=143} [2021-12-16 02:43:09,169 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 17 predicate places. [2021-12-16 02:43:09,169 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 143 transitions, 510 flow [2021-12-16 02:43:09,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:09,170 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:09,170 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] [2021-12-16 02:43:09,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 02:43:09,170 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-16 02:43:09,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash 579299824, now seen corresponding path program 1 times [2021-12-16 02:43:09,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:09,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912068448] [2021-12-16 02:43:09,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:09,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:09,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:09,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912068448] [2021-12-16 02:43:09,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912068448] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:09,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:09,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:43:09,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180225174] [2021-12-16 02:43:09,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:09,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:43:09,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:09,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:43:09,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:43:09,224 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2021-12-16 02:43:09,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 143 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 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) [2021-12-16 02:43:09,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:09,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2021-12-16 02:43:09,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:10,967 INFO L129 PetriNetUnfolder]: 8131/17870 cut-off events. [2021-12-16 02:43:10,968 INFO L130 PetriNetUnfolder]: For 15541/15620 co-relation queries the response was YES. [2021-12-16 02:43:11,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44383 conditions, 17870 events. 8131/17870 cut-off events. For 15541/15620 co-relation queries the response was YES. Maximal size of possible extension queue 1622. Compared 195712 event pairs, 1270 based on Foata normal form. 20/17360 useless extension candidates. Maximal degree in co-relation 43808. Up to 3340 conditions per place. [2021-12-16 02:43:11,155 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 207 selfloop transitions, 134 changer transitions 25/442 dead transitions. [2021-12-16 02:43:11,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 442 transitions, 2686 flow [2021-12-16 02:43:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 02:43:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-16 02:43:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1151 transitions. [2021-12-16 02:43:11,159 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.841374269005848 [2021-12-16 02:43:11,159 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1151 transitions. [2021-12-16 02:43:11,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1151 transitions. [2021-12-16 02:43:11,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:11,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1151 transitions. [2021-12-16 02:43:11,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 95.91666666666667) internal successors, (1151), 12 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:11,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:11,167 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:11,167 INFO L186 Difference]: Start difference. First operand has 124 places, 143 transitions, 510 flow. Second operand 12 states and 1151 transitions. [2021-12-16 02:43:11,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 442 transitions, 2686 flow [2021-12-16 02:43:11,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 442 transitions, 2680 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-12-16 02:43:11,393 INFO L242 Difference]: Finished difference. Result has 143 places, 298 transitions, 1900 flow [2021-12-16 02:43:11,394 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1900, PETRI_PLACES=143, PETRI_TRANSITIONS=298} [2021-12-16 02:43:11,394 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 36 predicate places. [2021-12-16 02:43:11,394 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 298 transitions, 1900 flow [2021-12-16 02:43:11,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 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) [2021-12-16 02:43:11,395 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:11,395 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] [2021-12-16 02:43:11,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 02:43:11,396 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-16 02:43:11,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1097766141, now seen corresponding path program 1 times [2021-12-16 02:43:11,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:11,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779753157] [2021-12-16 02:43:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:11,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:11,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:11,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779753157] [2021-12-16 02:43:11,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779753157] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:11,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:11,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:43:11,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678132976] [2021-12-16 02:43:11,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:11,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:43:11,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:11,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:43:11,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:43:11,441 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2021-12-16 02:43:11,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 298 transitions, 1900 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:11,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:11,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2021-12-16 02:43:11,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:13,612 INFO L129 PetriNetUnfolder]: 9006/19880 cut-off events. [2021-12-16 02:43:13,612 INFO L130 PetriNetUnfolder]: For 29257/29355 co-relation queries the response was YES. [2021-12-16 02:43:13,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59351 conditions, 19880 events. 9006/19880 cut-off events. For 29257/29355 co-relation queries the response was YES. Maximal size of possible extension queue 1796. Compared 221506 event pairs, 1488 based on Foata normal form. 223/19911 useless extension candidates. Maximal degree in co-relation 58727. Up to 4759 conditions per place. [2021-12-16 02:43:13,775 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 237 selfloop transitions, 206 changer transitions 5/524 dead transitions. [2021-12-16 02:43:13,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 524 transitions, 4189 flow [2021-12-16 02:43:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:43:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 02:43:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1235 transitions. [2021-12-16 02:43:13,779 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-12-16 02:43:13,779 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1235 transitions. [2021-12-16 02:43:13,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1235 transitions. [2021-12-16 02:43:13,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:13,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1235 transitions. [2021-12-16 02:43:13,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.0) internal successors, (1235), 13 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:13,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:13,786 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:13,786 INFO L186 Difference]: Start difference. First operand has 143 places, 298 transitions, 1900 flow. Second operand 13 states and 1235 transitions. [2021-12-16 02:43:13,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 524 transitions, 4189 flow [2021-12-16 02:43:14,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 524 transitions, 4189 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 02:43:14,310 INFO L242 Difference]: Finished difference. Result has 163 places, 386 transitions, 3338 flow [2021-12-16 02:43:14,310 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3338, PETRI_PLACES=163, PETRI_TRANSITIONS=386} [2021-12-16 02:43:14,311 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 56 predicate places. [2021-12-16 02:43:14,311 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 386 transitions, 3338 flow [2021-12-16 02:43:14,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:14,312 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:14,312 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] [2021-12-16 02:43:14,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 02:43:14,312 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-16 02:43:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:14,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1042275993, now seen corresponding path program 1 times [2021-12-16 02:43:14,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:14,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449695303] [2021-12-16 02:43:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:14,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:14,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:14,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449695303] [2021-12-16 02:43:14,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449695303] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:14,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:14,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:43:14,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683754473] [2021-12-16 02:43:14,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:14,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:43:14,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:14,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:43:14,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:43:14,352 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2021-12-16 02:43:14,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 386 transitions, 3338 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:14,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:14,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2021-12-16 02:43:14,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:17,039 INFO L129 PetriNetUnfolder]: 9876/21673 cut-off events. [2021-12-16 02:43:17,040 INFO L130 PetriNetUnfolder]: For 52107/52157 co-relation queries the response was YES. [2021-12-16 02:43:17,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71027 conditions, 21673 events. 9876/21673 cut-off events. For 52107/52157 co-relation queries the response was YES. Maximal size of possible extension queue 1941. Compared 241875 event pairs, 1828 based on Foata normal form. 239/21705 useless extension candidates. Maximal degree in co-relation 67915. Up to 5676 conditions per place. [2021-12-16 02:43:17,189 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 295 selfloop transitions, 249 changer transitions 8/643 dead transitions. [2021-12-16 02:43:17,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 643 transitions, 6329 flow [2021-12-16 02:43:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:43:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 02:43:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1239 transitions. [2021-12-16 02:43:17,192 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8360323886639676 [2021-12-16 02:43:17,192 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1239 transitions. [2021-12-16 02:43:17,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1239 transitions. [2021-12-16 02:43:17,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:17,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1239 transitions. [2021-12-16 02:43:17,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.3076923076923) internal successors, (1239), 13 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:17,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:17,197 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:17,197 INFO L186 Difference]: Start difference. First operand has 163 places, 386 transitions, 3338 flow. Second operand 13 states and 1239 transitions. [2021-12-16 02:43:17,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 643 transitions, 6329 flow [2021-12-16 02:43:18,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 643 transitions, 6261 flow, removed 18 selfloop flow, removed 1 redundant places. [2021-12-16 02:43:18,042 INFO L242 Difference]: Finished difference. Result has 182 places, 484 transitions, 5114 flow [2021-12-16 02:43:18,042 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=3294, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5114, PETRI_PLACES=182, PETRI_TRANSITIONS=484} [2021-12-16 02:43:18,043 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 75 predicate places. [2021-12-16 02:43:18,043 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 484 transitions, 5114 flow [2021-12-16 02:43:18,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:18,044 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:18,044 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] [2021-12-16 02:43:18,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 02:43:18,044 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-16 02:43:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:18,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1127280812, now seen corresponding path program 1 times [2021-12-16 02:43:18,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:18,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138394860] [2021-12-16 02:43:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:18,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:18,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:18,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138394860] [2021-12-16 02:43:18,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138394860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:18,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:18,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 02:43:18,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159763368] [2021-12-16 02:43:18,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:18,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:43:18,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:18,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:43:18,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:43:18,085 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 114 [2021-12-16 02:43:18,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 484 transitions, 5114 flow. Second operand has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:18,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:18,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 114 [2021-12-16 02:43:18,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:18,538 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([261] L738-2-->L741: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_7| (+ v_~r~0_3 (- 1))) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1][244], [Black: 248#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), Black: 171#true, Black: 182#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~l~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), Black: 241#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 180#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~l~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|)), Black: 244#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|)), Black: 254#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), Black: 186#(and (= |readerThread1of1ForFork3_~l~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|)), Black: 234#true, Black: 173#(= |readerThread1of1ForFork3_~l~0#1| ~x~0), Black: 188#(and (= |readerThread1of1ForFork3_~l~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), Black: 252#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|)), Black: 237#(= ~y~0 ~x~0), Black: 178#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~l~0#1| ~x~0)), 133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 239#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 119#L741true, Black: 130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 143#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 145#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 58#L754-2true, Black: 128#true, Black: 135#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 220#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~y~0 ~x~0)), Black: 205#(= ~y~0 ~x~0), Black: 216#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork3_~l~0#1| ~x~0)), Black: 222#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 209#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~l~0#1| ~x~0)), 73#L717true, Black: 202#true, Black: 212#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~l~0#1| ~x~0)), 268#(= ~r~0 0), 169#(and (= ~r~0 0) (not (= 0 ~w~0))), 207#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), readerThread1of1ForFork3InUse, 176#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)]) [2021-12-16 02:43:18,538 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-16 02:43:18,539 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-16 02:43:18,539 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-16 02:43:18,539 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-16 02:43:18,558 INFO L129 PetriNetUnfolder]: 947/3465 cut-off events. [2021-12-16 02:43:18,558 INFO L130 PetriNetUnfolder]: For 8663/8734 co-relation queries the response was YES. [2021-12-16 02:43:18,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10659 conditions, 3465 events. 947/3465 cut-off events. For 8663/8734 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 34497 event pairs, 124 based on Foata normal form. 114/3539 useless extension candidates. Maximal degree in co-relation 10387. Up to 547 conditions per place. [2021-12-16 02:43:18,578 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 40 selfloop transitions, 11 changer transitions 44/281 dead transitions. [2021-12-16 02:43:18,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 281 transitions, 2262 flow [2021-12-16 02:43:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:43:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-16 02:43:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2021-12-16 02:43:18,579 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2021-12-16 02:43:18,579 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2021-12-16 02:43:18,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2021-12-16 02:43:18,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:18,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2021-12-16 02:43:18,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:18,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:18,582 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:18,582 INFO L186 Difference]: Start difference. First operand has 182 places, 484 transitions, 5114 flow. Second operand 5 states and 522 transitions. [2021-12-16 02:43:18,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 281 transitions, 2262 flow [2021-12-16 02:43:18,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 281 transitions, 2219 flow, removed 8 selfloop flow, removed 1 redundant places. [2021-12-16 02:43:18,631 INFO L242 Difference]: Finished difference. Result has 185 places, 226 transitions, 1692 flow [2021-12-16 02:43:18,632 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1692, PETRI_PLACES=185, PETRI_TRANSITIONS=226} [2021-12-16 02:43:18,632 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 78 predicate places. [2021-12-16 02:43:18,632 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 226 transitions, 1692 flow [2021-12-16 02:43:18,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:18,633 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:18,633 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:18,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 02:43:18,633 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-16 02:43:18,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash 389266576, now seen corresponding path program 1 times [2021-12-16 02:43:18,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:18,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307179219] [2021-12-16 02:43:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:18,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:18,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:18,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307179219] [2021-12-16 02:43:18,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307179219] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:18,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:18,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:43:18,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422716787] [2021-12-16 02:43:18,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:18,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:43:18,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:18,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:43:18,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:43:18,678 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2021-12-16 02:43:18,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 226 transitions, 1692 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:18,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:18,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2021-12-16 02:43:18,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:19,066 INFO L129 PetriNetUnfolder]: 879/3214 cut-off events. [2021-12-16 02:43:19,066 INFO L130 PetriNetUnfolder]: For 8910/8973 co-relation queries the response was YES. [2021-12-16 02:43:19,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10814 conditions, 3214 events. 879/3214 cut-off events. For 8910/8973 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 32093 event pairs, 138 based on Foata normal form. 12/3191 useless extension candidates. Maximal degree in co-relation 10370. Up to 328 conditions per place. [2021-12-16 02:43:19,093 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 55 selfloop transitions, 17 changer transitions 37/283 dead transitions. [2021-12-16 02:43:19,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 283 transitions, 2246 flow [2021-12-16 02:43:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 02:43:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-16 02:43:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 803 transitions. [2021-12-16 02:43:19,095 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8804824561403509 [2021-12-16 02:43:19,096 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 803 transitions. [2021-12-16 02:43:19,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 803 transitions. [2021-12-16 02:43:19,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:19,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 803 transitions. [2021-12-16 02:43:19,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.375) internal successors, (803), 8 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:19,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:19,099 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:19,099 INFO L186 Difference]: Start difference. First operand has 185 places, 226 transitions, 1692 flow. Second operand 8 states and 803 transitions. [2021-12-16 02:43:19,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 283 transitions, 2246 flow [2021-12-16 02:43:19,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 283 transitions, 2191 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-12-16 02:43:19,152 INFO L242 Difference]: Finished difference. Result has 189 places, 226 transitions, 1707 flow [2021-12-16 02:43:19,152 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1707, PETRI_PLACES=189, PETRI_TRANSITIONS=226} [2021-12-16 02:43:19,153 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 82 predicate places. [2021-12-16 02:43:19,153 INFO L470 AbstractCegarLoop]: Abstraction has has 189 places, 226 transitions, 1707 flow [2021-12-16 02:43:19,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:19,154 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:19,154 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:19,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 02:43:19,154 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-16 02:43:19,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:19,154 INFO L85 PathProgramCache]: Analyzing trace with hash -295816392, now seen corresponding path program 2 times [2021-12-16 02:43:19,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:19,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857322472] [2021-12-16 02:43:19,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:19,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:19,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:19,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857322472] [2021-12-16 02:43:19,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857322472] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:19,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:19,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:43:19,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785368122] [2021-12-16 02:43:19,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:19,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:43:19,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:19,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:43:19,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:43:19,199 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2021-12-16 02:43:19,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 226 transitions, 1707 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:19,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:19,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2021-12-16 02:43:19,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:19,463 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([246] L738-2-->L741: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_7| (+ v_~r~0_3 (- 1))) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][223], [Black: 248#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), Black: 171#true, Black: 241#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 182#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~l~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), Black: 244#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|)), 288#(= ~r~0 0), Black: 180#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~l~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|)), Black: 254#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), Black: 186#(and (= |readerThread1of1ForFork3_~l~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|)), Black: 234#true, Black: 173#(= |readerThread1of1ForFork3_~l~0#1| ~x~0), Black: 252#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|)), Black: 188#(and (= |readerThread1of1ForFork3_~l~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), 274#(= ~r~0 0), Black: 237#(= ~y~0 ~x~0), Black: 178#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~l~0#1| ~x~0)), 133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 239#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 143#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 145#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#true, Black: 135#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 275#(<= 1 ~r~0), 75#L753-2true, Black: 220#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~y~0 ~x~0)), Black: 205#(= ~y~0 ~x~0), Black: 216#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork3_~l~0#1| ~x~0)), Black: 222#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 73#L717true, Black: 209#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~l~0#1| ~x~0)), Black: 202#true, Black: 212#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~l~0#1| ~x~0)), 36#L741true, 43#L744true, 207#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), readerThread1of1ForFork3InUse, 176#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)]) [2021-12-16 02:43:19,463 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2021-12-16 02:43:19,463 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-16 02:43:19,463 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-16 02:43:19,463 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-16 02:43:19,487 INFO L129 PetriNetUnfolder]: 672/2660 cut-off events. [2021-12-16 02:43:19,487 INFO L130 PetriNetUnfolder]: For 6989/7058 co-relation queries the response was YES. [2021-12-16 02:43:19,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8709 conditions, 2660 events. 672/2660 cut-off events. For 6989/7058 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 25799 event pairs, 128 based on Foata normal form. 63/2682 useless extension candidates. Maximal degree in co-relation 8405. Up to 406 conditions per place. [2021-12-16 02:43:19,504 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 51 selfloop transitions, 14 changer transitions 23/244 dead transitions. [2021-12-16 02:43:19,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 244 transitions, 1889 flow [2021-12-16 02:43:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:43:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-16 02:43:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions. [2021-12-16 02:43:19,506 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8759398496240601 [2021-12-16 02:43:19,506 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 699 transitions. [2021-12-16 02:43:19,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions. [2021-12-16 02:43:19,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:19,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions. [2021-12-16 02:43:19,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:19,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:19,510 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:19,510 INFO L186 Difference]: Start difference. First operand has 189 places, 226 transitions, 1707 flow. Second operand 7 states and 699 transitions. [2021-12-16 02:43:19,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 244 transitions, 1889 flow [2021-12-16 02:43:19,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 244 transitions, 1830 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-12-16 02:43:19,546 INFO L242 Difference]: Finished difference. Result has 192 places, 203 transitions, 1418 flow [2021-12-16 02:43:19,547 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1418, PETRI_PLACES=192, PETRI_TRANSITIONS=203} [2021-12-16 02:43:19,547 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 85 predicate places. [2021-12-16 02:43:19,547 INFO L470 AbstractCegarLoop]: Abstraction has has 192 places, 203 transitions, 1418 flow [2021-12-16 02:43:19,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:19,548 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:19,548 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:19,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 02:43:19,548 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2021-12-16 02:43:19,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1173174580, now seen corresponding path program 3 times [2021-12-16 02:43:19,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:19,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908288420] [2021-12-16 02:43:19,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:19,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 02:43:19,560 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 02:43:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 02:43:19,639 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 02:43:19,641 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 02:43:19,641 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-16 02:43:19,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-16 02:43:19,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-16 02:43:19,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-16 02:43:19,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-16 02:43:19,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-16 02:43:19,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-16 02:43:19,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 02:43:19,648 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2021-12-16 02:43:19,652 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-16 02:43:19,652 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 02:43:19,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:43:19 BasicIcfg [2021-12-16 02:43:19,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 02:43:19,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 02:43:19,692 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 02:43:19,693 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 02:43:19,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:43:06" (3/4) ... [2021-12-16 02:43:19,694 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 02:43:19,758 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 02:43:19,759 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 02:43:19,759 INFO L158 Benchmark]: Toolchain (without parser) took 14115.75ms. Allocated memory was 104.9MB in the beginning and 6.2GB in the end (delta: 6.1GB). Free memory was 75.6MB in the beginning and 5.6GB in the end (delta: -5.6GB). Peak memory consumption was 515.1MB. Max. memory is 16.1GB. [2021-12-16 02:43:19,759 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 39.0MB in the beginning and 38.9MB in the end (delta: 46.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 02:43:19,760 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.10ms. Allocated memory is still 104.9MB. Free memory was 75.6MB in the beginning and 71.6MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 02:43:19,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.82ms. Allocated memory is still 104.9MB. Free memory was 71.6MB in the beginning and 69.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 02:43:19,760 INFO L158 Benchmark]: Boogie Preprocessor took 41.50ms. Allocated memory is still 104.9MB. Free memory was 69.5MB in the beginning and 67.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 02:43:19,761 INFO L158 Benchmark]: RCFGBuilder took 372.08ms. Allocated memory is still 104.9MB. Free memory was 67.9MB in the beginning and 53.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-16 02:43:19,761 INFO L158 Benchmark]: TraceAbstraction took 13183.44ms. Allocated memory was 104.9MB in the beginning and 6.2GB in the end (delta: 6.1GB). Free memory was 53.2MB in the beginning and 5.6GB in the end (delta: -5.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2021-12-16 02:43:19,762 INFO L158 Benchmark]: Witness Printer took 66.43ms. Allocated memory is still 6.2GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-16 02:43:19,763 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.17ms. Allocated memory is still 81.8MB. Free memory was 39.0MB in the beginning and 38.9MB in the end (delta: 46.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.10ms. Allocated memory is still 104.9MB. Free memory was 75.6MB in the beginning and 71.6MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.82ms. Allocated memory is still 104.9MB. Free memory was 71.6MB in the beginning and 69.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.50ms. Allocated memory is still 104.9MB. Free memory was 69.5MB in the beginning and 67.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.08ms. Allocated memory is still 104.9MB. Free memory was 67.9MB in the beginning and 53.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13183.44ms. Allocated memory was 104.9MB in the beginning and 6.2GB in the end (delta: 6.1GB). Free memory was 53.2MB in the beginning and 5.6GB in the end (delta: -5.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 66.43ms. Allocated memory is still 6.2GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 738]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 int w=0, r=0, x, y; VAL [r=0, w=0, x=0, y=0] [L748] 0 pthread_t t1, t2, t3, t4; VAL [r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-3, r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=-2, r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L724] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=-1, r=1, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [pthread_create(&t4, 0, reader, 0)=0, r=1, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L724] 4 int l; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L730] 4 y = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L733] 4 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] 4 reach_error() VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 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: 13.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 597 mSDsluCounter, 395 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 767 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1500 IncrementalHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 172 mSDtfsCounter, 1500 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5114occurred in iteration=6, InterpolantAutomatonStates: 78, 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, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-16 02:43:19,793 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE